A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem.
Lukas BachJens LysgaardSanne WøhlkPublished in: Networks (2016)
Keyphrases
- routing problem
- np hard
- dynamic programming
- computational complexity
- binary particle swarm optimization
- special case
- worst case
- optimization algorithm
- vehicle routing problem
- search space
- cost function
- shortest path
- search strategy
- routing algorithm
- travel time
- single source
- multi period
- set partitioning
- objective function