Publication:
Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem

Simple item page
dc.contributor.authorNurulFarihan Mohameden_US
dc.contributor.authorZaitulMarlizawati Zainuddinen_US
dc.contributor.authorSaid Salhien_US
dc.contributor.authorNurul Huda Mohameden_US
dc.contributor.authorNurulAkmal Mohameden_US
dc.date.accessioned2024-05-28T05:45:21Z
dc.date.available2024-05-28T05:45:21Z
dc.date.issued2016
dc.descriptionVolume: 9 Issue: 48en_US
dc.description.abstractTraditionally, aircraft routing and crew pairing problems are solved sequentially with the aircraft routing problem solved first followed by the crew pairing problem. But in some cases, the results are suboptimal. In order to overcome this problem, both problems will be composed in one model. Although the integration model is challenging to solve but it is practically useful in airlines operations for getting the optimal solutions. In this study, we proposed the constructive heuristic method and the genetic algorithm (GA) in producing the feasible paths. After that, we will solve those two types of feasible paths in the integrated model by using three approaches which are the integer linear programming (ILP), Dantzig Wolfe decomposition method and Benders decomposition method. Computational results show that the obtained feasible path from the constructive heuristic method and solved by the Dantzig Wolfe decomposition method is more effective while the paths from the GA and solved by the Dantzig Wolfe decomposition method is good in finding the minimum computational time. From the results obtained, all the flight legs and crew pairing are used only once. There are four type of aircrafts are used in testing the performance of the approaches which based on local flights in Malaysia for seven days. The solutions of the feasible paths from GA is more advantageous in term of the computational times compare to the solutions by using the feasible paths from constructive heuristic method.en_US
dc.identifier.doi10.17485/ijst/2016/v9i48/108696
dc.identifier.epage11
dc.identifier.issn0974-5645
dc.identifier.issue48
dc.identifier.spage1
dc.identifier.urihttps://indjst.org/articles/development-of-hybrid-algorithm-for-integrated-aircraft-routing-problem-and-crew-pairing-problem
dc.identifier.urihttps://oarep.usim.edu.my/handle/123456789/6360
dc.identifier.volume9
dc.language.isoen_USen_US
dc.publisherIndian Society for Education and Environmenten_US
dc.relation.ispartofIndian Journal of Science and Technologyen_US
dc.subjectAircraft Routing Problem, Crew Pairing Problemen_US
dc.titleDevelopment of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problemen_US
dc.typeArticleen_US
dspace.entity.typePublication

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem.pdf
Size:
380.74 KB
Format:
Adobe Portable Document Format
Download

Collections

Other Publications