Solving a multi-echelon inventory-location problem utilising an efficient Lagrangian relaxation-based heuristic Online publication date: Tue, 07-Mar-2023
by Sanaz Khalaj Rahimi; Mehdi Seifbarghy; Davar Pishva
International Journal of Logistics Systems and Management (IJLSM), Vol. 44, No. 3, 2023
Abstract: This paper considers an integrated inventory-location problem in which a single product is supplied and distributed through a multi-echelon supply chain including a number of suppliers, distribution centres (DCs), and retailers. It adopts the well-known periodic review inventory control policy (R, S) at DCs. The problem is formulated as a mixed integer nonlinear programming problem and is solved utilising a Lagrangian relaxation-based heuristic. One of its main focuses is to reduce processing time, particularly when dealing with large-size problems. This is achieved via an additional step which converts the lower bound of the Lagrangian relaxation algorithm to an appropriate upper bound. Furthermore, we examine all the combinations of the constraints of the model when selecting constraints to be relaxed. The computational results confirm the efficiency of the proposed approach (i.e., an obtained average time of around 8 minutes with an optimality distance of less than 3%).
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Logistics Systems and Management (IJLSM):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook