A branch-and-price-based heuristic for the vehicle routing problem with two-dimensional loading constraints and time windows.
Bin JiSaiqi ZhouDezhi ZhangSamson S. YuPublished in: Int. Trans. Oper. Res. (2024)
Keyphrases
- vehicle routing problem
- tabu search
- benchmark instances
- metaheuristic
- multi depot
- dantzig wolfe
- tree search algorithm
- test instances
- combinatorial optimization
- vehicle routing
- iterated local search
- routing problem
- variable neighborhood search
- traveling salesman problem
- simulated annealing
- vehicle routing problem with time windows
- benchmark problems
- hybrid metaheuristic
- travel time
- np hard
- neighborhood search
- particle swarm optimization
- optimal solution
- memetic algorithm
- feasible solution
- search strategies
- greedy randomized adaptive search procedure
- logistics distribution
- heuristic methods
- search procedure
- solution quality
- packing problem
- vehicle routing problem with simultaneous
- neural network
- search algorithm
- constraint satisfaction
- dynamic programming
- optimization problems
- genetic algorithm
- search space
- special case
- job shop scheduling problem
- multi start
- path relinking
- scatter search
- upper bound
- scheduling problem
- ant colony optimization
- pick up and delivery
- constraint programming
- search methods