Solving the bi-objective capacitated p-median problem with multilevel capacities using compromise programming and VNS

• Main Authors: Irawan, Chandra Ade, Imran, Arif, Luis, Martino
• Format: Article
• Language: English
• Published: John Wiley & Sons Ltd 2017
• Subjects: QA75 Electronic computers. Computer science
• 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
• Institution: Universiti Utara Malaysia

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 and their facilities and the total fixed cost for opening facilities are important aspects, the model is proposed to deal with those conflicting objectives. We develop a mathematical model using integer linear programming (ILP) to determine the optimal location of open facilities with their optimal capacity. Two approaches are designed to deal with the bi-objective CPMP, namely CP with an exact method and with a variable neighbourhood search (VNS) based matheuristic. New sets of generated instances are used to evaluate the performance of the proposed approaches. The computational experiments show that the proposed approaches produce interesting results.