IDEAS home Printed from https://ideas.repec.org/a/eee/jaitra/v86y2020ics0969699718304216.html
   My bibliography  Save this article

Optimizing flight equencing and gate assignment considering terminal configuration and walking time

Author

Listed:
  • Xiao, Mei
  • Chien, Steven
  • Schonfeld, Paul
  • Hu, Dawei

Abstract

Operating airline hub-and-spoke networks (HSN) rather than direct flights among city pairs may significantly reduce supplier cost; however, passengers' travel time may significantly increase due to increased transfer and in-flight time. The costs considered in this study are hub-related and incurred by passengers and aircraft (i.e., passenger transfer, flight dwelling, and gate occupancy). The objective is to minimize the total cost by optimizing flight sequence (i.e., arrivals and departures) and gate assignment, while considering transfer speed, transfer demand, flight size, gate size and terminal configuration. A real-world HSN whose hub airport (HA) is located at Xianyang International Airport (XIY) in Xi'an, China is analyzed. The optimized solutions and their relations to various model parameters are explored.

Suggested Citation

  • Xiao, Mei & Chien, Steven & Schonfeld, Paul & Hu, Dawei, 2020. "Optimizing flight equencing and gate assignment considering terminal configuration and walking time," Journal of Air Transport Management, Elsevier, vol. 86(C).
    • Handle: RePEc:eee:jaitra:v:86:y:2020:i:c:s0969699718304216
    DOI: 10.1016/j.jairtraman.2020.101816
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0969699718304216
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jairtraman.2020.101816?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jamili, Amin, 2017. "A robust mathematical model and heuristic algorithms for integrated aircraft routing and scheduling, with consideration of fleet assignment problem," Journal of Air Transport Management, Elsevier, vol. 58(C), pages 21-30.
    2. Harilaos N. Psaraftis, 1980. "A Dynamic Programming Approach for Sequencing Groups of Identical Jobs," Operations Research, INFORMS, vol. 28(6), pages 1347-1359, December.
    3. Serhan, Duaa & Lee, Hanbong & Yoon, Sang Won, 2018. "Minimizing airline and passenger delay cost in airport surface and terminal airspace operations," Journal of Air Transport Management, Elsevier, vol. 73(C), pages 120-133.
    4. Souai, Nadia & Teghem, Jacques, 2009. "Genetic algorithm based approach for the integrated airline crew-pairing and rostering problem," European Journal of Operational Research, Elsevier, vol. 199(3), pages 674-683, December.
    5. Pternea, Moschoula & Haghani, Ali, 2019. "An aircraft-to-gate reassignment framework for dealing with schedule disruptions," Journal of Air Transport Management, Elsevier, vol. 78(C), pages 116-132.
    6. Yan, Shangyao & Huo, Cheun-Ming, 2001. "Optimization of multiple objective gate assignments," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(5), pages 413-432, June.
    7. Haghani, Ali & Chen, Min-Ching, 1998. "Optimizing gate assignments at airport terminals," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(6), pages 437-454, August.
    8. Munari, Pedro & Alvarez, Aldair, 2019. "Aircraft routing for on-demand air transportation with service upgrade and maintenance events: Compact model and case study," Journal of Air Transport Management, Elsevier, vol. 75(C), pages 75-84.
    9. de Barros, Alexandre G. & Wirasinghe, S. C., 2003. "Optimal terminal configurations for new large aircraft operations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(4), pages 315-331, May.
    10. C. S. Venkatakrishnan & Arnold Barnett & Amedeo R. Odoni, 1993. "Landings at Logan Airport: Describing and Increasing Airport Capacity," Transportation Science, INFORMS, vol. 27(3), pages 211-227, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ahmed Ghoniem & Hanif D. Sherali & Hojong Baik, 2014. "Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 514-530, August.
    2. A R Brentnall & R C H Cheng, 2009. "Some effects of aircraft arrival sequence algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 962-972, July.
    3. Dorndorf, Ulrich & Drexl, Andreas & Nikulin, Yury & Pesch, Erwin, 2005. "Flight gate scheduling: State-of-the-art and recent developments," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 584, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. Lieder, Alexander & Briskorn, Dirk & Stolletz, Raik, 2015. "A dynamic programming approach for the aircraft landing problem with aircraft classes," European Journal of Operational Research, Elsevier, vol. 243(1), pages 61-69.
    5. Narciso, Mercedes E. & Piera, Miquel A., 2015. "Robust gate assignment procedures from an airport management perspective," Omega, Elsevier, vol. 50(C), pages 82-95.
    6. Wen, Xin & Sun, Xuting & Ma, Hoi-Lam & Sun, Yige, 2022. "A column generation approach for operational flight scheduling and aircraft maintenance routing," Journal of Air Transport Management, Elsevier, vol. 105(C).
    7. J. E. Beasley & M. Krishnamoorthy & Y. M. Sharaiha & D. Abramson, 2000. "Scheduling Aircraft Landings—The Static Case," Transportation Science, INFORMS, vol. 34(2), pages 180-197, May.
    8. Xu, Liang & Zhang, Chao & Xiao, Feng & Wang, Fan, 2017. "A robust approach to airport gate assignment with a solution-dependent uncertainty budget," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 458-478.
    9. Daş, Gülesin Sena & Gzara, Fatma & Stützle, Thomas, 2020. "A review on airport gate assignment problems: Single versus multi objective approaches," Omega, Elsevier, vol. 92(C).
    10. J E Beasley & M Krishnamoorthy & Y M Sharaiha & D Abramson, 2004. "Displacement problem and dynamically scheduling aircraft landings," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(1), pages 54-64, January.
    11. Karsu, Özlem & Azizoğlu, Meral & Alanlı, Kerem, 2021. "Exact and heuristic solution approaches for the airport gate assignment problem," Omega, Elsevier, vol. 103(C).
    12. Yan, Shangyao & Tang, Ching-Hui, 2007. "A heuristic approach for airport gate assignments for stochastic flight delays," European Journal of Operational Research, Elsevier, vol. 180(2), pages 547-567, July.
    13. Skorupski, Jacek & Żarów, Piotr, 2021. "Dynamic management of aircraft stand allocation," Journal of Air Transport Management, Elsevier, vol. 90(C).
    14. Li, Mingjie & Hao, Jin-Kao & Wu, Qinghua, 2022. "Learning-driven feasible and infeasible tabu search for airport gate assignment," European Journal of Operational Research, Elsevier, vol. 302(1), pages 172-186.
    15. Chen, Shuiwang & Wu, Lingxiao & Ng, Kam K.H. & Liu, Wei & Wang, Kun, 2024. "How airports enhance the environmental sustainability of operations: A critical review from the perspective of Operations Research," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    16. Yan, Shangyao & Shieh, Chi-Yuan & Chen, Miawjane, 2002. "A simulation framework for evaluating airport gate assignments," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(10), pages 885-898, December.
    17. Guépet, J. & Acuna-Agost, R. & Briant, O. & Gayon, J.P., 2015. "Exact and heuristic approaches to the airport stand allocation problem," European Journal of Operational Research, Elsevier, vol. 246(2), pages 597-608.
    18. Dorndorf, Ulrich & Drexl, Andreas & Nikulin, Yury & Pesch, Erwin, 2007. "Flight gate scheduling: State-of-the-art and recent developments," Omega, Elsevier, vol. 35(3), pages 326-334, June.
    19. Zhang, Dong & Klabjan, Diego, 2017. "Optimization for gate re-assignment," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 260-284.
    20. Khaled, Oumaima & Minoux, Michel & Mousseau, Vincent & Michel, Stéphane & Ceugniet, Xavier, 2018. "A multi-criteria repair/recovery framework for the tail assignment problem in airlines," Journal of Air Transport Management, Elsevier, vol. 68(C), pages 137-151.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jaitra:v:86:y:2020:i:c:s0969699718304216. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/journal-of-air-transport-management/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.