Optimal Shipment Decisions for an Airfreight Forwarder: Formulation and Solution Methods
Transportation Research Part C 21 (2012) 17–30
30 Pages Posted: 13 Jun 2016 Last revised: 29 Jun 2016
Date Written: June 16, 2016
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.
Keywords: Air cargo; Langrangian relaxation; Network planning; Local branching; Column generation; Heuristics
Suggested Citation: Suggested Citation