Everyone knows how to board an airplane, back to front. It’s logical. Back to front means that if someone is taking their time in seat 21C the person in 20A can still seat themselves.
Physicist Jason Steffen built a computer model to see how much faster back to front was relative to front to back. He was shocked. The difference was minimal. Hmm, Steffen scowled at his code, is there a better way?
What if instead of 30 to 1 or 1 to 30, a plane boarded everyone in row 30, then rows 1, 2, 3…. That might work right? The folks in row 30 would have time to stow and seat without holding anyone up.
That kinda works. Steffen’s code continued and compared the 30, 1, 2…29 option to the 1, 2,…30 option. The code noted the faster sequence, and switched around two more numbers. Again it kept the faster option and computed another switcheroo. The fastest boarding process turned out to be boarding every other row.
“It turns the boarding process from a serial process, where one person gets to their place, puts their luggage away, and sits down into a parallel process where you send in fifteen people, say in all the even rows, and they all put their luggage away and sit down at the same time. And then you send in the next group of people.” – Jason Steffen, August 2021
Steffen’s code was a Markov Chain Monte Carlo, a way to solve problems through computer code and exploration. But like wet bias or wait times, ideal solutions may not be the best.
One problem with Steffen’s method is when people travel in groups, especially families. Another obstacle is the culture of air travel, there’s some established norms. Further confounding the case is an airline’s incentives. Faster turns do matter, but relative to upgrades how much does saving time save the company?