A heuristic method for solving airline crew pairing problems
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 pro...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2018-01-01
|
| Series: | MATEC Web of Conferences |
| Online Access: | https://doi.org/10.1051/matecconf/201820402006 |
| _version_ | 1829138880431915008 |
|---|---|
| author | Novianingsih Khusnul Hadianti Rieske |
| author_facet | Novianingsih Khusnul Hadianti Rieske |
| author_sort | Novianingsih Khusnul |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-14T19:25:30Z |
| format | Article |
| id | doaj.art-d97c49e838a64533b85c48188bbeed99 |
| institution | Directory Open Access Journal |
| issn | 2261-236X |
| language | English |
| last_indexed | 2024-12-14T19:25:30Z |
| publishDate | 2018-01-01 |
| publisher | EDP Sciences |
| record_format | Article |
| series | MATEC Web of Conferences |
| spelling | doaj.art-d97c49e838a64533b85c48188bbeed992022-12-21T22:50:12ZengEDP SciencesMATEC Web of Conferences2261-236X2018-01-012040200610.1051/matecconf/201820402006matecconf_imiec2018_02006A heuristic method for solving airline crew pairing problemsNovianingsih KhusnulHadianti RieskeThe 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.https://doi.org/10.1051/matecconf/201820402006 |
| spellingShingle | Novianingsih Khusnul Hadianti Rieske A heuristic method for solving airline crew pairing problems MATEC Web of Conferences |
| title | A heuristic method for solving airline crew pairing problems |
| title_full | A heuristic method for solving airline crew pairing problems |
| title_fullStr | A heuristic method for solving airline crew pairing problems |
| title_full_unstemmed | A heuristic method for solving airline crew pairing problems |
| title_short | A heuristic method for solving airline crew pairing problems |
| title_sort | heuristic method for solving airline crew pairing problems |
| url | https://doi.org/10.1051/matecconf/201820402006 |
| work_keys_str_mv | AT novianingsihkhusnul aheuristicmethodforsolvingairlinecrewpairingproblems AT hadiantirieske aheuristicmethodforsolvingairlinecrewpairingproblems AT novianingsihkhusnul heuristicmethodforsolvingairlinecrewpairingproblems AT hadiantirieske heuristicmethodforsolvingairlinecrewpairingproblems |