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...
保存先:
主要な著者: | Moghadam, Ali Mokhtari, Piroozfard, Hamed, Ma'aram, Azanizawati, Mirzapour, Seyed Ali |
---|---|
フォーマット: | 論文 |
出版事項: |
Trans Tech Publications
2014
|
主題: | |
オンライン・アクセス: | http://eprints.utm.my/id/eprint/62621/ http://dx.doi.org/10.4028/www.scientific.net/AMR.845.569 |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
Solving an industrial shop scheduling problem using genetic algorithm
著者:: Moghadam, Ali Mokhtari, 等
出版事項: (2014) -
A large neighbourhood search to solve capacitated planar location-allocation problem
著者:: Luis, Martino, 等
出版事項: (2014) -
Solving the bi-objective capacitated p-median problem with multilevel capacities using compromise programming and VNS
著者:: Irawan, Chandra Ade, 等
出版事項: (2017) -
Solving a multi-objective job shop scheduling problem using a hybrid genetic algorithm
著者:: Piroozfard, Hamed
出版事項: (2013) -
The capacitated minimax location-allocation problem with probabilistic customer locations and border crossing constraints
著者:: Mirzapourrezaei, Seyyedali
出版事項: (2013)