Adaptive memory programming for the many-to-many vehicle routing problem with cross-docking.
Amalia I. NikolopoulouPanagiotis P. RepoussisChristos D. TarantilisEmmanouil E. ZachariadisPublished in: Oper. Res. (2019)
Keyphrases
- vehicle routing problem
- metaheuristic
- tabu search
- vehicle routing
- routing problem
- travel time
- benchmark problems
- hybrid metaheuristic
- traveling salesman problem
- vehicle routing problem with time windows
- np hard
- test instances
- iterated local search
- memetic algorithm
- benchmark instances
- particle swarm optimization
- combinatorial optimization
- logistics distribution
- search strategies
- knapsack problem
- neighborhood search
- greedy randomized adaptive search procedure
- computational complexity
- branch and bound
- genetic algorithm ga
- ant colony optimization
- optimization problems
- pick up and delivery
- multi depot
- special case