An open vehicle routing problem metaheuristic for examining wide solution neighborhoods.
Emmanouil E. ZachariadisChris T. KiranoudisPublished in: Comput. Oper. Res. (2010)
Keyphrases
- vehicle routing problem
- metaheuristic
- greedy randomized adaptive search procedure
- iterated local search
- optimal solution
- tabu search
- solution space
- variable neighborhood search
- simulated annealing
- hybrid metaheuristic
- benchmark instances
- search space
- ant colony optimization
- combinatorial optimization
- vehicle routing problem with time windows
- optimization problems
- set of benchmark instances
- routing problem
- genetic algorithm
- travel time
- scatter search
- benchmark problems
- path relinking
- test instances
- combinatorial optimization problems
- np hard
- solution quality
- particle swarm optimization
- traveling salesman problem
- memetic algorithm
- search methods
- nature inspired
- multi start
- search procedure
- aco algorithm
- knapsack problem
- search strategy
- feasible solution
- scheduling problem
- column generation