Large multiple neighborhood search for the clustered vehicle-routing problem.
Timo HintschStefan IrnichPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- neighborhood search
- vehicle routing problem
- traveling salesman problem
- metaheuristic
- variable neighborhood search
- simulated annealing
- routing problem
- tabu search
- benchmark problems
- np hard
- combinatorial optimization
- test instances
- nature inspired
- travel time
- particle swarm optimization
- path relinking
- combinatorial optimization problems
- neural network
- knapsack problem
- memetic algorithm
- search algorithm
- information retrieval
- graph search
- data structure
- ant colony optimization
- multi objective
- lower bound