COBRA: A New Formulation of the Classic p-Median Location Problem

The p-median problem was first formulated as an integer-linear programming problem by ReVelle and Swain (1970) and further revised by Rosing, ReVelle and Rosing-Vogelaar (1979). These two forms have withstood the test of time, as they have been used by virtually everyone since then. We prove that a property associated with geographical proximity makes it possible to eliminate many of the model variables through a substitution process. This new substitution technique has resulted in the elimination of up to 60% of the variables needed in either of these classic model formulations.

[1]  J. Beasley.  Lagrangean heuristics for location problems , 1993 .

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

[3]  C. Revelle.  Facility siting and integer-friendly programming , 1993 .

[4]  Gerard Rushton,et al.  Strategies for Solving Large Location-Allocation Problems by Heuristic Methods , 1992 .

[5]  Charles ReVelle,et al.  Urban Public Facility Location , 1987 .

[6]  C. Revelle,et al.  Heuristic concentration: Two stage solution construction , 1997 .

[7]  Dominique Peeters,et al.  A comparison of two dual-based procedures for solving the p-median problem , 1985 .

[8]  E. Hillsman.  The p-Median Structure as a Unified Linear Model for Location—Allocation Analysis , 1984 .

[9]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

[10]  R. Church,et al.  On deployment of health resources in rural Valle Del Cauca Colombia. , 1982 .

[11]  Richard L. Church,et al.  Applying simulated annealing to location-planning models , 1996, J. Heuristics.

[12]  R. A. Whitaker.  A Tight Bound Drop Exchange Algorithm for Solving the p Median Problem , 1981 .

[13]  Paul J. Densham,et al.  A more efficient heuristic for solving largep-median problems , 1992 .

[14]  K. E. Rosing,et al.  The p-Median and its Linear Programming Relaxation: An Approach to Large Problems , 1979 .

[15]  T. L. Ray,et al.  A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..

[16]  S. Hakimi.  Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .

[17]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[18]  J. Current,et al.  An efficient tabu search procedure for the p-Median Problem , 1997 .

[19]  Richard L. Church,et al.  A Median Location Model with Nonclosest Facility Service , 1985, Transp. Sci..

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

[21]  M. Goodchild,et al.  Discrete space location-allocation solutions from genetic algorithms , 1986 .

[22]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .