Communications - Scientific Letters of the University of Zilina 2016, 18(3):22-27 | DOI: 10.26552/com.C.2016.3.22-27

Mathematical Model for Charter Flights Planning at Airports with High Air Traffic Volume

Vojtech Graf1, Dusan Teichmann1, Michal Dorda1
1 Institute of Transport, Faculty of Mechanical Engineering, VSB - Technical University of Ostrava, Ostrava-Poruba, Czech Republic

The article is devoted to a problem of flight timetable planning for charter airlines if air transport is operated at airports with high air traffic volume. It is typical for such airports that air transport is subject to time slots. That means aircraft can take-off or land only in given time intervals. A suitable tool for solving such type of the task is linear programming which has been successfully employed for planning in other transport systems. In the article a mathematical model which is able to plan a flight timetable for a given set of flights is presented.

Keywords: aircraft scheduling; linear programming; timetable planning

Published: September 30, 2016  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Graf, V., Teichmann, D., & Dorda, M. (2016). Mathematical Model for Charter Flights Planning at Airports with High Air Traffic Volume. Communications - Scientific Letters of the University of Zilina, 18(3), 22-27. doi: 10.26552/com.C.2016.3.22-27
Share...
Download citation
  • BibTeX (.bib)
  • Bookends (.ris)
  • EasyBib (.ris)
  • EndNote (.enw)
  • EndNote 8 (.xml)
  • ISI WoS (.isi)
  • Medlars (.medlars)
  • Mendeley (.ris)
  • MODS (.xml)
  • Papers (.ris)
  • RefWorks (.txt)
  • RefManager (.ris)
  • RIS (.ris)
  • MS Word (.xml)
  • Zotero (.ris)
    • Open full article

    References

    1. GRAF, V., TEICHMANN, D., DORDA, M.: Mathematical Model of Charter Flight Scheduling with Predefined Time Slots. Proc. of international conference Aplimat, February 2016, Bratislava, pp. 417-423, ISBN 978-80-4531-4.
    2. DOZIC, S., KALIC, M., BABIC, O.: Heuristic Approach to the Airline Schedule Disturbances Problem: Single Fleet Case. Social and Behavioral Science, vol. 54, 2012, pp. 1232-1241. Go to original source...
    3. BASDERE, M., BILGE, U.: Operational Aircraft Maintenance Routing Problem with Remaining Time Consideration. European J. of Operational Research, vol. 235, 2014, pp. 315-328. Go to original source...
    4. LAGERHOLM, M., PETERSON, C., SODERBERG, B.: Airline Crew Scheduling Using Potts Mean Field Techniques. European J. of Operational Research, vol. 120, 2000, pp. 81-96. Go to original source...
    5. JANACEK, J., MARTON, P., KONIORCZYK, M.: The Column Generation and Train Crew Scheduling. Communications - Science Letters of the University of Zilina, vol. 17, No. 1a, 2016, pp. 21-27. Go to original source...
    6. BARNHART, C., BELOBABA, P., ODONI, A. R.: Applications of Operations Research in the Air Transport Industry. Transportation Science, vol. 37, No. 4, 2003, pp. 368-391. Go to original source...
    7. DIAZ-RAMIREZ, J., HUERTAS, J. I., TRIGOS, F.: Aircraft Maintenance, Routing and Crew Scheduling Planning for Airlines with a Single Fleet and a Single Maintenance and Crew Base. Computers & Industrial Engineering, vol. 75, 2014, pp. 68-78. Go to original source...
    8. MERCIER, A., SOUMIS, F.: An Integrated Aircraft Routing, Crew Scheduling and Flight Retiming Model. Computers & Operations Research, vol. 34, 2007, p. 2251-2265. Go to original source...
    9. KERNER, L., KULCAK, L., SYKORA, V.: Operational Aspects of Airports (in Czech), Praha : CVUT, 2003, 270 p., ISBN 80-01-02841-0.
    10. FAIR ISAAC CORPORATIN, [online], ©2014 [11-2-2016]. http://www.fico.com/en/products/fico-xpress-optimization-suite/.

    This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.


    Return to the content