A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows.
Gabriel Gutiérrez-JarpaGuy DesaulniersGilbert LaporteVladimir MarianovPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- vehicle routing problem
- benchmark problems
- np hard
- routing problem
- benchmark instances
- combinatorial optimization
- metaheuristic
- vehicle routing problem with time windows
- simulated annealing
- memetic algorithm
- vehicle routing
- tabu search
- optimal solution
- greedy randomized adaptive search procedure
- computational complexity
- hybrid metaheuristic
- traveling salesman problem
- vehicle routing problem with simultaneous
- test instances
- knapsack problem
- dynamic programming
- ant colony optimization
- particle swarm optimization
- iterated local search
- search strategies
- cost function
- objective function
- travel time
- search procedure
- job shop scheduling problem
- heuristic methods
- hybrid algorithm
- genetic algorithm
- search strategy
- optimization algorithm
- special case
- evolutionary algorithm