An evolutionary programming approach for solving the capacitated facility location problem with risk pooling Online publication date: Sun, 24-Jan-2010
by A. Diabat, T. Aouam, L. Ozsen
International Journal of Applied Decision Sciences (IJADS), Vol. 2, No. 4, 2009
Abstract: In this paper, we propose a genetic algorithm as an alternative technique for solving the capacitated facility location problem with risk pooling (CLMRP). The CLMRP is a joint location-inventory problem involving a single supplier and multiple retailers that face stochastic demand. Due to the stochasticity of demand associated with each retailer, risk pooling may be achieved by allowing some retailers to serve as distribution centres (DCs). This is a combinatorial optimisation problem that has been shown to be NP-hard. A genetic algorithm that is computationally very efficient is developed to solve the problem. A computational experiment is conducted to test the performance of the developed technique and computational results are reported. The algorithm can easily find optimal or near optimal solutions for benchmark test problems from the literature, where the Lagrangian relaxation approach was used.
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 Applied Decision Sciences (IJADS):
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