A matheuristic for the MinMax capacitated open vehicle routing problem.
Jens LysgaardAna Dolores López-SánchezAlfredo García Hernández-DíazPublished in: Int. Trans. Oper. Res. (2020)
Keyphrases
- vehicle routing problem
- routing problem
- metaheuristic
- tabu search
- vehicle routing problem with time windows
- vehicle routing
- test instances
- benchmark problems
- hybrid metaheuristic
- traveling salesman problem
- travel time
- combinatorial optimization
- np hard
- benchmark instances
- particle swarm optimization
- multi depot
- memetic algorithm
- logistics distribution
- iterated local search
- optimization problems
- scheduling problem
- greedy randomized adaptive search procedure
- information retrieval
- knapsack problem
- search strategies
- simulated annealing
- genetic algorithm