Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue RAIRO - Operations Research Année : 2013

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

Résumé

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.
Fichier principal
Vignette du fichier
lot-sizingRAIROSoumis.pdf (158.48 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00920396 , version 1 (18-12-2013)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More