Centralized Carrier Collaboration Multihub Location Problem for Less-Than-Truckload Industry

A centralized carrier collaboration multihub location problem (CCCMLP) for the small to medium-sized less-than-truckload industry is addressed. In the CCCMLP, a central entity (e.g., a third-party logistics firm) seeks a set of collaborative consolidation transshipment hubs to establish a hybrid collaborative hub-and-spoke system that minimizes the total collaborative costs for the set of collaborating carriers. Previous studies focused on addressing the exchange of capacity without considering the location of transfer hubs and the routes that connect them. A carrier has the option either to collaborate or to ship its demand directly without collaborating. The decision depends on the expected profit margin over shipping directly while following a revenue-generating, rate-setting behavior. The CCCMLP was formulated as a variant of the P-hub location problem, which is NP-hard and solved with Lagrangian relaxation. Numerical experiments were conducted to gain insight into the performance of the CCCMLP formulation under various network sizes and numbers of hubs. The results indicate that larger expected profit margins from collaborative carriers applying revenue-generating behavior would increase the likelihood of collaboration by carriers. As the network size increases, the effect of hybrid hub location costs drops.

[1]  J. G. Klincewicz,et al.  Avoiding local optima in thep-hub location problem using tabu search and GRASP , 1993, Ann. Oper. Res..

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

[3]  Hani S. Mahmassani,et al.  Train Slot Cooperation in Multicarrier, International Rail-Based Intermodal Freight Transport , 2008 .

[4]  Salvador Hernandez,et al.  Centralized Time-Dependent Multiple-Carrier Collaboration Problem for Less-Than-Truckload Carriers , 2011 .

[5]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[6]  Michael Kuby,et al.  The hub network design problem with stopovers and feeders: The case of Federal Express , 1993 .

[7]  Erin D. Bailey,et al.  Models for Reducing Deadheading through Carrier and Shipper Collaboration , 2011 .

[8]  Günther Zäpfel,et al.  Planning and optimization of hub-and-spoke transportation networks of cooperative third-party logistics providers , 2002 .

[9]  A. Regan,et al.  Combinatorial Auctions for Transportation Service Procurement: The Carrier Perspective , 2003 .

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

[11]  J. G. Klincewicz,et al.  A dual algorithm for the uncapacitated hub location problem , 1996 .

[12]  Sungsoo Park,et al.  European Journal of Operational Research a Linear Program for the Two-hub Location Problem , 2022 .

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

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

[15]  Özlem Ergun,et al.  Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping , 2010, Oper. Res..

[16]  Özlem Ergun,et al.  Ship Scheduling and Network Design for Cargo Routing in Liner Shipping , 2008, Transp. Sci..

[17]  William P. Anderson,et al.  E-commerce, Transportation, and Economic Geography , 2003 .

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

[19]  Pei Liu,et al.  Routing Problem for Hybrid Hub-and-spoke Transportation Network: a Case Study of a LTL Carrier , 2007, 2007 IEEE International Conference on Automation and Logistics.

[20]  J. G. Klincewicz,et al.  Heuristics for the p-hub location problem , 1991 .

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

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

[23]  Susana V. Mondschein,et al.  Solution approaches to the bus operator problem , 1993 .

[24]  Avinash Unnikrishnan,et al.  Modeling carrier collaboration in freight networks , 2011 .

[25]  Salvador Hernandez,et al.  A less-than-truckload carrier collaboration planning problem under dynamic capacities , 2011 .

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

[27]  Avinash Unnikrishnan,et al.  Models for Minimizing Backhaul Costs through Freight Collaboration , 2011 .

[28]  Srinivas Peeta,et al.  Less-than-Truckload Static Single-Carrier Collaboration Problem , 2010 .

[29]  Haluk Topcuoglu,et al.  Solving the uncapacitated hub location problem using genetic algorithms , 2005, Comput. Oper. Res..

[30]  Miguel A. Figliozzi,et al.  Analysis and Evaluation of Incentive Compatible Dynamic Mechanisms for Carrier Collaboration , 2006 .

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

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

[33]  E M Malstrom,et al.  REAL-TIME ROUTING OF SHIPMENTS CONSIDERING TRANSFER COSTS AND SHIPMENT CHARACTERISTICS , 1997 .

[34]  Morton E. O'Kelly,et al.  The Location of Interacting Hub Facilities , 1986, Transp. Sci..

[35]  James F. Campbell Hub Location and the p-Hub Median Problem , 1996, Oper. Res..