The paper addresses a multi-item, multi-plant lot-sizing problem with transfer costs and capacity constraints. The problem is reformulated according to a multi-commodity flow formalism, and decomposed, through Lagrangean relaxation, into a master facility location problem and a slave minimal cost multi-commodity flow problem. The decomposition framework gives rise in a natural way to designing a Lagrangean based heuristic. Numerical experiments showing the efficiency of the proposed approach are reported.
Mots-clés : lot-sizing, multi-plant, storage and transfer capacity, facility location, multi-commodity flow, lagrangean relaxation
@article{RO_2013__47_4_429_0, author = {Deleplanque, Samuel and Kedad-Sidhoum, Safia and Quilliot, Alain}, title = {Lagrangean {Heuristic} for a {Multi-Plant} {Lot-Sizing} {Problem} with {Transfer} and {Storage} {Capacities}}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {429--443}, publisher = {EDP-Sciences}, volume = {47}, number = {4}, year = {2013}, doi = {10.1051/ro/2013050}, mrnumber = {3143762}, zbl = {1282.90027}, language = {en}, url = {http://archive.numdam.org/articles/10.1051/ro/2013050/} }
TY - JOUR AU - Deleplanque, Samuel AU - Kedad-Sidhoum, Safia AU - Quilliot, Alain TI - Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2013 SP - 429 EP - 443 VL - 47 IS - 4 PB - EDP-Sciences UR - http://archive.numdam.org/articles/10.1051/ro/2013050/ DO - 10.1051/ro/2013050 LA - en ID - RO_2013__47_4_429_0 ER -
%0 Journal Article %A Deleplanque, Samuel %A Kedad-Sidhoum, Safia %A Quilliot, Alain %T Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities %J RAIRO - Operations Research - Recherche Opérationnelle %D 2013 %P 429-443 %V 47 %N 4 %I EDP-Sciences %U http://archive.numdam.org/articles/10.1051/ro/2013050/ %R 10.1051/ro/2013050 %G en %F RO_2013__47_4_429_0
Deleplanque, Samuel; Kedad-Sidhoum, Safia; Quilliot, Alain. Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities. RAIRO - Operations Research - Recherche Opérationnelle, Tome 47 (2013) no. 4, pp. 429-443. doi : 10.1051/ro/2013050. http://archive.numdam.org/articles/10.1051/ro/2013050/
[1] Strong formulations for multi-item capacitated lot-sizing. Manag. Sci. 30 (1984) 1255-1261. | MR | Zbl
, and .[2] Computational complexity of the capacitated lot size problem. Manag. Sci. 28 (1982) 1174-1186. | MR | Zbl
and ,[3] Analysis of relaxations for the multi-item capacitated lot-sizing problem. Annal. Oper. Res. 26 (1990) 29-72. | MR | Zbl
and ,[4] Deterministic production planning with concave costs and capacity constraints. Manag. Sci. 18 (1971) 12-20. | MR | Zbl
and ,[5] Deterministic production planning: algorithms and complexity. Manag. Sci. 26 (1980) 669-679. | MR | Zbl
, and ,[6] Modeling industrial lot sizing problems: a review. Int. J. Prod. Res. 46 (2008) 1619-1643. | Zbl
and ,[7] Multi-item single-level capacitated lot-sizing heuristics: a general review. J. Oper. Res. Soc. 11 (1988) 991-1004. | Zbl
and ,[8] Grasp heuristic with path-relinking for the multi-plant capacitated lot sizing problem. Eur. J. Oper. Res. 200 (2010) 1-17. | Zbl
, and ,[9] 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. | Zbl
and ,[10] The capacitated plant location problem with multiple facilities in the same site. Comput. Oper. Res. 29-13 (2002) 1903-12. | MR | Zbl
, and ,[11] The uncapacited facility location problem. In Discrete location theory, edited by B. Mirchandani, R.L. Francis (1990) 119-171. | MR | Zbl
, and ,[12] Discrete location theory. Wiley, J. Sons (1990). | MR | Zbl
and ,[13] A hybrid heuristic for the p-median problem. J. Heuristics 10 (2004) 59-88. | Zbl
and ,[14] Programmation Mathématique, Tome 1. Dunod Ed (1983). | Zbl
,[15] Multi-Item, Multi-Facility Supply Chain Planning: Models, Complexities, and Algorithms. Comput. Optim. Appl. 28 (2004) 325-356. | MR | Zbl
and ,Cité par Sources :