Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations.
Nicos ChristofidesAristide MingozziPaolo TothPublished in: Math. Program. (1981)
Keyphrases
- shortest path
- exact algorithms
- vehicle routing problem
- spanning tree
- np hard
- minimum cost
- approximation algorithms
- knapsack problem
- combinatorial optimization problems
- combinatorial optimization
- weighted graph
- vehicle routing problem with time windows
- minimum spanning tree
- benchmark instances
- lower bound
- metaheuristic
- routing problem
- optimal solution
- linear programming
- traveling salesman problem
- test instances
- combinatorial problems
- travel time
- special case
- branch and bound algorithm
- scheduling problem
- np complete
- routing algorithm
- worst case
- exact solution
- integer programming
- tabu search
- road network
- memetic algorithm
- undirected graph
- heuristic methods
- max sat
- edge weights
- lagrangian relaxation
- linear program
- particle swarm optimization
- simulated annealing
- geodesic distance
- search algorithm
- dynamic programming
- optimal path
- optimization problems
- objective function