Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints.
Roberto BaldacciAristide MingozziRoberto RobertiPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- exact algorithms
- vehicle routing problem
- combinatorial optimization
- vehicle routing problem with time windows
- benchmark instances
- combinatorial problems
- knapsack problem
- combinatorial optimization problems
- metaheuristic
- exact solution
- traveling salesman problem
- routing problem
- simulated annealing
- branch and bound
- tabu search
- hybrid metaheuristic
- test instances
- branch and bound algorithm
- approximation algorithms
- lp relaxation
- travel time
- optimization problems
- vehicle routing problem with simultaneous
- np hard
- memetic algorithm
- benchmark problems
- constraint satisfaction
- neural network
- constraint programming
- information retrieval systems
- pick up and delivery
- constraint satisfaction problems
- particle swarm optimization
- network design problem
- multi objective
- special case