Comparison of two hybrid algorithms on incorporated aircraft routing and crew pairing problems

5Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

In airline operations planning, a sequential method is traditionally used in airline system. In airline systems, minimizing the costs is important as they want to get the highest profits. The aircraft routing problem is solved first, and then pursued by crew pairing problem. The solutions are suboptimal in some cases, so we incorporate aircraft routing and crew pairing problems into one mathematical model to get an exact solution. Before we solve the integrated aircraft routing and crew pairing problem, we need to get the aircraft routes (AR) and crew pairs (CP). In this study, we suggested using genetic algorithm (GA) to develop a set of AR and CP. By using the generated AR and CP, we tackle the integrated aircraft and crew pairing problems using two suggested techniques, Integer Linear Programming (ILP) and Particle Swarm Optimization (PSO). Computational results show that GA's executed of AR and CP and then solved by ILP obtained the greatest results among all the methods suggested.

Cite

CITATION STYLE

APA

Mohamed, N. F., Mohamed, N. A., Mohamed, N. H., & Subani, N. (2020). Comparison of two hybrid algorithms on incorporated aircraft routing and crew pairing problems. Indonesian Journal of Electrical Engineering and Computer Science, 18(3), 1665–1672. https://doi.org/10.11591/ijeecs.v18.i3.pp1665-1672

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free