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

Chandra Ade Irawan, Arif Imran, Martino Luis

Research output: Journal PublicationArticlepeer-review

9 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)361-380
Number of pages20
JournalInternational Transactions in Operational Research
Volume27
Issue number1
DOIs
Publication statusPublished - 2020

Keywords

  • VNS
  • bi-objective
  • capacitated p-median problem
  • compromise programming

ASJC Scopus subject areas

  • Business and International Management
  • Computer Science Applications
  • Strategy and Management
  • Management Science and Operations Research
  • Management of Technology and Innovation

Fingerprint

Dive into the research topics of 'Solving the bi-objective capacitated p-median problem with multilevel capacities using compromise programming and VNS'. Together they form a unique fingerprint.

Cite this