A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries.
Claudia ArchettiM. Grazia SperanzaMaurizio BocciaAntonio SforzaClaudio SterlePublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- experimental evaluation
- preprocessing
- improved algorithm
- significant improvement
- learning algorithm
- similarity measure
- cost function
- estimation algorithm
- detection algorithm
- dynamic programming
- k means
- recognition algorithm
- theoretical analysis
- np hard
- clustering method
- classification algorithm
- times faster
- evolutionary algorithm
- objective function
- computational complexity
- selection algorithm
- traveling salesman problem
- segmentation algorithm
- computationally efficient
- expectation maximization
- high accuracy
- special case