Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem.
Katrin HeßlerStefan IrnichPublished in: INFORMS J. Comput. (2023)
Keyphrases
- vehicle routing problem
- tabu search
- metaheuristic
- vehicle routing
- hybrid metaheuristic
- routing problem
- traveling salesman problem
- test instances
- vehicle routing problem with time windows
- benchmark problems
- combinatorial optimization
- memetic algorithm
- multi depot
- benchmark instances
- knapsack problem
- np hard
- particle swarm optimization
- travel time
- search strategies
- variable neighborhood search
- neighborhood search
- iterated local search
- logistics distribution
- pick up and delivery
- simulated annealing
- scatter search
- scheduling problem
- lower bound