Air freight logistics under uncertainty

Integrated tail assignment, flight departure time adjustment, and shipment routing

Journal Article (2026)
Author(s)

Shurui Zhu (Beijing Jiaotong University)

Huijun Sun (Beijing Jiaotong University)

Felipe Delgado (Centro Avanzado de Transporte, Logística y Competitividad Económica, Pontificia Universidad Católica de Chile)

A. Bombelli (TU Delft - Aerospace Engineering)

Lorant Tavasszy (TU Delft - Civil Engineering & Geosciences, TU Delft - Technology, Policy and Management)

Xin Guo (Beijing Jiaotong University)

Jianjun Wu (Dalian University of Technology)

Research Group
Operations & Environment
DOI related publication
https://doi.org/10.1016/j.tre.2026.104893 Final published version
More Info
expand_more
Publication Year
2026
Language
English
Research Group
Operations & Environment
Journal title
Transportation Research. Part E: Logistics and Transportation Review
Volume number
212
Article number
104893
Downloads counter
11
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

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.

Files

Taverne
warning

File under embargo until 17-11-2026