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...
Main Authors: | Irawan, Chandra Ade, Imran, Arif, Luis, Martino |
---|---|
Format: | Article |
Language: | English |
Published: |
John Wiley & Sons Ltd
2017
|
Subjects: | |
Online Access: | https://repo.uum.edu.my/id/eprint/27279/1/ITOR%202017%201%2020.pdf |
Similar Items
-
A large neighbourhood search to solve capacitated planar location-allocation problem
by: Luis, Martino, et al.
Published: (2014) -
An enhanced ant colony system algorithm based on subpaths for solving the capacitated vehicle routing problem
by: Ahmed, Zakir Hussain, et al.
Published: (2023) -
Effective local evolutionary searches distributed on an island model solving bi-objective optimization problems
by: Cheshmehgaz, Hossein Rajabalipour, et al.
Published: (2013) -
A novel BiGRUBiLSTM model for Multilevel Sentiment Analysis Using Deep Neural Network with BiGRU-BiLSTM
by: Islam, Md Shofiqul, et al.
Published: (2021) -
Efficient GRASP based heuristics for the capacitated continuous location-allocation problem
by: Luis, Martino, et al.
Published: (2015)