A two-level self-adaptive variable neighborhood search algorithm for the prize-collecting vehicle routing problem.
Kun LiHuixin TianPublished in: Appl. Soft Comput. (2016)
Keyphrases
- vehicle routing problem
- prize collecting
- travel time
- search algorithm
- tabu search
- metaheuristic
- vehicle routing
- routing problem
- search space
- benchmark problems
- search strategies
- vehicle routing problem with time windows
- hybrid metaheuristic
- multi depot
- feasible solution
- branch and bound
- traveling salesman problem
- search methods
- combinatorial optimization
- search strategy
- heuristic search
- particle swarm optimization
- np hard
- simulated annealing
- path relinking
- genetic algorithm
- variable neighborhood search
- neural network
- optimization problems
- search procedure
- hybrid algorithm
- knapsack problem
- computational complexity