Author
Listed:
- Zhu, Shurui
- Sun, Huijun
- Delgado, Felipe
- Bombelli, Alessandro
- Tavasszy, Lóránt
- Guo, Xin
- Wu, Jianjun
Abstract
Air cargo operations face significant challenges due to flight time variability, which can disrupt schedules and delay shipments. This is especially critical for time-sensitive cargo and in the context of express delivery. In this paper, we integrate aircraft tail assignment, flight departure time adjustment, and cargo routing decisions under flight time uncertainty. We formulate the problem as a two-stage stochastic programming model: the first-stage determines the sequence of flight legs assigned to each aircraft, while the second-stage, after flight times are realized, determines the demand to be served, its routing, and flight departure times. To improve computational performance, we develop tailored algorithms for demand itinerary generation and implement a backward scenario aggregation algorithm that preserves uncertainty characteristics while reducing problem dimensionality. Scenarios are generated using three years of historical data, allowing realistic temporal and spatial dependencies to be retained. Using data inspired by the domestic network of a major Chinese express air cargo carrier, we conduct experiments across multiple seasons. The proposed approach consistently outperforms deterministic benchmarks based on average and minimum flight times, with profit improvements of up to 4.3% and 3.8%, respectively, during the Winter Monsoon season, when variability is highest. Moreover, we show that the value of stochastic planning increases significantly when the network operates under tighter connectivity conditions. Under reduced fleet availability, profit improvements rise to 7.0% and 9.7% relative to the benchmarks based on average and minimum flight times, respectively, highlighting how delay propagation in tightly coupled aircraft rotations makes deterministic plans particularly fragile. Overall, the results demonstrate that anticipating uncertainty at the tactical planning stage improves both operational robustness and revenue performance in large-scale air cargo networks.
Suggested Citation
Zhu, Shurui & Sun, Huijun & Delgado, Felipe & Bombelli, Alessandro & Tavasszy, Lóránt & Guo, Xin & Wu, Jianjun, 2026.
"Air freight logistics under uncertainty: Integrated tail assignment, flight departure time adjustment, and shipment routing,"
Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 212(C).
Handle:
RePEc:eee:transe:v:212:y:2026:i:c:s1366554526002322
DOI: 10.1016/j.tre.2026.104893
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:212:y:2026:i:c:s1366554526002322. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.