A branch-and-price approach to p-median location problems

This paper describes a branch-and-price algorithm for the p-median location problem. The objective is to locate p facilities (medians) such as the sum of the distances from each demand point to its nearest facility is minimized. The traditional column generation process is compared with a stabilized approach that combines the column generation and Lagrangean/surrogate relaxation. The Lagrangean/surrogate multiplier modifies the reduced cost criterion, providing the selection of new productive columns at the search tree. Computational experiments are conducted considering especially difficult instances to the traditional column generation and also with some large-scale instances.

[1]  José M. Valério de Carvalho,et al.  Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..

[2]  R. Swain.  A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems , 1974 .

[3]  Jean-Philippe Vial,et al.  On Improvements to the Analytic Center Cutting Plane Method , 1998, Comput. Optim. Appl..

[4]  BarnhartCynthia,et al.  Branch-And-Price , 1998 .

[5]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[6]  George L. Nemhauser,et al.  Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..

[7]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[8]  Luiz Antonio Nogueira Lorena,et al.  Lagrangean/surrogate relaxation for generalized assignment problems , 1999, Eur. J. Oper. Res..

[9]  R. E. Marsten,et al.  The Boxstep Method for Large-Scale Optimization , 2011, Oper. Res..

[10]  Nicos Christofides,et al.  A tree search algorithm for the p-median problem , 1982 .

[11]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[12]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[13]  José Luis González Velarde,et al.  Computing tools for modeling, optimization and simulation : interfaces in computer science and operations research , 2000 .

[14]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[15]  David M. Ryan,et al.  Flight Attendant Rostering for Short-Haul Airline Operations , 1997, Oper. Res..

[16]  Martin Desrochers,et al.  A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..

[17]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[18]  Luiz Antonio Nogueira Lorena,et al.  A column generation approach to capacitated p-median problems , 2004, Comput. Oper. Res..

[19]  G. Righini,et al.  A branch-and-price algorithm for the capacitated p-median problem , 2005 .

[20]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[21]  L. A. Lorena,et al.  Stabilizing column generation using Lagrangean/surrogate relaxation: an application to p-median location problems , 2003 .

[22]  M. Rao,et al.  An Algorithm for the M-Median Plant Location Problem , 1974 .

[23]  Luiz Antonio Nogueira Lorena,et al.  Lagrangean/Surrogate Heuristics for p-Median Problems , 2000 .

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