Robust Optimization of Airplane Passenger Seating Assignments

Abstract

We present a method that reduces the time it takes to complete the passenger boarding of an airplane. In particular, we describe a two-stage mixed integer programming (MIP) approach, which assigns passengers to seats on an airplane based on the number of bags they carry aboard the plane. The first stage is an MIP that assigns passengers to seats to minimize the time to complete the boarding of the plane. The second-stage MIP also determines seating assignments, while constraining the total boarding time to that determined by the stage-one MIP and maximizing weighted slack times to provide a more robust assignment. Numerical results show that this two-stage approach results in lower average boarding times than the one-stage approach, when the time it takes passengers to walk and sit in their seats is random. Experiments indicate that the magnitude of the improvement is not very sensitive to variations in the slack time weights.

Keywords

• airplane boarding
• passenger luggage
• mixed integer programming (MIP)
• slack times
• robust optimization