Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls.
Telmo PintoCláudio AlvesJosé M. Valério de CarvalhoPublished in: Int. Trans. Oper. Res. (2020)
Keyphrases
- vehicle routing problem
- tabu search
- search algorithm
- metaheuristic
- routing problem
- vehicle routing
- benchmark problems
- vehicle routing problem with time windows
- test instances
- hybrid metaheuristic
- memetic algorithm
- combinatorial optimization
- traveling salesman problem
- travel time
- feasible solution
- search strategies
- scheduling problem
- np hard
- knapsack problem
- search methods
- branch and bound
- mixed integer
- simulated annealing
- optimal solution
- objective function
- constraint satisfaction
- max sat
- benchmark instances
- variable neighborhood search