A multi-objective location-allocation problem with lateral transshipment between distribution centres
by Hossein Salehi; Reza Tavakkoli-Moghaddam; G. Reza Nasiri
International Journal of Logistics Systems and Management (IJLSM), Vol. 22, No. 4, 2015

Abstract: Location-allocation problem as one of the strategic decisions in supply chain management has become the focus of research attention. In this paper we design a distribution network by modelling for location-allocation in a supply chain that involves a fixed plant, distribution centres with multiple levels of capacities and retailers. The aim is to select the optimum numbers, locations, capacities of the opening warehouses, allocation retailers to the opened warehouses, therefore all multi-product stochastic customer demands are satisfied at the minimum total cost of the distribution network and the maximum average of warehouse utilisation. In addition lateral transshipment within an inventory system is considered (i.e., product movements between locations of the same echelon). The model developed as a mixed-integer nonlinear programming model and an efficient heuristic-based memetic algorithm is proposed. Furthermore, a number of test problems are solved and the associated results are compared to evaluate the performance of the proposed algorithm.

Online publication date: Wed, 28-Oct-2015

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 Logistics Systems and Management (IJLSM):
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