Optimal boarding method for airline passengers

TL;DR

This paper uses a Markov Chain Monte Carlo algorithm and simulation to identify the optimal passenger boarding order, significantly reducing boarding time and informing airline boarding procedures.

Contribution

It introduces a novel optimization approach to determine the most efficient boarding sequence, surpassing traditional methods in reducing aircraft boarding time.

Findings

Optimal boarding can reduce boarding time by over four times

The model highlights luggage loading as the dominant time factor

Practical modifications can adapt the optimal method for real-world use

Abstract

Using a Markov Chain Monte Carlo optimization algorithm and a computer simulation, I find the passenger ordering which minimizes the time required to board the passengers onto an airplane. The model that I employ assumes that the time that a passenger requires to load his or her luggage is the dominant contribution to the time needed to completely fill the aircraft. The optimal boarding strategy may reduce the time required to board and airplane by over a factor of four and possibly more depending upon the dimensions of the aircraft. In addition, knowledge of the optimal boarding procedure can inform decisions regarding changes to methods that are employed by a particular carrier. I explore some of the salient features of the optimal boarding method and discuss practical modifications to the optimal. Finally, I mention some of the benefits that could come from implementing an improved passenger boarding scheme.