Loading...

A new linear programming approach and genetic algorithm for solving airline boarding problem

Soolaki, M ; Sharif University of Technology

653 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.apm.2011.11.030
  3. Abstract:
  4. The airline industry is under intense competition to simultaneously increase efficiency and satisfaction for passengers and profitability and internal system benefit for itself. The boarding process is one way to achieve these objectives as it tends itself to adaptive changes. In order to increase the flying time of a plane, commercial airlines try to minimize the boarding time, which is one of the most lengthy parts of a plane's turn time. To reduce boarding time, it is thus necessary to minimize the number of interferences between passengers by controlling the order in which they get onto the plane through a boarding policy. Here, we determine the passenger boarding problem and examine the different kinds of passenger boarding strategies and boarding interferences in a single aisle aircraft. We offer a new integer linear programming approach to reduce the passenger boarding time. A genetic algorithm is used to solve this problem. Numerical results show effectiveness of the proposed algorithm
  5. Keywords:
  6. Boarding strategy ; Genetic algorithm ; Mixed integer linear programming ; OR in airlines ; Transportation ; A-plane ; Airline industry ; Commercial airlines ; Flying time ; Integer Linear Programming ; Internal systems ; Numerical results ; Single aisle aircrafts ; Air transportation ; Genetic algorithms ; Interference suppression ; Profitability ; Problem solving
  7. Source: Applied Mathematical Modelling ; Volume 36, Issue 9 , 2012 , Pages 4060-4072 ; 0307904X (ISSN)
  8. URL: http://www.sciencedirect.com/science/article/pii/S0307904X11007189