A mixed-integer linear formulation for a capacitated facility location problem in supply chain network design
by Vo Hung Duong; Nguyen Hung Bui
International Journal of Operational Research (IJOR), Vol. 33, No. 1, 2018

Abstract: In this research, we deal with a multi-item, multi-period, two-echelon capacitated facility location problem. With every period in horizon planning, manufacturing plants and distribution centres are decided to open or not at predetermined potential sites. The developed model is formulated as a mixed integer linear programming (MILP) model with the objective of minimising the total cost, including transportation cost, inventory holding cost, and fixed costs for opening facilities. We employ a Lagrangian relaxation algorithm for solving the developed model. Before decomposition into sub-problems, the initial structure of developed model is modified, three additional constraint sets add to two sub-problems, and these are the key differences of our algorithm. For validation testing, some numerical experiments are used for solving, and the solutions obtained from the Lagrangian relaxation algorithm are respectively compared with the solutions obtained by the LINGO solver. With good achievements of this research, our proposed model can be applied and the proposed approach is an advantage for getting the specific solutions.

Online publication date: Wed, 08-Aug-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com