A relax-and-repair heuristic for the Swap-Body Vehicle Routing Problem.
Nabil AbsiDiego CattaruzzaDominique FeilletSylvain HoussemanPublished in: Ann. Oper. Res. (2017)
Keyphrases
- vehicle routing problem
- tabu search
- benchmark instances
- multi depot
- tree search algorithm
- test instances
- combinatorial optimization
- metaheuristic
- iterated local search
- variable neighborhood search
- routing problem
- simulated annealing
- traveling salesman problem
- vehicle routing
- memetic algorithm
- benchmark problems
- neighborhood search
- hybrid metaheuristic
- search strategies
- optimal solution
- vehicle routing problem with time windows
- np hard
- feasible solution
- heuristic methods
- travel time
- test problems
- search procedure
- logistics distribution
- path relinking
- knapsack problem
- particle swarm optimization
- multi start
- constraint satisfaction
- greedy randomized adaptive search procedure
- search algorithm
- pick up and delivery
- search space
- scheduling problem
- scatter search
- job shop scheduling problem
- lower bound
- solution quality
- timetabling problem
- neural network