A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks.
Jonatas B. C. ChagasUlisses Eduardo Ferreira da SilveiraAndré G. SantosMarcone J. F. SouzaPublished in: Int. Trans. Oper. Res. (2020)
Keyphrases
- vehicle routing problem
- variable neighborhood search
- metaheuristic
- hybrid metaheuristic
- tabu search
- routing problem
- benchmark instances
- neighborhood search
- traveling salesman problem
- travel time
- test instances
- benchmark problems
- combinatorial optimization problems
- heuristic methods
- particle swarm optimization
- single machine scheduling problem
- memetic algorithm
- path relinking
- np hard
- minimum spanning tree
- hybrid method
- scatter search
- simulated annealing
- optimal solution
- combinatorial problems
- neural network
- optimization problems
- scheduling problem
- special case
- search space