EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

An Integrated Scheduling Model for Airport Apron-Bus Drivers Under Stochastic Demand

Yi Zheng, Jun Xu, Huan Xia, Hao Tang

Algorithms · 06.08.2026 · 19 (8) · 651

DOI: 10.3390/a19080651 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algorithms, online erschienen am 06.08.2026. Verfasst von Yi Zheng und 3 weiteren Autor:innen. Die Arbeit nennt 32 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Civil Aviation Administration of China, National Key R&D Program of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Airport apron buses, which shuttle passengers between terminal gates and remotely parked aircraft, are vital for efficient ground operations. However, flight delays and disruptions make demand for apron-bus services uncertain and time-varying, creating substantial challenges for planning driver capacity and work schedules. To tackle this challenge, we develop an Integrated Stochastic-Flexible Planning Model (ISFPM), formulated as a mixed-integer linear program (MILP), that simultaneously optimizes workforce sizing, duty scheduling, and roster assignment for apron-bus drivers. The objective is to minimize the sum of labor costs and the expected penalty for understaffing. This penalty is evaluated under the assumption that driver demand in each period follows a Poisson-binomial distribution, which is derived from probabilistic models of flight delays. For computational efficiency, we reformulate the expected penalty term using continuity-corrected normal approximations based on the cumulative distribution function (CDF). Furthermore, we incorporate practical workforce flexibility features, including hourly-granularity duty start times and heterogeneous workday patterns across roster groups. The computational study is based on Beijing Capital International Airport and accompanied by deidentified replication materials. Across 100 materialized baseline scenarios, the ISFPM uses 148 drivers instead of the 175-driver deterministic fixed-shift benchmark, reducing average management cost by 21.9% and passenger waiting time by 85.6%. Across 18 representative-day scenarios with correlated and severe disruptions, it reduces mean management cost by 15.8% and passenger waiting time by 53.6%. The disruption-scenario analysis also indicates that deterministic flexible staffing attains the lowest waiting time at a higher cost, while common apron travel-time shocks reduce the service advantage of the ISFPM.

Förderung

  • National Natural Science Foundation of China
  • Civil Aviation Administration of China
  • National Key R&D Program of China

Zitieren

APA

Zheng, Y., Xu, J., Xia, H., & Tang, H. (2026). An Integrated Scheduling Model for Airport Apron-Bus Drivers Under Stochastic Demand. Algorithms, 19(8), 651. https://doi.org/10.3390/a19080651

Vancouver

Zheng Y, Xu J, Xia H, Tang H. An Integrated Scheduling Model for Airport Apron-Bus Drivers Under Stochastic Demand. Algorithms. 2026;19(8):651. doi:10.3390/a19080651

BibTeX
@article{Zheng2026,
  author = {Zheng, Yi and Xu, Jun and Xia, Huan and Tang, Hao},
  title = {An Integrated Scheduling Model for Airport Apron-Bus Drivers Under Stochastic Demand},
  journal = {Algorithms},
  year = {2026},
  volume = {19},
  number = {8},
  pages = {651},
  doi = {10.3390/a19080651}
}
Kostenlos starten →