A scenario analysis of a location problem with uncertain demand Online publication date: Fri, 21-Nov-2008
by Guy A. Tanonkou, Lyes Benyoucef, Xiaolan Xie
International Journal of Computer Applications in Technology (IJCAT), Vol. 32, No. 4, 2008
Abstract: This paper considers the design of a distribution network composed of a single supplier serving a set of retailers through a set of Distribution Centres (DCs) to locate. The number and location of DCs are decision variables and they are chosen from the set of retailer locations. Each retailer faces a random demand and the supplier lead-time is constant. Furthermore, some parameters are random and described by scenarios, each with a specified probability of occurrence. The problem is formulated as a two-stage non-linear discrete stochastic optimisation problem. At the first stage, we decide on the DCs location and at the second stage, we assign retailers to located DCs with respect to a given scenario. The goal is to minimise the expected total cost resulted from the DCs location, transportation, working inventory and safety stocks costs. A Lagrangian relaxation based approach is proposed to generate efficient solutions. Computational results are presented and analysed showing the effectiveness of the proposed approach.
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 Computer Applications in Technology (IJCAT):
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