p-Median and p-dispersion problems: A bi-criteria analysis

Given a collection of n locations and a symmetric measure of distance (difference) between each pair of locations, we seek to identify (select) a subset of p locations so as to achieve two distinct objectives. The first objective is to use the selected locations as centers (medians) of p groups that would partition the entire collection and minimize the total distance between the locations and their respective group medians. The second objective is to maximize the minimum distance (diversity) among the selected locations themselves. We study this problem as a multi-objective optimization problem and propose an iterative algorithm to obtain its non-dominated frontier. At each iteration we construct and solve a 0-1 integer programming problem. Through a computational experiment we show that this algorithm is computationally effective for small to medium size instances of the problem. We also propose a Lagrangian heuristic algorithm for solving larger instances of this problem.

[1]  Roberto D. Galvão,et al.  A Dual-Bounded Algorithm for the p-Median Problem , 1980, Oper. Res..

[2]  George F. List,et al.  Mathematical models and algorithms for the location of sensors on a traffic network , 2012 .

[3]  G. Nemhauser,et al.  Integer Programming , 2020 .

[4]  E. Erkut.  The discrete p-dispersion problem , 1990 .

[5]  Qingfu Zhang,et al.  Multiobjective Combinatorial Optimization by Using Decomposition and Ant Colony , 2012 .

[6]  Yuhong Wang,et al.  Axle Load Distribution for Mechanistic — Empirical Pavement Design , 2007 .

[7]  S. S. Ravi,et al.  Heuristic and Special Case Algorithms for Dispersion Problems , 1994, Oper. Res..

[8]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[9]  Brian Everitt,et al.  Cluster analysis , 1974 .

[10]  R. T. Wong,et al.  `Multidimensional' extensions and a nested dual approach for the m-median problem , 1985 .

[11]  Syed Waqar Haider,et al.  Impact of systematic axle load measurement error on pavement design using mechanistic-empirical pavement design guide , 2012 .

[12]  Yupo Chan,et al.  LOCATION THEORY AND DECISION ANALYSIS , 2011 .

[13]  George F. List,et al.  Locating Traffic Sensors on a Highway Network , 2013 .

[14]  J. Reese,et al.  Solution methods for the p‐median problem: An annotated bibliography , 2006, Networks.

[15]  Dimitris Bertsimas,et al.  Optimization over integers , 2005 .

[16]  Micael Gallego,et al.  GRASP and path relinking for the max-min diversity problem , 2010, Comput. Oper. Res..

[17]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[18]  Lazaros P. Mavrides.  An Indirect Method for the Generalized k-Median Problem Applied to Lock-Box Location , 1979 .

[19]  Michael Kuby.  Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems , 1988 .

[20]  S. L. HAKIMIt.  AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[21]  Erhan Erkut,et al.  Analytical models for locating undesirable facilities , 1989 .

[22]  F. Glover,et al.  Analyzing and Modeling the Maximum Diversity Problem by Zero‐One Programming* , 1993 .

[23]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[24]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[25]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[26]  H. Crowder,et al.  Cluster Analysis: An Application of Lagrangian Relaxation , 1979 .

[27]  Subhash C. Narula,et al.  Technical Note - An Algorithm for the p-Median Problem , 1977, Oper. Res..

[28]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[29]  David Pisinger,et al.  Upper bounds and exact algorithms for p-dispersion problems , 2006, Comput. Oper. Res..

[30]  Lee J. White,et al.  A Maxmin Location Problem , 1980, Oper. Res..

[31]  Jay B. Ghosh,et al.  Computational aspects of the maximum diversity problem , 1996, Oper. Res. Lett..

[32]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[33]  Rex K. Kincaid.  Good solutions to discrete noxious location problems via metaheuristics , 1992, Ann. Oper. Res..

[34]  Michel Gendreau,et al.  An exact epsilon-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits , 2009, Eur. J. Oper. Res..

[35]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[36]  P. Siarry,et al.  Multiobjective Optimization: Principles and Case Studies , 2004 .