Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment

This paper presents a branch-and-price algorithm for the capacitated hub location problem with single assignment, in which Lagrangean relaxation is used to obtain tight lower bounds of the restricted master problem. A lower bound that is valid at any stage of the column generation algorithm is proposed. The process to obtain this valid lower bound is combined with a constrained stabilization method that results in a considerable improvement on the overall efficiency of the solution algorithm. Numerical results on a battery of benchmark instances of up to 200 nodes are reported. These seem to be the largest instances that have been solved to optimality for this problem.

[1]  T. Aykin.  Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem , 1994 .

[2]  Andreas T. Ernst,et al.  Hub location problems , 2002 .

[3]  Andreas T. Ernst,et al.  Preprocessing and cutting for multiple allocation hub location problems , 2004, Eur. J. Oper. Res..

[4]  G. Nemhauser,et al.  BRANCH-AND-PRICE: GENERATION FOR SOLVING HUGE INTEGER PROGRAMS , 1998 .

[5]  José M. Valério de Carvalho,et al.  Using Extra Dual Cuts to Accelerate Column Generation , 2005, INFORMS J. Comput..

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

[7]  Andreas T. Ernst,et al.  The capacitated multiple allocation hub location problem: Formulations and algorithms , 2000, Eur. J. Oper. Res..

[8]  Claude Lemaréchal,et al.  Comparison of bundle and classical column generation , 2008, Math. Program..

[9]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[10]  João C. N. Clímaco,et al.  Capacitated single allocation hub location problem - A bi-criteria approach , 2008, Comput. Oper. Res..

[11]  Juan-José Salazar-González,et al.  Solving a capacitated hub location problem , 2008 .

[12]  Masao Fukushima,et al.  ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS , 2003 .

[13]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[14]  Nelson Maculan,et al.  The volume algorithm revisited: relation with bundle methods , 2002, Math. Program..

[15]  Jacques Desrosiers,et al.  Dual-Optimal Inequalities for Stabilized Column Generation , 2003, Oper. Res..

[16]  Alfredo Marín,et al.  Formulating and solving splittable capacitated multiple allocation hub location problems , 2005, Comput. Oper. Res..

[17]  Sibel A. Alumur,et al.  Network hub location problems: The state of the art , 2008, Eur. J. Oper. Res..

[18]  Samir Elhedhli,et al.  Hub-and-spoke network design with congestion , 2005, Comput. Oper. Res..

[19]  Paolo Toth,et al.  New trends in exact algorithms for the 0-1 knapsack problem , 2000, Eur. J. Oper. Res..

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

[21]  Martine Labbé,et al.  A branch and cut algorithm for hub location problems with single assignment , 2005, Math. Program..

[22]  James F. Campbell,et al.  Integer programming formulations of discrete hub location problems , 1994 .

[23]  Francisco Barahona,et al.  The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..

[24]  Andreas T. Ernst,et al.  Solution algorithms for the capacitated single allocation hub location problem , 1999, Ann. Oper. Res..

[25]  Inmaculada Rodríguez Martín,et al.  Solving a capacitated hub location problem , 2008, Eur. J. Oper. Res..

[26]  Jacques Desrosiers,et al.  On the choice of explicit stabilizing terms in column generation , 2007, Discret. Appl. Math..

[27]  Iván A. Contreras,et al.  Lagrangean relaxation for the capacitated hub location problem with single assignment , 2009, OR Spectr..

[28]  Hasan Pirkul,et al.  An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems , 1998 .

[29]  Turgut Aykin,et al.  Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System , 1995, Transp. Sci..

[30]  Ivan Contreras Aguilar.  Network hub location: models, algorithms, and related problems , 2009 .