A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups.
Olcay PolatPublished in: Comput. Oper. Res. (2017)
Keyphrases
- vehicle routing problem
- variable neighborhood search
- metaheuristic
- tabu search
- benchmark instances
- routing problem
- hybrid metaheuristic
- neighborhood search
- benchmark problems
- traveling salesman problem
- test instances
- combinatorial optimization
- travel time
- np hard
- vehicle routing problem with simultaneous
- combinatorial optimization problems
- particle swarm optimization
- search strategies
- memetic algorithm
- optimal solution
- path relinking
- genetic algorithm
- ant colony optimization
- optimization problems
- special case
- combinatorial problems
- simulated annealing