A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem.
Oguz SolyaliHaldun SüralPublished in: Transp. Sci. (2011)
Keyphrases
- optimal solution
- high accuracy
- computational cost
- dynamic programming
- experimental evaluation
- simulated annealing
- preprocessing
- detection algorithm
- traveling salesman
- segmentation algorithm
- expectation maximization
- worst case
- cost function
- np hard
- significant improvement
- computational complexity
- learning algorithm
- bin packing
- ant colony optimization
- hill climbing
- k means
- objective function
- worst case performance ratio
- minimum length
- greedy heuristic
- quadratic programming
- particle swarm optimization
- packing problem
- exhaustive search
- recognition algorithm
- solution quality
- times faster
- linear programming
- similarity measure