A variable neighborhood search for the multi-depot vehicle routing problem with loading cost.
Yiyo KuoChi-Chang WangPublished in: Expert Syst. Appl. (2012)
Keyphrases
- variable neighborhood search
- vehicle routing problem
- tabu search
- metaheuristic
- traveling salesman problem
- minimum spanning tree
- hybrid method
- search procedure
- single machine scheduling problem
- benchmark instances
- heuristic methods
- routing problem
- simulated annealing
- cost function
- search algorithm
- support vector machine
- np hard
- path relinking