Communications for Statistical Applications and Methods

  • 제18권2호
  • /
  • Pages.257-266
  • /
  • 2011
  • /
  • 2287-7843(pISSN)
  • /
  • 2383-4757(eISSN)
한국통계학회 (The Korean Statistical Society)
권호 표지
DOI QR코드

DOI QR Code

An Airline Scheduling Model and Solution Algorithms

  • 투고 : 20100900
  • 심사 : 20110100
  • 발행 : 2011.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

The rapid development of airlines, has made airports busier and more complicated. The assignment of scheduled to available gates is a major issue for daily airline operations. We consider the over-constrained airport gate assignment problem(AGAP) where the number of flights exceeds the number of available gates, and where the objectives are to minimize the number of ungated flights and the total walking distance or connection times. The procedures used in this project are to create a mathematical model formulation to identify decision variables to identify, constraints and objective functions. In addition, we will consider in the AGAP the size of each gate in the terminal and also the towing process for the aircraft. We will use a greedy algorithm to solve the problem. The greedy algorithm minimizes ungated flights while providing initial feasible solutions that allow flexibility in seeking good solutions, especially in case when flight schedules are dense in time. Experiments conducts give good results.

키워드

참고문헌

  1. Al-Sultan, A. T., Ishioka, F. and Kurihara, K. (2010). Optimizing gate assignments at airport terminal, JKSC 2010 Joint Meeting of Japan - Korea Special Conference of Statistics and the 2nd Japan - Korea Statistics Conference of Young Researchers, 159–166.
  2. Babica, O., Teodorovic, D. and Tosic, V. (1984). Aircraft stand assignment to minimize walking, Journal of Transportation Engineering, 110, 55–66. https://doi.org/10.1061/(ASCE)0733-947X(1984)110:1(55)(12pages)
  3. Braaksma, J. and Shortreeda, J. (1971). Improving airport gate usage with critical path method, Transportation Engineering Journal of ASCE 97, 187–203.
  4. Cheng, Y. (1998a). Arule-based reactive model for the simulation of aircraft on airport gates, Knowle dge-Based Systems, 10, 225–236.
  5. Cheng, Y. (1998b). Network-based simulation of aircraft at gates in airport terminals, Journal of Transportation Engineering, 188–196. https://doi.org/10.1061/(ASCE)0733-947X(1998)124:2(188)(9pages)
  6. Ding, H., Lim, A., Rodrigues, B. and Zhu, Y. (2004). Aircraft and gate scheduling optimization at airports, 37th Hawaii International Conference on System Sciences, 3, 30074b. https://doi.org/10.1109/HICSS.2004.1265219
  7. Haghnani, A. and Chen, M. C. (1998). Optimizing gate assignments at airport terminals, Transportation Research Part A: Policy and Practice, 32, 437–454.
  8. Obata, T. (1979). The quadratic assignment problem: Evaluation of exact and heuristic algorithms, Tech. Report TRS- 7901, Rensselaer Polytechnic Institute, Troy, New York.
  9. Xu, J. and Bailey, G. (2001). The airport gate assignment problem: Mathematical model and a Tabu search algorithm, 34th Hawaii International Conference on System Sciences, 3, 3032. https://doi.org/10.1109/HICSS.2001.926327
  10. Yan, S. and Chang, C. M. (1998). A network model for gate assignment, Journal of advanced Transportation, 32, 176–189. https://doi.org/10.1002/atr.5670320204
  11. Yan, S. and Huo, C. M. (2001). Optimization of multiple objective gate assignments, Transportation Research Part A: Policy and Practice, 35, 413–432. https://doi.org/10.1016/S0965-8564(99)00065-8
  12. Yan, S., Tang, C. H. and Fu, T. C. (2008). An airline scheduling model and solution algorithms under stochastic demands, European Journal of Operational Research, 190, 22–39. https://doi.org/10.1016/j.ejor.2007.05.053