A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem.
Min WenEmil KrapperJesper LarsenThomas K. StidsenPublished in: Networks (2011)
Keyphrases
- variable neighborhood search
- vehicle routing
- vehicle routing problem
- tabu search
- scheduling problem
- routing problem
- benchmark instances
- metaheuristic
- np hard
- simulated annealing
- heuristic methods
- path relinking
- travel time
- flowshop
- job shop scheduling problem
- memetic algorithm
- feasible solution
- single machine
- search procedure
- test instances
- vehicle routing and scheduling
- hybrid algorithm
- genetic algorithm
- combinatorial optimization
- hybrid method
- search algorithm
- column generation
- traveling salesman problem
- solution quality
- knapsack problem
- optimal solution
- parallel machines
- processing times
- benchmark problems
- minimum spanning tree
- ant colony optimization
- shortest path
- linear programming
- optimization problems