Volume 21, Issue 1 (IJIEPR 2010)                   IJIEPR 2010, 21(1): 11-15 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Yaghini M, Lessan J, Gholami Mazinan H. An Efficient Hybrid Metaheuristic for Capacitated p-Median Problem. IJIEPR 2010; 21 (1) :11-15
URL: http://ijiepr.iust.ac.ir/article-1-149-en.html
An Efficient Hybrid Metaheuristic for Capacitated p-Median Problem
M. Yaghini1 , J. Lessan , H. Gholami Mazinan
1- , yaghini@iust.ac.ir
Abstract:   (12307 Views)
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an efficient solution method for the problem has been a challenge during last decades in literature. In this paper, a hybrid met heuristic called GACO is developed to find high quality and fast solutions for the CPMP. The GACO combines elements of genetic algorithm and ant colony optimization met heuristics. Computational results on standard test problems show the robustness and efficiency of the algorithm and confirm that the proposed method is a good choice for solving the CPMP.
Keywords: Facility location problem, p-median problem, Hybrid metaheuristic, Genetic algorithm, Ant colony optimization
Full-Text [PDF 752 kb]   (3526 Downloads)    
Type of Study: Research |
Received: 2010/08/25 | Published: 2010/06/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.