A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery.
Ismail KaraoglanFulya AltiparmakImdat KaraBerna DengizPublished in: Eur. J. Oper. Res. (2011)
Keyphrases
- learning algorithm
- optimization algorithm
- preprocessing
- experimental study
- detection algorithm
- single pass
- improved algorithm
- times faster
- theoretical analysis
- dynamic programming
- cost function
- multi objective
- k means
- computational complexity
- optimal solution
- np hard
- computational cost
- particle swarm optimization
- recognition algorithm
- routing problem
- convergence rate
- computationally efficient
- path planning
- matching algorithm
- ant colony optimization
- segmentation algorithm
- significant improvement
- search space
- reinforcement learning