Solving Large p-Median Problems with a Radius Formulation

By means of a model based on a set covering formulation, it is shown how the p-median problem can be solved with just a column generation approach that is embedded in a branch-and-bound framework based on dynamic reliability branching. This method is more than competitive in terms of computational times and size of the instances that have been optimally solved. In particular, problems of a size larger than the largest ones considered in the literature up to now are solved exactly in this paper.

[1]  Antonio Sassano,et al.  On the p-Median polytope , 2001, Math. Program..

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

[3]  Richard L. Church,et al.  COBRA: A New Formulation of the Classic p-Median Location Problem , 2003, Ann. Oper. Res..

[4]  Martine Labbé,et al.  A New Formulation and Resolution Method for the p-Center Problem , 2004, INFORMS J. Comput..

[5]  Peter L. Hammer,et al.  Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem , 1987, Transp. Sci..

[6]  Gerard Sierksma,et al.  Branch and peg algorithms for the simple plant location problem , 2003, Comput. Oper. Res..

[7]  Said Salhi,et al.  Discrete Location Theory , 1991 .

[8]  Laurence A. Wolsey,et al.  A Canonical Representation of Simple Plant Location Problems and Its Applications , 1980, SIAM J. Matrix Anal. Appl..

[9]  Pierre Hansen,et al.  The p-median problem: A survey of metaheuristic approaches , 2005, Eur. J. Oper. Res..

[10]  Martine Labbé,et al.  A strengthened formulation for the simple plant location problem with order , 2007, Oper. Res. Lett..

[11]  Tobias Achterberg,et al.  Constraint integer programming , 2007 .

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

[13]  Claude Tadonki,et al.  Solving the p-Median Problem with a Semi-Lagrangian Relaxation , 2006, Comput. Optim. Appl..

[14]  Timothy J. Lowe,et al.  Technical Note - On the Equivalence of Dual Methods for Two Location Problems , 1993, Transp. Sci..

[15]  H. Simão,et al.  A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem , 1989 .

[16]  A. Kolen.  Solving covering problems and the uncapacitated plant location problem on trees , 1983 .

[17]  Igor Vasil'ev,et al.  Computational study of large-scale p-Median problems , 2007, Math. Program..

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

[19]  Thorsten Koch,et al.  Branching rules revisited , 2005, Oper. Res. Lett..

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

[21]  Roberto Musmanno,et al.  Introduction to Logistics Systems Planning and Control , 2004 .

[22]  George L. Nemhauser,et al.  The uncapacitated facility location problem , 1990 .

[23]  G. Ribiere,et al.  Experiments in mixed-integer linear programming , 1971, Math. Program..

[24]  Sourour Elloumi,et al.  A tighter formulation of the p-median problem , 2010, J. Comb. Optim..

[25]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[26]  Mauricio G. C. Resende,et al.  A Hybrid Heuristic for the p-Median Problem , 2004, J. Heuristics.

[27]  Olivier Briant,et al.  The Optimal Diversity Management Problem , 2004, Oper. Res..

[28]  Horst A. Eiselt,et al.  Location analysis: A synthesis and survey , 2005, Eur. J. Oper. Res..