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

Abstract : 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 the design of Lagrangean based heuristic. Numerical experiments showing the efficiency of the proposed approach are reported.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00920396
Contributor : Samuel Deleplanque <>
Submitted on : Wednesday, December 18, 2013 - 1:10:29 PM
Last modification on : Thursday, March 21, 2019 - 1:11:05 PM
Long-term archiving on : Wednesday, March 19, 2014 - 5:48:51 AM

File

lot-sizingRAIROSoumis.pdf
Files produced by the author(s)

Identifiers

Citation

Samuel Deleplanque, Safia Kedad-Sidhoum, Alain Quilliot. Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities. RAIRO - Operations Research, EDP Sciences, 2013, 47 (04), pp.429-443. ⟨10.1051/ro/2013050⟩. ⟨hal-00920396⟩

Share

Metrics

Record views

268

Files downloads

365