An adaptive memory algorithm for the split delivery vehicle routing problem.
Rafael E. AlemanXinhui ZhangRaymond R. HillPublished in: J. Heuristics (2010)
Keyphrases
- vehicle routing problem
- np hard
- benchmark problems
- dynamic programming
- optimal solution
- computational complexity
- combinatorial optimization
- routing problem
- vehicle routing problem with time windows
- memetic algorithm
- vehicle routing problem with simultaneous
- optimization algorithm
- particle swarm optimization
- linear programming
- worst case
- search space
- shortest path
- tabu search
- ant colony optimization
- scheduling problem
- constraint programming
- probabilistic model
- cost function
- travel time
- search algorithm
- single machine scheduling problem
- data structure
- objective function