Event Simulation Model for Airplane Boarding

The goal of this project was to model the airplane boarding process using discrete event simulation and petri nets to determine which algorithm for seat assignment relative to boarding position results in the lowest average time to load all passengers. The basic premise of our model is shown to the below. Customers enter from the gate into an initial queue, Q[0], at the front of the plane. From there, customers can move down the aisle such that one person will stand in between each row (Q[1], Q[2], …, Q[N]). They will continue to move from each queue to the next until they arrive at their dedicated row. They will spend a random amount of time loading their baggage and waiting for anybody sitting in between the aisle and their dedicated seat to stand up and enter the aisle. This is the only time the queue in each row will be greater than one. From there, each customer will take a random amount of time to exit the aisle and sit down.

Full video can be found here.

Team: Zach Mulder, Chris Au, Jeff Khvu, Winne Yan

Role: Team Member

Discrete Event SimulationPetri NetsEvent SimulationModelingOptimization