Multi-product Capacitated Single-Allocation Hub Location Problems: Formulations and Inequalities

In this paper we extend the classical capacitated single-allocation hub location problem by considering that multiple products are to be shipped through the network. We propose a unified modeling framework for the situation in which no more than one hub can be located in each node. In particular, we consider the case in which all hubs are dedicated to handling a single-product as well as the case in which all hubs can handle all products. The objective is to minimize the total cost, which includes setup costs for the hubs, setup costs for each product in each hub and flow routing costs. Hubs are assumed to be capacitated. For this problem several models are proposed which are based on existing formulations for the (single-product) capacitated single-allocation hub location problem. Additionally, several classes of inequalities are proposed in order to strengthen the models in terms of the lower bound provided by the linear relaxation. We report results of a set of computational experiments conducted to test the proposed models and their enhancements.

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

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

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

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

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

[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]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

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

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

[10]  Sibel A. Alumur,et al.  A hub covering network design problem for cargo applications in Turkey , 2009, J. Oper. Res. Soc..

[11]  Morton E. O’Kelly,et al.  Routing Traffic at Hub Facilities , 2010 .

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

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

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

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

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

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

[18]  Milorad Vidović,et al.  The p-hub Model with Hub-catchment Areas, Existing Hubs, and Simulation: A Case Study of Serbian Intermodal Terminals , 2011 .

[19]  J. G. Klincewicz,et al.  HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW , 1998 .

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

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

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

[23]  Francisco Saldanha-da-Gama,et al.  The capacitated single-allocation hub location problem revisited: A note on a classical formulation , 2010, Eur. J. Oper. Res..

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

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