Skip to Main content Skip to Navigation
Journal articles

Lower and upper bounds for a capacitated plant location problem with multicommodity flow

Abstract : In this paper, we introduce a capacitated plant location problem with multicommodity flow. Given a set of potential plant sites and a set of capacitated arcs linking plants, transshipment points and customers, the aim is to determine where to locate plants and how to move flows from open plants to customers through a set of transshipment points. This model extends the classical capacitated plant location problem by introducing a multicommodity flow problem in the distribution issue. The combination of the location problem and the flow distribution problem is reasonable and realistic since both of them belong to strategic planning horizons. We propose a Lagrangean-based method, including a Lagrangean relaxation, a Lagrangean heuristic and a subgradient optimization, to provide lower and upper bounds of the model. Then, we employ a Tabu search to further improve upper bounds provided by the Lagrangean procedure. The computational results demonstrate that our solution method is effective since gaps between the upper and lower bound are on average around 2%.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02495949
Contributor : Daniel Gavrysiak <>
Submitted on : Monday, March 2, 2020 - 4:21:35 PM
Last modification on : Monday, April 20, 2020 - 2:14:09 PM

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

Jinfeng Li, Feng Chu, Christian Prins. Lower and upper bounds for a capacitated plant location problem with multicommodity flow. Computers and Operations Research, Elsevier, 2009, 36 (11), pp.3019-3030. ⟨10.1016/j.cor.2009.01.012⟩. ⟨hal-02495949⟩

Share

Metrics

Record views

35