Solving a capacitated p-median location allocation problem using genetic algorithm: a case study
Facility location-allocation problems have various applications in private and public sectors. A capacitated p-median problem is considered in this work which is computationally NPHard. The primary goal of this paper was to determine a set of p-facilities location in which all demand points are allo...
Saved in:
Main Authors: | , , , |
---|---|
格式: | Article |
出版: |
Trans Tech Publications
2014
|
主题: | |
在线阅读: | http://eprints.utm.my/id/eprint/62621/ http://dx.doi.org/10.4028/www.scientific.net/AMR.845.569 |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
id |
my.utm.62621 |
---|---|
record_format |
eprints |
spelling |
my.utm.626212017-06-19T03:03:13Z http://eprints.utm.my/id/eprint/62621/ Solving a capacitated p-median location allocation problem using genetic algorithm: a case study Moghadam, Ali Mokhtari Piroozfard, Hamed Ma'aram, Azanizawati Mirzapour, Seyed Ali TJ Mechanical engineering and machinery Facility location-allocation problems have various applications in private and public sectors. A capacitated p-median problem is considered in this work which is computationally NPHard. The primary goal of this paper was to determine a set of p-facilities location in which all demand points are allocated and its average distance traveled from the customers' location to the selected p-facilities is minimized. In addition, the model also considered supplier's allocation for p facilities. A real world case study has been addressed, and genetic algorithm which consists of crossover and mutation operators was proposed in order to solve the problem. Computational results for different values of p were generated, and finally the optimum solution based on minimum cost was reported. Trans Tech Publications 2014 Article PeerReviewed Moghadam, Ali Mokhtari and Piroozfard, Hamed and Ma'aram, Azanizawati and Mirzapour, Seyed Ali (2014) Solving a capacitated p-median location allocation problem using genetic algorithm: a case study. Advanced Materials Research, 845 . pp. 569-573. ISSN 1022-6680 http://dx.doi.org/10.4028/www.scientific.net/AMR.845.569 DOI:10.4028/www.scientific.net/AMR.845.569 |
institution |
Universiti Teknologi Malaysia |
building |
UTM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Teknologi Malaysia |
content_source |
UTM Institutional Repository |
url_provider |
http://eprints.utm.my/ |
topic |
TJ Mechanical engineering and machinery |
spellingShingle |
TJ Mechanical engineering and machinery Moghadam, Ali Mokhtari Piroozfard, Hamed Ma'aram, Azanizawati Mirzapour, Seyed Ali Solving a capacitated p-median location allocation problem using genetic algorithm: a case study |
description |
Facility location-allocation problems have various applications in private and public sectors. A capacitated p-median problem is considered in this work which is computationally NPHard. The primary goal of this paper was to determine a set of p-facilities location in which all demand points are allocated and its average distance traveled from the customers' location to the selected p-facilities is minimized. In addition, the model also considered supplier's allocation for p facilities. A real world case study has been addressed, and genetic algorithm which consists of crossover and mutation operators was proposed in order to solve the problem. Computational results for different values of p were generated, and finally the optimum solution based on minimum cost was reported. |
format |
Article |
author |
Moghadam, Ali Mokhtari Piroozfard, Hamed Ma'aram, Azanizawati Mirzapour, Seyed Ali |
author_facet |
Moghadam, Ali Mokhtari Piroozfard, Hamed Ma'aram, Azanizawati Mirzapour, Seyed Ali |
author_sort |
Moghadam, Ali Mokhtari |
title |
Solving a capacitated p-median location allocation problem using genetic algorithm: a case study |
title_short |
Solving a capacitated p-median location allocation problem using genetic algorithm: a case study |
title_full |
Solving a capacitated p-median location allocation problem using genetic algorithm: a case study |
title_fullStr |
Solving a capacitated p-median location allocation problem using genetic algorithm: a case study |
title_full_unstemmed |
Solving a capacitated p-median location allocation problem using genetic algorithm: a case study |
title_sort |
solving a capacitated p-median location allocation problem using genetic algorithm: a case study |
publisher |
Trans Tech Publications |
publishDate |
2014 |
url |
http://eprints.utm.my/id/eprint/62621/ http://dx.doi.org/10.4028/www.scientific.net/AMR.845.569 |
_version_ |
1643655473868570624 |
score |
13.251813 |