A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time Limit.
Olcay PolatCan Berk KalayciOsman KulakHans-Otto GüntherPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- variable neighborhood search
- vehicle routing problem with simultaneous
- vehicle routing problem
- benchmark instances
- metaheuristic
- tabu search
- neighborhood search
- routing problem
- combinatorial optimization
- traveling salesman problem
- pick up and delivery
- test instances
- minimum spanning tree
- heuristic methods
- benchmark problems
- combinatorial optimization problems
- np hard
- travel time
- memetic algorithm
- path relinking
- single machine scheduling problem
- search procedure
- particle swarm optimization
- simulated annealing
- hybrid method
- optimal solution
- knapsack problem
- search strategies
- linear program
- scatter search
- optimization problems
- lower bound
- search algorithm