Airplane Boarding

Mathematical models, algorithms, and complexity for a minimized boarding time for passenger airplanes due to an optimal passenger boarding order.

Abstract

It is folklore knowledge in the aviation industry that a passenger airplane can only generate revenue while in the air, as ground handling operations and the time a plane spends, e.g., at the gate effectively cost airlines money. Furthermore, a reduced boarding time is also beneficial for passengers and airport operators. For passengers, it results in reduced average individual boarding times, and airport operators are possibly able to offer more flights per day per gate. Thus, airlines wish to minimize the turn-around times of their airplanes, i.e., the times between the last landing and the next takeoff. Although there are many steps involved in turning around an airplane, passenger boarding is one of the steps that most affect the turn-around time.

In this project, we study the process of boarding through a jet-bridge, where each passenger has a preassigned seat. Our explicit goal is to minimize the overall boarding time, where we focus on the time elapsing between the first passenger entering the airplane cabin and the last passenger sitting down on his/her seat.

Projectinfo

Duration:
ongoing
Involved:
Contact:

Paper(s)

Willamowski, F.J.L. and Tillmann, A.M.
 Minimizing Airplane Boarding Time. Transportation Science, 56(5):1196—1218, February 2022.

Instances and Data for the Airplane Boarding Problem

  • Passenger-dependent moving times and passenger-dependent settle-in times: instances_mp-sp.zip

  • Constant moving time for all passengers and passenger-dependent settle-in times: instances_m-sp.zip

  • Passenger-dependent moving times and constant settle-in time for all passengers: instances_mp-s.zip

  • Instances with perturbed passenger time data: perturbed.zip

  • Instances with pessimistic passenger time data: instances_pessimistic.zip

  • Data for late and relocated passengers: data_robust.zip

Results for the Airplane Boarding Problem

  • Results for passenger-dependent moving times and passenger-dependent settle-in times: results_mp-sp.zip

  • Results for one constant moving time for all passengers and passenger-dependent settle-in times: results_m-sp.zip

  • Results for passenger-dependent moving times and one constant settle-in time for all passengers: results_mp-s.zip

  • Results for perturbed passenger time data: results_perturbed.zip

  • Results for instances with inseparable passenger groups: results_groups.zip

  • Results for instances with seat interference consideration: results_seat_interference.zip

  • Results for instances with inseparable passenger groups and with seat interference consideration: results_groups_seat_interference.zip

Preprint(s)

Willamowski, F.J.L. and Tillmann, A.M.
 Minimizing Airplane Boarding Time. repORt 2021—63, Lehrstuhl für Operations Research, RWTH Aachen University, April 2021.
Willamowski, F.J.L. and Tillmann, A.M.
 Minimizing Airplane Boarding Time. repORt 2019—56, Lehrstuhl für Operations Research, RWTH Aachen University, November 2019.

Instances for first Preprint

  • Passenger-dependent moving times and passenger-dependent settle-in times: instances_mp-sp_preprint.zip

  • Constant moving time for all passengers and passenger-dependent settle-in times: instances_m-sp_preprint.zip

  • Passenger-dependent moving times and constant settle-in time for all passengers: instances_mp-s_preprint.zip

Go back