| Issue |
MATEC Web Conf.
Volume 204, 2018
International Mechanical and Industrial Engineering Conference 2018 (IMIEC 2018)
|
|
|---|---|---|
| Article Number | 02006 | |
| Number of page(s) | 7 | |
| Section | Optimization | |
| DOI | https://doi.org/10.1051/matecconf/201820402006 | |
| Published online | 21 September 2018 | |
A heuristic method for solving airline crew pairing problems
1
Department of Mathematics Education, Universitas Pendidikan Indonesia, 40154 Bandung, Indonesia
2
Department of Mathematics, Institut Teknologi Bandung, 40132 Bandung, Indonesia
*
Corresponding author: k_novianingsih@upi.edu
The airline crew pairing problem is one of the optimization problems which classified as a NP-hard problem. Since the number of feasible pairings in flight schedules can be numerous, the exact methods will not efficient to solve the problem. We propose a heuristic method for solving crew pairing problems. Initially, we generate a feasible solution by maximizing the covered flights. Then, we improve the solution by constructing a procedure to avoid the local optimal solution. We test our method to an airline schedules. The computational results show that our method can give the optimal solution in short period of time.
© The Authors, published by EDP Sciences, 2018
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.