Heuristic and exact algorithms for the multi-pile vehicle routing problem.
Fabien TricoireKarl F. DoernerRichard F. HartlManuel IoriPublished in: OR Spectr. (2011)
Keyphrases
- exact algorithms
- vehicle routing problem
- benchmark instances
- vehicle routing problem with time windows
- combinatorial optimization
- knapsack problem
- combinatorial optimization problems
- multi depot
- metaheuristic
- approximation algorithms
- tabu search
- combinatorial problems
- variable neighborhood search
- test instances
- heuristic methods
- exact solution
- np hard
- routing problem
- traveling salesman problem
- hybrid metaheuristic
- max sat
- optimization problems
- travel time
- benchmark problems
- iterated local search
- simulated annealing
- memetic algorithm
- optimal solution
- branch and bound
- job shop scheduling problem
- genetic algorithm
- scatter search
- computational complexity
- search space
- cost function
- neural network
- feasible solution
- ant colony optimization