A Lagrangian heuristic and GRASP for the hub-and-spoke network system with economies-of-scale and congestion

Abstract We consider a hub-and-spoke network design problem with inter-hub economies-of-scale and hub congestion. We explicitly model the economies-of-scale as a concave piece-wise linear function and congestion as a convex function. The problem is modeled as a nonlinear mixed integer program that is difficult to solve directly since the objective function has both convex and concave nonlinear terms and hence finding an optimal solution may not be easy. A Lagrangian approach is proposed to obtain tight upper and lower bounds. The Lagrangian decomposition exploits the structure of the problem and decomposes it to convex and concave subproblems. Furthermore, we add some valid inequalities to accelerate the convergence rate of the Lagrangian heuristic. To tackle large instances, a Greedy Randomized Adaptive Search Procedure (GRASP) is developed. Both the Lagrangian heuristic and GRASP provide high-quality solutions within reasonable computational time. The optimal designs of hub-and-spoke networks with nonlinear inter-hub economies-of-scale and congestion at hub locations are analyzed in comparison with other models in the literature to demonstrate the significant impact of modeling nonlinearity in economies-of-scale and congestion simultaneously rather than independently.

[1]  James F. Campbell Designing Hub Networks with Connected and Isolated Hubs , 2010, 2010 43rd Hawaii International Conference on System Sciences.

[2]  Morton E. O'Kelly,et al.  Hub location with flow economies of scale , 1998 .

[3]  Illia Racunica,et al.  OPTIMAL LOCATION OF INTERMODAL FREIGHT HUBS , 2005 .

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

[5]  Concepción Román,et al.  ANALYZING COMPETITION FOR HUB LOCATION IN INTERCONTINENTAL AVIATION MARKETS , 2004 .

[6]  Sibel A. Alumur,et al.  A tabu-search based heuristic for the hub covering problem over incomplete hub networks , 2009, Comput. Oper. Res..

[7]  Melquíades Pérez Pérez,et al.  A Hybrid GRASP-Path Relinking Algorithm for the Capacitated p-hub Median Problem , 2005, Hybrid Metaheuristics.

[8]  Ángel Corberán,et al.  GRASP for the uncapacitated r-allocation p-hub median problem , 2014, Comput. Oper. Res..

[9]  Joel Sokol,et al.  Designing Mechanisms for the Management of Carrier Alliances , 2011, Transp. Sci..

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

[11]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[12]  Ricardo Saraiva de Camargo,et al.  Benders Decomposition for Hub Location Problems with Economies of Scale , 2009, Transp. Sci..

[13]  S. Kim,et al.  A column generation heuristic for congested facility location problem with clearing functions , 2013, J. Oper. Res. Soc..

[14]  Ricardo Saraiva de Camargo,et al.  A hybrid Outer-Approximation/Benders Decomposition algorithm for the single allocation hub location problem under congestion , 2011, Oper. Res. Lett..

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

[16]  Ricardo Saraiva de Camargo,et al.  Multiple allocation hub-and-spoke network design under hub congestion , 2009, Comput. Oper. Res..

[17]  Iván A. Contreras,et al.  The Tree of Hubs Location Problem , 2010, Eur. J. Oper. Res..

[18]  Samir Elhedhli,et al.  A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion , 2010, INFORMS J. Comput..

[19]  Zuo-Jun Max Shen,et al.  An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results , 2002, Ann. Oper. Res..

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

[21]  Gilbert Laporte,et al.  The Dynamic Uncapacitated Hub Location Problem , 2011, Transp. Sci..

[22]  P. Camerini,et al.  On improving relaxation methods by modified gradient techniques , 1975 .

[23]  Yanfeng Ouyang,et al.  Dynamic Planning of Facility Locations with Benefits from Multitype Facility Colocation , 2013, Comput. Aided Civ. Infrastructure Eng..

[24]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

[25]  Ehsan Nikbakhsh,et al.  Hub location problems: A review of models, classification, solution techniques, and applications , 2013, Comput. Ind. Eng..

[26]  Yanfeng Ouyang,et al.  Biofuel refinery location and supply chain planning under traffic congestion , 2011 .

[27]  M. O'Kelly,et al.  Activity Levels at Hub Facilities in Interacting Networks , 2010 .

[28]  J. G. Klincewicz,et al.  Enumeration and Search Procedures for a Hub Location Problem with Economies of Scale , 2002, Ann. Oper. Res..

[29]  M. O'Kelly,et al.  A quadratic integer program for the location of interacting hub facilities , 1987 .

[30]  Vladimir Marianov,et al.  A competitive hub location and pricing problem , 2013, Eur. J. Oper. Res..

[31]  Iván A. Contreras,et al.  The Hub Line Location Problem , 2015, Transp. Sci..

[32]  David Gillen,et al.  Full Cost of Air Travel in the California Corridor , 1999 .

[33]  Mauricio G. C. Resende,et al.  GRASP: basic components and enhancements , 2011, Telecommun. Syst..

[34]  Nenad Mladenovic,et al.  A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem , 2009, Eur. J. Oper. Res..

[35]  Iván A. Contreras,et al.  Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment , 2011, INFORMS J. Comput..

[36]  Martine Labbé,et al.  A branch-and-cut algorithm for the partitioning-hub location-routing problem , 2011, Comput. Oper. Res..

[37]  D. Skorin-Kapov,et al.  Tight linear programming relaxations of uncapacitated p-hub median problems , 1996 .

[38]  Morton E. O'Kelly,et al.  Twenty-Five Years of Hub Location Research , 2012, Transp. Sci..

[39]  D. Bryan Extensions to the Hub Location Problem: Formulations and Numerical Examples , 2010 .

[40]  Yanfeng Ouyang,et al.  Reliable Facility Location Design Under the Risk of Disruptions , 2010, Oper. Res..

[41]  Jozef Kratica,et al.  Discrete Optimization Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem , 2007 .

[42]  Andreas T. Ernst,et al.  Efficient algorithms for the uncapac-itated single allocation p-hub median problem , 1996 .

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