The air-cargo consolidation problem with pivot weight: Models and solution methods. (July 2015)

• Record Type: Journal Article
• Authors: Bookbinder, James H.; Elhedhli, Samir; Li, Zichao
• Is Part Of: Computers & operations research. Volume 59(2015)
• Page Start: 22
• Page End: 32
• Publication Date: 2015-07
• Subjects: Air transportation -- Pivot weight -- Lagrangian relaxation -- Column generation -- Local branching -- Branch and price -- Network planning; Operations research -- Periodicals; Electronic digital computers -- Periodicals; 004.05
• DOI: 10.1016/j.cor.2014.11.015
• Languages: English
• ISSNs: 0305-0548

Abstract

Abstract: In the international air cargo business, freight is usually consolidated into containers, called Unit Load Devices (ULDs). The transportation charge of a ULD depends on whether the total weight exceeds a certain threshold, called the pivot weight . If the total load tendered by a freight forwarder is less than the pivot weight, it gets charged at the under-pivot rate . Any portion of the load that exceeds the pivot weight is charged at the over-pivot rate. This scheme is adopted for safety reasons to avoid the overloading of ULDs. We formulate a mixed integer program, and propose four solution methodologies for the air-cargo consolidation problem under the pivot-weight scheme (ACPW). These are exact solution approaches based on branch-and-price, a best-fit decreasing loading heuristic, and two extended local branching heuristics (a multi-local tree search and a relaxation-induced neighborhood search). The local branching heuristic with relaxation-induced neighborhood search is found to outperform other approaches in terms of solution quality and computational time. Problems with up to 400 shipments and 80 containers are solved to within 3.4% of optimality in less than 20 min.