Variable neighborhood search for the travelling deliveryman problem.
Nenad MladenovicDragan UrosevicSaïd HanafiPublished in: 4OR (2013)
Keyphrases
- variable neighborhood search
- routing problem
- metaheuristic
- neighborhood search
- traveling salesman problem
- vehicle routing problem
- tabu search
- minimum spanning tree
- hybrid method
- path relinking
- single machine scheduling problem
- benchmark instances
- heuristic methods
- shortest path
- scatter search
- search procedure
- optimal solution
- ant colony optimization
- simulated annealing
- search algorithm
- optimization problems