Route relaxations on GPU for vehicle routing problems.
Marco A. BoschettiVittorio ManiezzoFrancesco StrappavecciaPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- vehicle routing problem
- travel time
- pick up and delivery
- vehicle routing problem with simultaneous
- np hard
- metaheuristic
- vehicle routing problem with time windows
- routing problem
- tabu search
- test instances
- lower bound
- waste collection
- multi depot
- memetic algorithm
- benchmark problems
- traveling salesman problem
- variable neighborhood search
- linear programming
- combinatorial optimization
- particle swarm optimization
- neighborhood search
- benchmark instances
- guided local search
- special case
- knapsack problem
- optimal solution
- search strategies
- simulated annealing
- computational complexity
- approximation algorithms
- branch and bound algorithm
- road network
- shortest path
- upper bound
- greedy randomized adaptive search procedure
- search algorithm