An approximation algorithm for a 2-Depot, heterogeneous vehicle routing problem.
Sai Krishna YadlapalliSivakumar RathinamSwaroop DarbhaPublished in: ACC (2009)
Keyphrases
- vehicle routing problem
- benchmark problems
- dynamic programming
- memetic algorithm
- np hard
- benchmark instances
- routing problem
- particle swarm optimization
- computational complexity
- vehicle routing problem with time windows
- combinatorial optimization
- linear programming
- search strategy
- knapsack problem
- cost function
- search space
- exact algorithms
- lower bound
- vehicle routing
- optimal solution