A new linear programming approach and genetic algorithm for solving airline boarding problem |
| |
Authors: | Majid Soolaki Iraj Mahdavi Nezam Mahdavi-Amiri Reza Hassanzadeh Aydin Aghajani |
| |
Affiliation: | 1. Department of Industrial Engineering, Mazandaran University of Science and Technology, Tabarsi Street, Babol 47166-95635, Iran;2. Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran;3. Department of Industrial Engineering, Allameh Mohaddes Noori Institute, Noor, Iran |
| |
Abstract: | 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. |
| |
Keywords: | OR in airlines Mixed integer linear programming Transportation Boarding strategy Genetic algorithm |
本文献已被 ScienceDirect 等数据库收录! |
|