A branch & cut algorithm for the windy general routing problem and special cases.
Angel CorberánIsaac PlanaJosé M. SanchisPublished in: Networks (2007)
Keyphrases
- routing problem
- special case
- np hard
- computational complexity
- dynamic programming
- cost function
- worst case
- multicommodity flow
- objective function
- search space
- simulated annealing
- linear programming
- particle swarm optimization
- search algorithm
- response time
- optimization algorithm
- vehicle routing problem with time windows
- real time