A general variable neighborhood search for the swap-body vehicle routing problem.
Raca TodosijevicSaïd HanafiDragan UrosevicBassem JarbouiBernard GendronPublished in: Comput. Oper. Res. (2017)
Keyphrases
- vehicle routing problem
- variable neighborhood search
- metaheuristic
- tabu search
- hybrid metaheuristic
- routing problem
- neighborhood search
- traveling salesman problem
- test instances
- benchmark problems
- benchmark instances
- combinatorial optimization
- heuristic methods
- travel time
- special case
- hybrid method
- particle swarm optimization
- path relinking
- search strategies
- simulated annealing
- memetic algorithm
- np hard
- search procedure
- combinatorial optimization problems
- search algorithm
- single machine scheduling problem
- dynamic programming
- scheduling problem
- genetic algorithm
- greedy algorithm
- feasible solution