A branch-and-cut algorithm for the hub location and routing problem

Abstract We study the hub location and routing problem where we decide on the location of hubs, the allocation of nodes to hubs, and the routing among the nodes allocated to the same hubs, with the aim of minimizing the total transportation cost. Each hub has one vehicle that visits all the nodes assigned to it on a cycle. We propose a mixed integer programming formulation for this problem and strengthen it with valid inequalities. We devise separation routines for these inequalities and develop a branch-and-cut algorithm which is tested on CAB and AP instances from the literature. The results show that the formulation is strong and the branch-and-cut algorithm is able to solve instances with up to 50 nodes.

[1]  Bahar Y. Kara,et al.  The latest arrival hub location problem for cargo delivery systems with stopovers , 2007 .

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

[3]  Gilbert Laporte,et al.  Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..

[4]  Hande Yaman,et al.  The hierarchical hub median problem with single assignment , 2009 .

[5]  Sibel A. Alumur,et al.  The design of single allocation incomplete hub networks , 2009 .

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

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

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

[9]  Jamie Ebery,et al.  Solving large single allocation p-hub problems with two or three hubs , 2001, Eur. J. Oper. Res..

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

[11]  Arno Bruns,et al.  Restructuring of Swiss parcel delivery services , 2000, OR Spectr..

[12]  Ricardo Saraiva de Camargo,et al.  A new formulation and an exact approach for the many-to-many hub location-routing problem , 2013 .

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

[14]  Adam N. Letchford,et al.  Multistars, partial multistars and the capacitated vehicle routing problem , 2002, Math. Program..

[15]  Stefan Nickel,et al.  Hub Location Problems in Urban Traffic Networks , 2001 .

[16]  José-Manuel Belenguer,et al.  A Branch and Cut method for the Capacitated Location-Routing Problem , 2006, 2006 International Conference on Service Systems and Service Management.

[17]  G. Laporte,et al.  An exact algorithm for solving a capacitated location-routing problem , 1986 .

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

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

[20]  Hande Yaman,et al.  Star p-hub center problem and star p-hub median problem with bounded path lengths , 2012, Comput. Oper. Res..

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

[22]  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..

[23]  Harvey J. Miller,et al.  THE HUB NETWORK DESIGN PROBLEM: A REVIEW AND SYNTHESIS. , 1994 .

[24]  Turgut Aykin,et al.  The hub location and routing problem , 1995 .

[25]  S. Salhi,et al.  The many-to-many location-routing problem , 1998 .

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

[27]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

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

[29]  F. CampbellJ.,et al.  Hub Arc Location Problems , 2005 .

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

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

[32]  G. Laporte,et al.  An exact algorithm for minimizing routing and operating costs in depot location , 1981 .

[33]  M. Wasner,et al.  An integrated multi-depot hub-location vehicle routing model for network planning of parcel service , 2004 .

[34]  Haldun Süral,et al.  Hubbing and routing in postal delivery systems , 2010, Ann. Oper. Res..

[35]  Roberto Baldacci,et al.  A unified exact method for solving different classes of vehicle routing problems , 2009, Math. Program..

[36]  Inmaculada Rodríguez Martín,et al.  A branch-and-cut algorithm for the plant-cycle location problem , 2004, J. Oper. Res. Soc..

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

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

[39]  T. Aykin.  On “a quadratic integer program for the location of interacting hub facilities” , 1990 .

[40]  Juan A. Díaz,et al.  A compact model and tight bounds for a combined location-routing problem , 2005, Comput. Oper. Res..

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

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

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

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

[45]  Sibel A. Alumur,et al.  Hierarchical multimodal hub location problem with time-definite deliveries , 2012 .

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

[47]  Hande Yaman,et al.  Allocation strategies in hub networks , 2011, Eur. J. Oper. Res..

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

[49]  Julia Rieck,et al.  Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery , 2014, Eur. J. Oper. Res..