Equity-Efficiency Bicriteria Location with Squared Euclidean Distances

A facility must be located within a given region taking two criteria of equity and efficiency into account. Equity is sought by minimizing the inequality in the facility-inhabitant distances, as measured by the sum of the absolute differences between all pairs of squared Euclidean distances from inhabitants to the facility. This measure meets the Pigou-Dalton condition of transfers and can easily be minimized. Efficiency is measured through optimizing the sum of squared inhabitant-facility distances, either to be minimized or maximized for an attracting or repellent facility, respectively. Geometric localization results are obtained for the whole set of Pareto-optimal solutions for each of the two resulting bicriteria problems within a convex polygonal region. A polynomial procedure is developed to obtain the full bicriteria plot, both trade-off curves, and the corresponding efficient sets.

[1]  Kazuki Tamura,et al.  Efficient Location for a Semi-Obnoxious Facility , 2003, Ann. Oper. Res..

[2]  Frank Plastria,et al.  Dominators for Multiple-objective Quasiconvex Maximization Problems , 2000, J. Glob. Optim..

[3]  Yoshiaki Ohsawa,et al.  Bicriteria Euclidean location associated with maximin and minimax criteria , 2000 .

[4]  Mariette Yvinec,et al.  Algorithmic geometry , 1998 .

[5]  Frank Plastria,et al.  Location of Semi-Obnoxious Facilities , 2003 .

[6]  Raimund Seidel,et al.  Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[7]  Joseph E. Stiglitz,et al.  Economics of the Public Sector , 1986 .

[8]  大澤 義明 A geometrical solution for quadratic bicriteria location models , 1997 .

[9]  Wlodzimierz Ogryczak,et al.  Inequality measures and equitable approaches to location problems , 2000, Eur. J. Oper. Res..

[10]  G. O. Wesolowsky,et al.  The Weber Problem On The Plane With Some Negative Weights , 1991 .

[11]  D. Champernowne,et al.  On Economic Inequality. , 1974 .

[12]  Jacques-François Thisse,et al.  The Minimax-min Location Problem , 1986 .

[13]  Jacques-François Thisse,et al.  Constrained Location and the Weber-Rawls Problem , 1981 .

[14]  Emanuel Melachrinoudis,et al.  Semi-obnoxious single facility location in Euclidean space , 2003, Comput. Oper. Res..

[15]  JOSEPH O’ROURKE,et al.  A new linear algorithm for intersecting convex polygons , 1982, Comput. Graph. Image Process..

[16]  Erhan Erkut,et al.  INEQUALITY MEASURES FOR LOCATION PROBLEMS. , 1993 .

[17]  Zvi Drezner,et al.  The Weber Problem , 2002 .

[18]  Frank Plastria,et al.  Geometrical characterization of weakly efficient points , 1996 .

[19]  Gilbert Laporte,et al.  OBJECTIVES IN LOCATION PROBLEMS. , 1995 .

[20]  A. Warburton Quasiconcave vector maximization: Connectedness of the sets of Pareto-optimal and weak Pareto-optimal alternatives , 1983 .

[21]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[22]  George O. Wesolowsky,et al.  FACILITIES LOCATION: MODELS AND METHODS , 1988 .

[23]  M. Mandell Modelling effectiveness-equity trade-offs in public service delivery systems , 1991 .

[24]  P. Krugman Geography and Trade , 1992 .

[25]  Egon Balas,et al.  An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..

[26]  Michael T. Marsh,et al.  Equity measurement in facility location analysis: A review and framework , 1994 .

[27]  Frank Plastria,et al.  Euclidean push-pull partial covering problems , 2006, Comput. Oper. Res..

[28]  J. Boissonnat,et al.  Algorithmic Geometry: Frontmatter , 1998 .

[29]  Kurt Mehlhorn,et al.  Fast Triangulation of Simple Polygons , 1983, FCT.