Paper Info
Title
A comparison of formulations and solution methods for the minimum-envy location problem
Abstract
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. The formulations are illustrated by examples. Extensive computational tests are reported, showing the potentials and limits of each formulation on several types of instances. Finally, some improvements for all the formulations previously presented are developed, obtaining in some cases much better resolution times.
Year
DOI
Venue
2009
10.1016/j.cor.2008.06.013
Computers & OR
Keywords
DocType
Volume
new total envy criterion,discrete facility location problem,demand point,integer linear programming formulation,solution method,minimum-envy location problem,extensive computational test,entire set,better resolution time,new form,total envy,equity criterion
Journal
36
Issue
ISSN
Citations 
6
Computers and Operations Research
14
PageRank 
References 
Authors
0.81
11
4
Name
Order
Citations
PageRank
Inmaculada Espejo1413.17
Alfredo Marín245332.98
Justo Puerto371773.21
Antonio M. Rodríguez-Chía414315.47