Variable Neighborhood Search for the Time-Dependent Vehicle Routing Problem with Soft Time Windows.
Stefanie KritzingerFabien TricoireKarl F. DoernerRichard F. HartlPublished in: LION (2011)
Keyphrases
- vehicle routing problem
- variable neighborhood search
- travel time
- metaheuristic
- tabu search
- vehicle routing
- benchmark instances
- routing problem
- neighborhood search
- hybrid metaheuristic
- traveling salesman problem
- test instances
- benchmark problems
- combinatorial optimization
- memetic algorithm
- combinatorial optimization problems
- particle swarm optimization
- search strategies
- feasible solution
- path relinking
- optimal solution
- knapsack problem
- genetic algorithm
- search procedure
- heuristic search
- simulated annealing
- scatter search
- upper bound
- multi objective