Worst-Case Analysis for Split Delivery Vehicle Routing Problems.
Claudia ArchettiMartin W. P. SavelsberghMaria Grazia SperanzaPublished in: Transp. Sci. (2006)
Keyphrases
- worst case analysis
- vehicle routing problem
- vehicle routing problem with simultaneous
- np hard
- average case
- vehicle routing problem with time windows
- np hardness
- worst case
- metaheuristic
- greedy heuristic
- tabu search
- pick up and delivery
- routing problem
- waste collection
- knapsack problem
- test instances
- benchmark problems
- traveling salesman problem
- combinatorial optimization
- linear programming relaxation
- guided local search
- particle swarm optimization
- lower bound
- greedy randomized adaptive search procedure
- special case
- neural network
- training set
- computational complexity
- integer programming
- approximation algorithms
- scheduling problem