Optimal Shipment Decisions for an Airfreight Forwarder: Formulation and Solution Methods

We study the freight forwarder’s shipment planning problem in an airfreight forwarding network where a set of cargo shipments have to be transported to given destinations. We provide mixed integer programming formulations that use piecewise-linear cargo rates and account for volume and weight constraints, flight departure/arrival times, as well as shipment-ready times. After exploring the solution of such models using CPLEX, we devise two solution methodologies to handle large problem sizes. The first is based on Lagrangian relaxation, where the problems decompose into a set of knapsack problems and a set of network flow problems. The second is a local branching heuristic that combines branching ideas and local search. The two approaches show promising results in providing good quality heuristic solutions within reasonable computational times, for difficult and large shipment consolidation problems.

[1]  Cynthia Barnhart,et al.  UPS Optimizes Its Air Network , 2004, Interfaces.

[2]  Amy Mainville Cohn,et al.  Network design and flow problems with cross-arc costs , 2008, Eur. J. Oper. Res..

[3]  Walid Ben-Ameur,et al.  On the minimum cost multiple-source unsplittable flow problem , 2007, RAIRO Oper. Res..

[4]  R. Hall.  CONSOLIDATION STRATEGY : INVENTORY, VEHICLES AND TERMINALS , 1987 .

[5]  Sarah Root,et al.  A novel modeling approach for express package carrier planning , 2008 .

[6]  Juan-José Salazar-González,et al.  A local branching heuristic for the capacitated fixed-charge network design problem , 2010 .

[7]  Gang Chen,et al.  A 0-1 LP Model for the Integration and Consolidation of Air Cargo Shipments , 2009, Oper. Res..

[8]  Chengxuan Cao,et al.  Model and algorithms for multi-period sea cargo mix problem , 2007, Eur. J. Oper. Res..

[9]  Cynthia Barnhart,et al.  Logistics Service Network Design for Time-Critical Delivery , 2004, PATAT.

[10]  Yer Van Hui,et al.  Airfreight forwarder shipment planning: A mixed 0-1 model and managerial issues in the integration and consolidation of shipments , 2009, Eur. J. Oper. Res..

[11]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[12]  Cynthia Barnhart,et al.  Network Design for Express Shipment Delivery , 2002, Comput. Optim. Appl..

[13]  Craig R. Carter,et al.  THE EFFECT OF LESS-THAN-TRUCKLOAD RATES ON THE PURCHASE ORDER LOT SIZE DECISION , 1995 .

[14]  H. Pirkul,et al.  New formulation and relaxation to solve a concave-cost network flow problem , 1997 .

[15]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[16]  Diego Klabjan,et al.  Intramarket Optimization for Express Package Carriers , 2008, Transp. Sci..

[17]  Stephen C. Graves,et al.  A composite algorithm for a concave-cost network flow problem , 1989, Networks.

[18]  Thomas L. Magnanti,et al.  Models and Methods for Merge - in - Transit Operations , 2003, Transp. Sci..

[19]  Kuancheng Huang,et al.  A Lagrangian relaxation based heuristic for the consolidation problem of airfreight forwarders , 2007 .

[20]  Tsung-Sheng Chang,et al.  Best routes selection in international intermodal networks , 2008, Comput. Oper. Res..