Semi-Lagrangian relaxation applied to the uncapacitated facility location problem

We show how the performance of general purpose Mixed Integer Programming (MIP) solvers, can be enhanced by using the Semi-Lagrangian Relaxation (SLR) method. To illustrate this procedure we perform computational experiments on large-scale instances of the Uncapacitated Facility Location (UFL) problems with unknown optimal values. CPLEX solves 3 out of the 36 instances. By combining CPLEX with SLR, we manage to solve 18 out of the 36 instances and improve the best known lower bound for the other instances. The key point has been that, on average, the SLR approach, has reduced by more than 90% the total number of relevant UFL variables.

[1]  David Abramson,et al.  A Parallel Interior Point Method and Its Application to Facility Location Problems , 1998, Comput. Optim. Appl..

[2]  Yuri Kochetov,et al.  Computationally Difficult Instances for the Uncapacitated Facility Location Problem , 2005 .

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

[4]  Gérard Cornuéjols,et al.  A projection method for the uncapacitated facility location problem , 1990, Math. Program..

[5]  Mercedes Landete,et al.  On the facets of the simple plant location packing polytope , 2002, Discret. Appl. Math..

[6]  Cesar Beltran-Royo,et al.  A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization , 2007, Eur. J. Oper. Res..

[7]  Claude Tadonki,et al.  Proximal-ACCPM: A Versatile Oracle Based Optimisation Method , 2007 .

[8]  Mercedes Landete,et al.  New facets for the two-stage uncapacitated facility location polytope , 2009, Comput. Optim. Appl..

[9]  D. Chinhyung Cho,et al.  On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems , 1983, Math. Oper. Res..

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

[11]  Lubos Buzna,et al.  An acceleration of Erlenkotter-Körkel’s algorithms for the uncapacitated facility location problem , 2008, Ann. Oper. Res..

[12]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[13]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[14]  Li-Lian Gao,et al.  Uncapacitated facility location: General solution procedure and computational experience , 1994 .

[15]  Diptesh Ghosh,et al.  Neighborhood search heuristics for the uncapacitated facility location problem , 2003, Eur. J. Oper. Res..

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

[17]  Jean-Philippe Vial,et al.  Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method , 2002, Optim. Methods Softw..

[18]  Minghe Sun.  Solving the uncapacitated facility location problem using tabu search , 2006, Comput. Oper. Res..

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

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

[21]  Manfred Padberg,et al.  On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets , 1983, Math. Oper. Res..

[22]  Claude Lemaréchal,et al.  Lagrangian Relaxation , 2000, Computational Combinatorial Optimization.

[23]  J. Goffin,et al.  Decomposition and nondifferentiable optimization with the projective algorithm , 1992 .

[24]  Fabián A. Chudak,et al.  Near-optimal solutions to large-scale facility location problems , 2005, Discret. Optim..

[25]  J. Hiriart-Urruty,et al.  Fundamentals of Convex Analysis , 2004 .

[26]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[27]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[28]  C. Beltran.  Solving the p-Median Problem with a Semi-Lagrangian Relaxation∗ , .

[29]  Ignacio Garcia Jurado.  Spanish Society of Statistics and Operations Research , 2011 .

[30]  Jean-Philippe Vial,et al.  Proximal ACCPM, a Cutting Plane Method for Column Generation and Lagrangian Relaxation: Application to the P-Median Problem , 2002 .

[31]  Manfred Körkel.  On the exact solution of large-scale simple plant location problems , 1989 .

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

[33]  Pierre Hansen,et al.  A note on duality gap in the simple plant location problem , 2002, Eur. J. Oper. Res..

[34]  M. Guignard.  A Lagrangean dual ascent algorithm for simple plant location problems , 1988 .

[35]  Mauricio G. C. Resende,et al.  A hybrid multistart heuristic for the uncapacitated facility location problem , 2006, Eur. J. Oper. Res..

[36]  D. Ghosh.  Neighborhood Search Heuristicsfor the Uncapacitated Facility Location Problem , 2002 .