Large multiple neighborhood search for the soft-clustered vehicle-routing problem.
Timo HintschPublished in: Comput. Oper. Res. (2021)
Keyphrases
- neighborhood search
- vehicle routing problem
- variable neighborhood search
- simulated annealing
- tabu search
- traveling salesman problem
- metaheuristic
- benchmark problems
- routing problem
- combinatorial optimization
- test instances
- path relinking
- np hard
- particle swarm optimization
- travel time
- combinatorial optimization problems
- memetic algorithm
- heuristic methods
- knapsack problem
- benchmark instances
- graph search
- nature inspired
- genetic algorithm
- branch and bound
- scheduling problem