Solving the bi-objective capacitated p-median problem with multilevel capacities using compromise programming and VNS
A bi-objective optimisation using a compromise programming (CP) approach is proposed for the capacitated p-median problem (CPMP) in the presence of the fixed cost of opening facility and several possible capacities that can be used by potential facilities. As the sum of distances between customers a...
Saved in:
Main Authors: | Irawan, Chandra Ade, Imran, Arif, Luis, Martino |
---|---|
Format: | Article |
Language: | English |
Published: |
John Wiley & Sons Ltd
2017
|
Subjects: | |
Online Access: | http://repo.uum.edu.my/27279/1/ITOR%202017%201%2020.pdf http://repo.uum.edu.my/27279/ http://doi.org/10.1111/itor.12485 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A large neighbourhood search to solve capacitated planar location-allocation problem
by: Luis, Martino, et al.
Published: (2014) -
Efficient GRASP based heuristics for the capacitated continuous location-allocation problem
by: Luis, Martino, et al.
Published: (2015) -
A constructive method and a guided hybrid GRASP for the capacitated multi-source Weber problem in the presence of fixed cost
by: Luis, Martino, et al.
Published: (2015) -
Spatial object median rules in bounding-volume hierarchies for complex environments
by: Sulaiman, Hamzah Asyrani
Published: (2010) -
Effective local evolutionary searches distributed on an island model solving bi-objective optimization problems
by: Cheshmehgaz, Hossein Rajabalipour, et al.
Published: (2013)