A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows.
Sébastien MouthuyFlorence MassenYves DevillePascal Van HentenryckPublished in: Transp. Sci. (2015)
Keyphrases
- vehicle routing problem
- multistage
- neighborhood search
- vehicle routing
- traveling salesman problem
- variable neighborhood search
- metaheuristic
- routing problem
- benchmark problems
- dynamic programming
- combinatorial optimization
- tabu search
- travel time
- test instances
- benchmark instances
- memetic algorithm
- particle swarm optimization
- simulated annealing
- lot sizing
- np hard
- optimal policy
- knapsack problem
- scheduling problem
- mathematical programming
- evolutionary algorithm
- linear programming
- search strategies
- genetic algorithm
- ant colony optimization
- computational complexity
- scatter search
- objective function