The capacitated p-centre problem with the presence of fixed cost and multilevel capacities
In this study, the discrete p-centre problem with the presence of multilevel capacities and fixed (opening) cost of a facility under a limited budget is investigated. A mathematical model of the problem is produced where the model seeks the location of open facilities, their corresponding capacities, and the allocation of the customers to the open facilities in order to minimise the maximum distance between customers and their assigned facility. Two matheuristic approaches are also proposed to deal with larger instances. The first approach is a hybridisation of a clustering-based technique and an exact method while the second one is based on Variable Neighbourhood Search (VNS). Computational experiments show that the proposed methods produce interesting and competitive results on newly and randomly generated dataset.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.