The Simulated Trading Heuristic for Solving Vehicle Routing Problems.
Achim BachemWinfried HochstättlerMartin MalichPublished in: Discret. Appl. Math. (1996)
Keyphrases
- vehicle routing problem
- combinatorial optimization
- multi depot
- benchmark instances
- tabu search
- variable neighborhood search
- metaheuristic
- vehicle routing problem with time windows
- test instances
- guided local search
- tree search algorithm
- neighborhood search
- traveling salesman problem
- timetabling problem
- memetic algorithm
- exact algorithms
- greedy randomized adaptive search procedure
- simulated annealing
- routing problem
- ant colony optimization
- optimal solution
- waste collection
- search procedure
- optimization problems
- scheduling problem
- branch and bound algorithm
- heuristic methods
- feasible solution
- solution quality
- variable ordering
- dynamic programming
- particle swarm optimization
- search heuristics
- exact solution
- scatter search
- hyper heuristics
- minimum spanning tree
- job shop scheduling problem
- benchmark problems
- multi objective