Benchmarking Tabu Search and Simulated Annealing for the Capacitated Vehicle Routing Problem.
Amala ArockiaMarkus LochbrunnerThomas HanneRolf DornbergerPublished in: ICCMB (2021)
Keyphrases
- tabu search
- simulated annealing
- metaheuristic
- memetic algorithm
- vehicle routing problem
- scatter search
- genetic algorithm
- hybrid algorithm
- feasible solution
- path relinking
- combinatorial optimization
- ant colony optimization
- evolutionary algorithm
- job shop scheduling problem
- search procedure
- iterated local search
- benchmark problems
- solution space
- timetabling problem
- test problems
- quadratic assignment problem
- combinatorial optimization problems
- benchmark instances
- solution quality
- optimization method
- hill climbing
- neighborhood search
- multi start
- heuristic methods
- initial solution
- genetic algorithm ga
- tabu list
- combinatorial problems
- vehicle routing problem with time windows
- candidate list
- routing problem
- test instances
- variable neighborhood search
- multidimensional knapsack problem
- search heuristics
- tabu search algorithm
- flowshop
- starting point
- scheduling problem
- search algorithm