Variable Neighborhood Search for Vehicle Routing Problem with Multiple Time Windows.
Huggo Silva FerreiraEduardo T. BogueThiago F. NoronhaSlim BelhaizaChristian PrinsPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- vehicle routing problem
- variable neighborhood search
- metaheuristic
- hybrid metaheuristic
- tabu search
- vehicle routing
- benchmark instances
- routing problem
- traveling salesman problem
- benchmark problems
- neighborhood search
- test instances
- combinatorial optimization
- memetic algorithm
- travel time
- np hard
- combinatorial optimization problems
- particle swarm optimization
- simulated annealing
- knapsack problem
- feasible solution
- path relinking
- search space
- search strategies
- global optimization