Reducing Traveled Distance in the Vehicle Routing Problem with Time Windows using a Multi-Start Simulated Annealing.
Humberto Cesar Brandao de OliveiraGermano C. VasconcelosGuilherme Bastos AlvarengaPublished in: IJCNN (2006)
Keyphrases
- multi start
- vehicle routing problem with time windows
- simulated annealing
- benchmark problems
- tabu search
- metaheuristic
- iterated local search
- vehicle routing problem
- routing problem
- path relinking
- column generation
- integer programming
- hyper heuristics
- combinatorial optimization
- solution quality
- genetic algorithm
- exact algorithms
- search procedure
- global optimization
- evolutionary algorithm
- hill climbing
- search algorithm
- combinatorial problems
- scatter search
- ant colony optimization
- linear programming
- feasible solution