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: | Moghadam, Ali Mokhtari, Piroozfard, Hamed, Ma'aram, Azanizawati, Mirzapour, Seyed Ali |
---|---|
Format: | Article |
Published: |
Trans Tech Publications
2014
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/62621/ http://dx.doi.org/10.4028/www.scientific.net/AMR.845.569 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving an industrial shop scheduling problem using genetic algorithm
by: Moghadam, Ali Mokhtari, et al.
Published: (2014) -
A large neighbourhood search to solve capacitated planar location-allocation problem
by: Luis, Martino, et al.
Published: (2014) -
Solving the bi-objective capacitated p-median problem with multilevel capacities using compromise programming and VNS
by: Irawan, Chandra Ade, et al.
Published: (2017) -
Solving a multi-objective job shop scheduling problem using a hybrid genetic algorithm
by: Piroozfard, Hamed
Published: (2013) -
The capacitated minimax location-allocation problem with probabilistic customer locations and border crossing constraints
by: Mirzapourrezaei, Seyyedali
Published: (2013)