Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Tail assignment problem with hour-to-cycle ratio constraints
Date
2025-04-01
Author
Aydoğan, Çiya
Gürel, Sinan
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
21
views
0
downloads
Cite This
Effective management of hour-to-cycle performance is crucial for any aircraft operating under an operating lease contract. This protects an airline from incurring supplemental rental payments that arise from leasing contract terms. One way of managing accumulated flight hours and flight cycles on aircraft is integrating related performance measures in the tail assignment decisions. This study introduces the tail assignment problem (TAP) considering aircraft's hour-to-cycle ratio performance. We introduce a novel TAP formulation explicitly incorporating aircraft hour-to-cycle ratio constraints, which are typically overlooked in traditional models. Our numerical analysis demonstrates that overlooking the hour-to-cycle performance of aircraft in tail assignment decisions can result in drastic deviations from target ratios. Therefore, we propose a mathematical model that includes penalty costs for violating the aircraft's target hour-to-cycle ratios. We propose one McCormick linearization and one second-order conic reformulation for the nonlinear constraints in the model. We perform computational analyses by generating problem instances derived from an actual flight schedule. Computational results show that within a given time limit the model with McCormick linearization solves more instances to optimum than the model with conic reformulation. Also, it achieves an average optimality gap of 1.62% while the average gap is 6.39% for the solutions obtained with the conic formulation.
Subject Keywords
Hour-to-cycle ratio
,
Mathematical formulations
,
Tail assignment problem
URI
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85217743707&origin=inward
https://hdl.handle.net/11511/113612
Journal
Journal of Air Transport Management
DOI
https://doi.org/10.1016/j.jairtraman.2025.102756
Collections
Department of Industrial Engineering, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Ç. Aydoğan and S. Gürel, “Tail assignment problem with hour-to-cycle ratio constraints,”
Journal of Air Transport Management
, vol. 124, pp. 0–0, 2025, Accessed: 00, 2025. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85217743707&origin=inward.