Publication:
The Integrated Aircraft Routing And Crew Pairing Problem: ILP Based Formulation

dc.contributor.authorNurul Farihan Mohameden_US
dc.contributor.authorZaitul Marlizawati Zainuddinen_US
dc.contributor.authorSaid Salhien_US
dc.contributor.authorNurul Akmal Mohameden_US
dc.date.accessioned2024-05-28T05:45:44Z
dc.date.available2024-05-28T05:45:44Z
dc.date.issued2016
dc.descriptionVolume: 78 No: 6-5: Sciences and Mathematics Part IIen_US
dc.description.abstractMinimization of cost is very important in airline as great profit is an important objective for any airline system. One way to minimize the costs in airline is by developing an integrated planning process. Airline planning consists of many difficult operational decision problems including aircraft routing and crew pairing problems. These two sub-problems, though interrelated in practice, are usually solved sequentially leading to suboptimal solutions. We propose an integrated aircraft routing and crew pairing problem model, one approach to generate the feasible aircraft routes and crew pairs, followed by three approaches to solve the integrated model. The integrated aircraft routing and crew scheduling problem is to determine a minimum cost aircraft routes and crew schedules while each flight leg is covered by one aircraft and one crew. The first approach is an integer programming solution method, the second formulation is developed in a way to lend itself to be used efficiently by Dantzig Wolfe decomposition whereas the third one is formulated as a Benders decomposition method. Encouraging results are obtained when tested on four types of aircraft based on local flights in Malaysia for one week flight cycle.en_US
dc.identifier.doi10.11113/jt.v78.9004
dc.identifier.epage85
dc.identifier.issn2180-3722
dc.identifier.issue6-5
dc.identifier.spage79
dc.identifier.urihttps://journals.utm.my/jurnalteknologi/article/view/9004/5351
dc.identifier.urihttps://oarep.usim.edu.my/handle/123456789/6394
dc.identifier.volume78
dc.language.isoen_USen_US
dc.publisherUTM Pressen_US
dc.relation.ispartofJurnal Teknologien_US
dc.subjectAircraft routing problem, crew pairing problem, integer linear programming, constructive heuristic methoden_US
dc.titleThe Integrated Aircraft Routing And Crew Pairing Problem: ILP Based Formulationen_US
dc.typeArticleen_US
dspace.entity.typePublication

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
The Integrated Aircraft Routing And Crew Pairing Problem ILP Based Formulation.pdf
Size:
366.39 KB
Format:
Adobe Portable Document Format