Hostname: page-component-6898cfcb55-p2bvx Total loading time: 0 Render date: 2026-11-11T03:12:27.921Z Has data issue: false hasContentIssue false
  • English
  • Français

Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem withTransfer and Storage Capacities

Published online by Cambridge University Press:  29 November 2013

Samuel Deleplanque,
Safia Kedad-Sidhoum and
Alain Quilliot
Samuel Deleplanque
Affiliation:
LIMOS, Bat. ISIMA, Université Blaise Pascal, Campus des Cézeaux, BP 125, 63173 Aubiere . deleplanque.samuel@gmail.com
Safia Kedad-Sidhoum
Affiliation:
LIP6, Université Paris 6, 4 place Jussieu 75252 Paris Cedex 05 
Alain Quilliot
Affiliation:
LIMOS, Bat. ISIMA, Université Blaise Pascal, Campus des Cézeaux, BP 125, 63173 Aubiere . deleplanque.samuel@gmail.com

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The paper addresses a multi-item, multi-plant lot-sizing problem with transfer costs andcapacity constraints. The problem is reformulated according to a multi-commodity flowformalism, and decomposed, through Lagrangean relaxation, into a master facility locationproblem and a slave minimal cost multi-commodity flow problem. The decomposition frameworkgives rise in a natural way to designing a Lagrangean based heuristic. Numericalexperiments showing the efficiency of the proposed approach are reported.

Keywords

Lot-sizingmulti-plantstorage and transfer capacityfacility locationmulti-commodity flowLagrangean relaxation

Information

Type
Research Article
Information
RAIRO - Operations Research , Volume 47 , Issue 4: ROADEF 2012 , September 2013, pp. 429 - 443
Copyright
© EDP Sciences, ROADEF, SMAI 2013

References

Barany, I., van Roy, T.J. and Wolsey, L.A.. Strong formulations for multi-item capacitated lot-sizing. Manag. Sci. 30 (1984) 1255–1261. Google Scholar
Bitran, G. and Yanasse, H., Computational complexity of the capacitated lot size problem. Manag. Sci. 28 (1982) 1174–1186. Google Scholar
Chen, W. and Thizy, J., Analysis of relaxations for the multi-item capacitated lot-sizing problem. Annal. Oper. Res. 26 (1990) 29–72. Google Scholar
Florian, M. and Klein, M., Deterministic production planning with concave costs and capacity constraints. Manag. Sci. 18 (1971) 12–20. Google Scholar
Florian, M., Lenstra, J. and Kan, A.R., Deterministic production planning: algorithms and complexity. Manag. Sci. 26 (1980) 669–679. Google Scholar
Jans, R. and Degraeve, Z., Modeling industrial lot sizing problems: a review. Int. J. Prod. Res. 46 (2008) 1619–1643. Google Scholar
Maes, J. and van Wassenhove, L., Multi-item single-level capacitated lot-sizing heuristics: a general review. J. Oper. Res. Soc. 11 (1988) 991–1004. Google Scholar
Nascimento, M.C.V., Resende, M.G.C. and Toledo, F.M.B., Grasp heuristic with path-relinking for the multi-plant capacitated lot sizing problem. Eur. J. Oper. Res. 200 (2010) 1–17. Google Scholar
Sambivasan, M. and Yahya, S., A Lagrangean based heuristic for multi-plant, multi-item, multi-period capacited lot sizing problems with inter-plant transfers. Comput. Oper. Res. 32 (2005) 537–552. Google Scholar
Ghiani, G., Guerrero, F. and Musmanno, F., The capacitated plant location problem with multiple facilities in the same site. Comput. Oper. Res. 29-13 (2002) 1903–12. Google Scholar
G. Cornuejols, G.L. Nemhauser and L.A. Wolsey, The uncapacited facility location problem. In Discrete location theory, edited by B. Mirchandani, R.L. Francis (1990) 119–171.
B. Mirchandani and R.L. Francis, Discrete location theory. Wiley, J. Sons (1990).
Resende, M.G. and Werneck, R.F., A hybrid heuristic for the p-median problem. J. Heuristics 10 (2004) 59–88. Google Scholar
M. Minoux, Programmation Mathématique, Tome 1. Dunod Ed (1983).
Wu, S. and Golbasi, H., Multi-Item, Multi-Facility Supply Chain Planning: Models, Complexities, and Algorithms. Comput. Optim. Appl. 28 (2004) 325–356. Google Scholar