Volume 19, Issue 4 (IJIE 2008)                   2008, 19(4): 93-105 | Back to browse issues page

XML Persian Abstract Print

, dr.taghavifard@gmail.com
Abstract:   (12848 Views)

  In this paper, multi-objective set covering problems (MOSCP) as one of the location-allocation models are being considered. Here, the objective is to minimize the cost of locating facilities and at the same time to maximize demand satisfaction in a defined structure so that each customer or zone is being covered by at least one facility. Since the problem falls into NP-hard category from the complexity point of view, it cannot be solved in a reasonable computational time period by an exact algorithm. For this reason, a Simulated Annealing (SA) algorithm is proposed to solve MOSCP. The algorithm is a meta-heuristic approach coupled with a neighborhood search technique.

The validity and quality of the proposed method is tested by solving benchmark problems and the results obtained were quite satisfactory.
Full-Text [PDF 535 kb]   (3606 Downloads)    
Type of Study: Research |
Received: 2010/06/28 | Published: 2008/12/15

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