Intra-facility equity in discrete and continuous p-facility location problems
提出一种新的公平性准则，以需求点对同一设施内其他需求点的嫉妒最小化为目标，建立离散和连续框架下的数学模型，并通过算例和计算测试展示模型的效果与局限。
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 the 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.