Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries.
Gábor NagySaïd SalhiPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- vehicle routing problem
- benchmark problems
- tabu search
- metaheuristic
- vehicle routing problem with time windows
- traveling salesman problem
- test instances
- routing problem
- vehicle routing
- benchmark instances
- travel time
- multi depot
- vehicle routing problem with simultaneous
- waste collection
- np hard
- memetic algorithm
- particle swarm optimization
- simulated annealing
- knapsack problem
- ant colony optimization
- neighborhood search
- combinatorial optimization
- optimization problems
- path relinking
- variable neighborhood search
- pick up and delivery
- computational complexity
- data structure