A linear programming approach for optimal boarding strategy

In order to increase the flying time of a plane, commercial airlines try to minimize the boarding time. To reduce boarding time, it is thus necessary to minimize the number of interferences between passengers. Here, we offer a new mixed integer linear programming approach to reduce the passenger boarding time and, the MILP model is solved using Lingo 9 and the optimal boarding scheme is found. The model provides the flexibility to optimize the boarding times for various aircrafts with different seat capacities