Buradasınız

Anasayfa » Content

BÜTÜNLEŞİK UÇAK ROTALAMA VE BAKIM ÇİZELGELEME

CONCURRENT AIRCRAFT ROUTING AND MAINTENANCE SCHEDULING

Journal Name:

  • Havacılık ve Uzay Teknolojileri Dergisi

Publication Year:

  • 2011

Key Words:

Keywords (Original Language):

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
The aircraft routing is the process of assigning each individual aircraft within each fleet to flight legs. The Federal Aviation Rules require the maintenance of all the aircrafts after specified hours of period as mandatory. The minimum total maintenance cost is provided as a result of the lost flight time which is brought to minimum. The common policies in this business sector follow the practices the maintenance of an aircraft once in 3-4 days periodically. This policy minimizes the risk of grounding of aircraft in the cost of the lost flight hours. In this study, we propose a concurrent, mathematical modeling approach for daily flight route and maintenance scheduling based on recorded flight hours. The model has been solved using CPLEX/GAMS MILP Software. The proposed approach was applied to the daily flight route-maintenance schedule problems of the domestic flights of two companies.
Bookmark/Search this post with
Abstract (Original Language): 
Uçak rotalama, her bir filo içerisindeki her uçağın uçuş bacaklarına atanma sürecidir. Ulusal Havacılık Kuralları, belli bir uçuş saatinden sonra bütün uçaklara zorunlu olarak bakım uygulanmasını gerektirir. En düşük toplam bakım maliyeti, kullanılamayan uçuş zamanı en küçüğe getirilmesiyle sağlanır. Havacılık sektöründe izlenen genel politika her 3-4 günde periyodik olarak uçaklara bakım uygulamaktır. Bu politika, kayıp uçuş saati maliyetinde uçakların yerde kalma riskini en küçüklemektedir. Bu çalışmada, uçuş saatleri temel alınarak günlük uçuş ve rota çizelgeleme için bütünleşik matematiksel modelleme yaklaşımı önerilmiştir. Model, CPLEX/GAMS MILP yazılımı kullanılarak çözülmüştür. Önerilen yaklaşım iç hat uçuş gerçekleştiren iki şirketin günlük uçuş rota bakım çizelgeleme problemlerine uygulanmıştır.
FULL TEXT (PDF): 
PDF icon arastirmax-butunlesik-ucak-rotalama-bakim-cizelgeleme.pdf
  • 1
73
79
  • Turkish

REFERENCES

References: 

[1] IATA, “IATA 2008 Annual Report”,
International Air Transport Association, 2008.
[2] Airbus, “Airbus Global Market Forecast 2009-
2028”: Airbus, 2009.
[3] http://www.unece.org/trans/doc/transsitdocs/20
08turkey.pdf
[4] http://www.radikal.com.tr/haber.php?haberno=
215701&
[5] http://www.defencetalk.com/boeing-supportsand-
celebrates-growth-in-the-turkish-aviation-market-
15522
[6] Kinnison, H. A., “Aviation Maintenance
Management”, McGraw-Hill, New-York, 2004.
[7] Orhan, I., Kapanoglu, M., Karakoc, T.H. 2007,
“Flight-Hour Based Optimization for Aircraft
Scheduling”, INFORMS, 369, WD43, A.B.D.
Concurrent Aircraft Routing and Maintenance Scheduling
ORHAN, KAPANOGLU, KARAKOC
79
[8] Orhan, I., Kapanoglu, M., Karakoc, T.H., 2010,
“Planning And Scheduling Of Airline Operations”,
Pamukkale University Journal of Engineering
Sciences, 16(2), 181-191, 2010.
[9] Boeing, “Section 1-System Maintenance
Program, 737-600/700/800/900 Maintenance Planning
Document” . s.1.0-5, 2005.
[10] Clarke, L.W., Johnson, E.L., Nemhauser, G.L.,
Zhu Z., “The Aircraft Rotation Problem”, Annals of
Operations Research, 69, 33-46, 1997.
[11] Gopalan, R., K. Talluri, “The Aircraft
Maintenance Routing Problem”, Operations Research,
46, 260–271, 1998.
[12] Radnoti, G., “Profit Strategies for Air
Transportation”, McGraw-Hill, New York, 2002.
[13] Daskin, M.S. and Panayotopoulos N.C., “A
Lagrangian Relaxation Approach to Assigning
Aircraft to routes in Hub and Spoke Networks”,
Transportation Science, 23(2), 91-99, 1989.
[14] Feo, T.A., Bard J. F., “Flight Scheduling and
Maintenance Base Planning”, Management Science,
35, 1415-1432, 1989.
[15] Kabbani, N.M. and Patty B.W., “Aircraft
Routing at American Airlines”, Proceedings of the
Thirty-Second Annual Symposium of the Airline
Group of the International Federation of Operational
Research Societies, Budapest, Hungary, 1992.
[16] Hane, C.A., Barnhart, C., Johnson E.L.,
Marsten R.E., Nemhauser G.L., Sigismindi G., “The
Fleet Assignment Problem: Solving A Large Scale
Integer Program”, Mathematical Programming, 70,
211-232, 1995.
[17] Clarke, L.W., Hane, C.A., Johnson, E.L.,
Nemhauser, G.L., “Maintenance and Crew
Considerations in Fleet Assignment”, Transportation
Science, 30, 249–261, 1996.,
[18] Desauliniers, G., Desrosiers, J., Dumas, Y.,
“Daily Aircraft Routing and Scheduling”,
Management Science, 43, 841-855, 1997.
[19] Barnhart, C., Boland, N.L., Clarke L.W.,
Johnson E.L., Nemhauser, G.L., “Flight String Models
for Aircraft Fleeting and Routing”, Transportation
Science, 32(3), 208-220, 1998.
[20] Cordeau, J.F., Stojkovi´c, G., Soumis F.,
Desrosiers, J., “Benders Decomposition for
Simultaneous Aircraft Routing and Crew Scheduling”,
Transportation Science, 35, 375–388, 2001.
[21] Sriram, C. and Haghani, A., “An Optimization
Model for Aircraft Maintenance Scheduling and
Re-Assignment”, Transportation Science, 37, 29-48,
2003.
[22] Sarac, A., Batta, R., Rump, C.M., A Branchand-
Price Approach For Operational Aircraft
Maintenance Routing”, European Journal of
Operational Research, 175, 1850-1869, 2006.
[23] Ahuja, R.K., Goodstein, J., Mukherjee, A.,
Orlin, J.B., Sharma, D., “A Very Large-Scale
Neighborhood Search Algorithm for the Combined
Through and Fleet Assignment Model”, Working
paper.4388-01, MIT Sloan School of Management,
2001.

Thank you for copying data from http://www.arastirmax.com