An exact algorithm for the modular hub location problem with single assignments

We study a hub location problem with flow-dependent transportation costs.We propose a branch-and-bound algorithm that uses Lagrangean dual bounds.Numerical results are reported for benchmark instances with up to 75 nodes. A key feature of hub-and-spoke networks is the consolidation of flows at hub facilities. The bundling of flows allows reduction in the transportation costs, which is frequently modeled using a constant discount factor that is applied to the flow cost associated with all interhub links. In this paper, we study the modular hub location problem, which explicitly models the flow-dependent transportation costs using modular arc costs. It neither assumes a full interconnection between hub nodes nor a particular topological structure, instead it considers link activation decisions as part of the design. We propose a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds at the nodes of the enumeration tree. Numerical results are reported for benchmark instances with up to 75 nodes.

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

[2]  Iván A. Contreras,et al.  Hub Location as the Minimization of a Supermodular Set Function , 2014, Oper. Res..

[3]  Yu Zhang,et al.  The reliable huband-spoke design problem : Models and algorithms , 2011 .

[4]  Andreas T. Ernst,et al.  An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems , 1998, INFORMS J. Comput..

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

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

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

[8]  Morton E. O'Kelly,et al.  Multiple Allocation Hub Location Model with Fixed Arc Costs , 2015 .

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

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

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

[12]  Fred W. Glover,et al.  Strategic oscillation for the capacitated hub location problem with modular links , 2016, J. Heuristics.

[13]  Sibel A. Alumur,et al.  Hub location under uncertainty , 2012 .

[14]  Ulf Brännlund,et al.  A generalized subgradient method with relaxation step , 1995, Math. Program..

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

[16]  B. Guta.  Subgradient Optimization Methods in Integer Programming with an Application to a Radiation Therapy Problem , 2003 .

[17]  John R. Current,et al.  The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic , 2008, J. Oper. Res. Soc..

[18]  Alf Kimms,et al.  Economies of Scale in Hub & Spoke Network Design Models: We Have It All Wrong. , 2006 .

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

[20]  Morton E. O'Kelly,et al.  Hub‐and‐Spoke Networks in Air Transportation: An Analytical Review , 1999 .

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

[22]  Stefan Nickel,et al.  Multi-product Capacitated Single-Allocation Hub Location Problems: Formulations and Inequalities , 2014 .

[23]  Andreas T. Ernst,et al.  Hub Arc Location Problems: Part II - Formulations and Optimal Algorithms , 2005, Manag. Sci..

[24]  Gilbert Laporte,et al.  Benders Decomposition for Large-Scale Uncapacitated Hub Location , 2011, Oper. Res..

[25]  Eugene L. Lawler,et al.  Parameterized Approximation Scheme for the Multiple Knapsack Problem , 2009, SIAM J. Comput..

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

[27]  Hrvoje Podnar,et al.  Network cost minimization using threshold-based discounting , 2002, Eur. J. Oper. Res..

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

[29]  James F. Campbell.  Modeling Economies of Scale in Transportation Hub Networks , 2013, 2013 46th Hawaii International Conference on System Sciences.

[30]  Faezeh Sadat Mirzaghafour.  Modular Hub Location Problems , 2013 .

[31]  Yu Zhang,et al.  The reliable hub-and-spoke design problem: Models and algorithms , 2015 .

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

[33]  Martine Labbé,et al.  Projecting the flow variables for hub location problems , 2004, Networks.

[34]  Iván A. Contreras,et al.  Exact and heuristic approaches for the cycle hub location problem , 2017, Ann. Oper. Res..

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

[36]  M. Labbé,et al.  Solving the hub location problem in a star–star network , 2008 .

[37]  Iván A. Contreras,et al.  Tight bounds from a path based formulation for the tree of hub location problem , 2009, Comput. Oper. Res..

[38]  Iván A. Contreras,et al.  Exact and heuristic algorithms for the design of hub networks with multiple lines , 2015, Eur. J. Oper. Res..

[39]  Morton E. O'Kelly,et al.  EMBEDDING ECONOMIES OF SCALE CONCEPTS FOR HUB NETWORK DESIGN. , 2001 .

[40]  Ricardo Saraiva de Camargo,et al.  An improved Benders decomposition algorithm for the tree of hubs location problem , 2013, Eur. J. Oper. Res..

[41]  M. Guignard.  Lagrangean relaxation , 2003 .

[42]  Claudio B. Cunha,et al.  A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil , 2007, Eur. J. Oper. Res..

[43]  Hossein Karimi,et al.  Capacity selection for hubs and hub links in hub location problems , 2016 .

[44]  Andreas T. Ernst,et al.  Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem , 1998 .

[45]  Iván A. Contreras,et al.  Hub Location Problems , 2015 .

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

[47]  Hande Yaman,et al.  Star p-hub median problem with modular arc capacities , 2008, Comput. Oper. Res..

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

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

[50]  Andreas T. Ernst,et al.  Hub Arc Location Problems: Part I - Introduction and Results , 2005, Manag. Sci..

[51]  Thomas L. Magnanti,et al.  Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995, Oper. Res..

[52]  Horst W. Hamacher,et al.  Adapting polyhedral properties from facility to hub location problems , 2004, Discret. Appl. Math..

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

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

[55]  Hande Yaman,et al.  Solving the hub location problem with modular link capacities , 2005, Comput. Oper. Res..

[56]  Morton E. O'Kelly,et al.  A geographer's analysis of hub-and-spoke networks☆ , 1998 .

[57]  Stefan Nickel,et al.  Single-assignment hub location problems with multiple capacity levels , 2010 .