Two exact algorithms for the distance-constrained vehicle routing problem.
Gilbert LaporteMartin DesrochersYves NobertPublished in: Networks (1984)
Keyphrases
- exact algorithms
- vehicle routing problem
- vehicle routing problem with time windows
- benchmark instances
- knapsack problem
- combinatorial optimization
- combinatorial optimization problems
- metaheuristic
- tabu search
- multi depot
- vehicle routing
- test instances
- heuristic methods
- routing problem
- exact solution
- np hard
- combinatorial problems
- traveling salesman problem
- memetic algorithm
- max sat
- benchmark problems
- approximation algorithms
- travel time
- hybrid metaheuristic
- optimization problems
- simulated annealing
- vehicle routing problem with simultaneous
- optimal solution
- branch and bound algorithm
- particle swarm optimization
- dynamic programming
- state space
- multi objective
- information retrieval