Volume 19, Issue 4 (IJIE 2008)                   IJIEPR 2008, 19(4): 21-29 | Back to browse issues page

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Shahanaghi K, Ghezavati V. Efficient Solution Procedure to Develop Maximal Covering Location Problem Under Uncertainty (Using GA and Simulation). IJIEPR 2008; 19 (4) :21-29
URL: http://ijiepr.iust.ac.ir/article-1-3-en.html
1- , : shahanaghi@iust.ac.ir
Abstract:   (10162 Views)

  In this paper, we present the stochastic version of Maximal Covering Location Problem which optimizes both location and allocation decisions, concurrently. It’s assumed that traveling time between customers and distribution centers (DCs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to DC. In classical models, traveling time between customers and facilities is assumed to be in a deterministic way and a customer is assumed to be covered completely if located within the critical coverage of the facility and not covered at all outside of the critical coverage. Indeed, solutions obtained are so sensitive to the determined traveling time. Therefore, we consider covering or not covering for customers in a probabilistic way and not certain which yields more flexibility and practicability for results and model. Considering this assumption, we maximize the total expected demand which is covered. To solve such a stochastic nonlinear model efficiently, simulation and genetic algorithm are integrated to produce a hybrid intelligent algorithm. Finally, some numerical examples are presented to illustrate the effectiveness of the proposed algorithm.

Full-Text [PDF 178 kb]   (3764 Downloads)    
Type of Study: Research | Subject: Material Managment
Received: 2009/04/18 | Published: 2008/12/15

Add your comments about this article : Your username or Email:
CAPTCHA

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.