MIP formulations and heuristics for two-level production-transportation problems
(2012) Computers & Operations Research — Vol. 39, n° 11, p. 2776-2786 (2012)
Files
Rep2506.pdf
Closed Access - Adobe PDF
- 444.41 KB
Details
- Authors
- Abstract
- A two-level supply chain with multiple items, production sites and client areas and a discrete time horizon is considered. After introducing different mixed integer programming formulations, including an initial formulation that is small but provides weak bounds and a multi-commodity extended formulation that provides much improved bounds but is of large size, we develop a hybrid heuristic that uses the strong formulation to provide a good dual bound and suggest certain variable fixing, and the initial formulation restricted by the variable fixing to then provide the heuristic solution. For different classes of medium-sized instances, we show that the hybrid heuristic provides solutions of a guaranteed quality that are as good or better than those provided by the MIP optimizer with a considerably larger run time.
- Affiliations
Citations
Melo, R. A., & Wolsey, L. (2012). MIP formulations and heuristics for two-level production-transportation problems. Computers & Operations Research, 39(11), 2776-2786. https://doi.org/10.1016/j.cor.2012.02.011 (Original work published 2012)