Extensive facility location problems on networks with equity measures

This paper deals with the problem of locating path-shaped facilities of unrestricted length on networks. We consider as objective functions measures conceptually related to the variability of the distribution of the distances from the demand points to a facility. We study the following problems: locating a path which minimizes the range, that is, the difference between the maximum and the minimum distance from the vertices of the network to a facility, and locating a path which minimizes a convex combination of the maximum and the minimum distance from the vertices of the network to a facility, also known in decision theory as the Hurwicz criterion. We show that these problems are NP-hard on general networks. For the discrete versions of these problems on trees, we provide a linear time algorithm for each objective function, and we show how our analysis can be extended also to the continuous case.

[1]  Justo Puerto,et al.  The centdian subtree on tree networks , 2002, Discret. Appl. Math..

[2]  P. Slater Locating Central Paths in a Graph , 1982 .

[3]  S. M. Hedetniemi,et al.  Linear Algorithms for Finding the Jordan Center and Path Center of a Tree , 1981 .

[4]  Martine Labbé,et al.  On locating path- or tree-shaped facilities on networks , 1993, Networks.

[5]  Justo Puerto,et al.  Improved algorithms for several network location problems with equality measures , 2003, Discret. Appl. Math..

[6]  Oded Berman,et al.  Algorithms for path medi-centers of a tree , 1999, Comput. Oper. Res..

[7]  Ronald I. Becker,et al.  Algorithms for central-median paths with bounded length on trees , 2007, Eur. J. Oper. Res..

[8]  Timothy J. Lowe,et al.  On the location of a tree-shaped facility , 1996, Networks.

[9]  Sanjiv Kapoor Dynamic Maintenance of Maxima of 2-d Point Sets , 2000, SIAM J. Comput..

[10]  Juan A. Mesa,et al.  A review of extensive facility location in networks , 1996 .

[11]  Justo Puerto,et al.  Locating tree-shaped facilities using the ordered median objective , 2005, Math. Program..

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

[13]  Maiko Shigeno,et al.  The tree center problems and the relationship with the bottleneck knapsack problems , 1997, Networks.

[14]  Arie Tamir,et al.  Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem , 1998, Discret. Appl. Math..

[15]  José A. Moreno Pérez,et al.  The generalizedp-Centdian on network , 2000 .

[16]  Christos H. Papadimitriou,et al.  Games against nature , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[17]  Justo Puerto,et al.  The continuous and discrete path-variance problems on trees , 2009, Networks.

[18]  Justo Puerto,et al.  Conditional location of path and tree shaped facilities on trees , 2005, J. Algorithms.

[19]  Juan A. Mesa,et al.  The path-variance problem on tree networks , 2004, Discret. Appl. Math..

[20]  Justo Puerto,et al.  The bi-criteria doubly weighted center-median path problem on a tree , 2006 .