Intra-facility equity in discrete and continuous p-facility location problems

From MaRDI portal
Intra-facility equity in discrete and continuous $p$-facility location problems



Abstract: We consider facility location problems with a new form of equity criterion. Demand points have preference order on the sites where the plants can be located. The goal is to find the location of the facilities minimizing the envy felt by the demand points with respect to the rest of demand points allocated to the same plant. After defining this new envy criterion and the general framework based on it, we provide formulations that model this approach in both the discrete and the continuous framework. The problems are illustrated with examples and the computational tests reported show the potential and limits of each formulation on several types of instances. Although this article is mainly focused on the introduction, modelling and formulation of this new concept of envy, some improvements for all the formulations presented are developed, obtaining in some cases better solution times.













This page was built for publication: Intra-facility equity in discrete and continuous $p$-facility location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6419774)