最小嫉妒定位问题的公式和求解方法的比较。附加结果
A comparison of formulations and solution methods for the Minimum-Envy Location Problem. Additional results
摘要：
考虑了一种新形式的公平准则下的离散设施定位问题。该模型分析了需求点在工厂选址上只有严格优先顺序的情况。目标是找到设施的位置，使整个需求点的总嫉妒最小化。我们定义了这个新的总嫉妒标准，并提供了几个整数线性规划配方，反映和模拟这种方法。广泛的计算测试报告，显示的潜力和限制，每个配方上的几种类型的实例。
英文摘要：
We consider a discrete facility location problem with a new form of equity criterion. The model discussed in the paper analyzes the case where demand points only have strict preference order on the sites where the plants can be located. The goal is to find the location of the facilities minimizing the total envy felt by the entire set of demand points. We define this new total envy criterion and provide several integer linear programming formulations that reflect and model this approach. Extensive computational tests are reported, showing the potentials and limits of each formulation on several types of instances.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
