An improved formulation for the multi-depot open vehicle routing problem.
Eduardo Lalla-RuizChristopher Expósito IzquierdoShervin TaheripourStefan VoßPublished in: OR Spectr. (2016)
Keyphrases
- multi depot
- vehicle routing problem
- vehicle routing problem with time windows
- routing problem
- tabu search
- scheduling problem
- benchmark problems
- metaheuristic
- memetic algorithm
- np hard
- traveling salesman problem
- search strategies
- travel time
- combinatorial optimization
- valid inequalities
- neural network
- particle swarm optimization
- simulated annealing
- information retrieval systems
- exact algorithms
- pick up and delivery