A logit-based model for facility placement planning in supply chain management Online publication date:: Wed, 15-Apr-2015
by Saeed Asadi Bagloee; Matan Shnaiderman; Madjid Tavana; Avishai Ceder
International Journal of Logistics Systems and Management (IJLSM), Vol. 20, No. 1, 2015
Abstract: The facility placement in supply chain management entails suppliers and consumers along with the terminals in between for distributing commodities. This study seeks to find the best terminal placement by taking into consideration the costs for both transportation and terminal construction. We call this a supplier-terminal-consumer (STC) problem and show that the STC is an NP-hard quadratic assignment problem. The NP-hard problems in real-size are proven to be intractable; hence, we develop a two-fold heuristic method for solving the STC problems. First, we identify the commodity flow by using a logit-based mathematical programming (Logit-MP) methodology based on the demand for the commodity and the locations of the candidate-terminals. We apply Logit-MP in an iterative process and specify the maximum utilisation of the candidate-terminals. Second, the best possible locations for the terminals are identified by analysing the utilisation rates in a geographic information system interface and using an interpolation method for converting the point-based utilisation rates into spatial data. We present numerical results of a large-size transportation case study for the city of Chicago where the commodity, terminals and consumers are interpreted as wheat, silos and bakeries, respectively.
Online publication date:: Wed, 15-Apr-2015
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 firstname.lastname@example.org