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

Evaluation of the airport ferry vehicle scheduling based on network maximum flow model

Author

Listed:
  • Zhao, Peixin
  • Han, Xue
  • Wan, Di

Abstract

With the rapid development of the civil aviation industry, airport ground support vehicles are increasingly becoming a scarce resource. Among them, the ferry vehicle resource is one of the important factors that restrict the flight service quality of airports. In this paper, the optimal scheduling of ferry vehicles in flight ground support service is studied, and an integer programming model is constructed based on the objective of minimizing the number of ferry vehicles required during peak hours or a certain period of time. In order to solve the model, we construct a graph by having the service demand of the flight as the node, and the connecting edges represent that the two service demands can be served by the same ferry vehicle. By introducing virtual flights, the ferry vehicle-sharing network is constructed innovatively, transforming the model into a network maximum flow problem. The efficiency and accuracy of the method are validated by the flight data from Beijing Capital International Airport. This method provides a decision-making reference for the ground service department of airports to evaluate the ferry vehicle scheduling.

Suggested Citation

  • Zhao, Peixin & Han, Xue & Wan, Di, 2021. "Evaluation of the airport ferry vehicle scheduling based on network maximum flow model," Omega, Elsevier, vol. 99(C).
    • Handle: RePEc:eee:jomega:v:99:y:2021:i:c:s0305048318314798
    DOI: 10.1016/j.omega.2019.102178
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048318314798
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2019.102178?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. A Norin & D Yuan & T A Granberg & P V&aauml;rbrand, 2012. "Scheduling de-icing vehicles within airport logistics: a heuristic algorithm and performance evaluation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(8), pages 1116-1125, August.
    2. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2012. "Flight gate scheduling with respect to a reference schedule," Annals of Operations Research, Springer, vol. 194(1), pages 177-187, April.
    3. Weiszer, Michal & Chen, Jun & Locatelli, Giorgio, 2015. "An integrated optimisation approach to airport ground operations to foster sustainability in the aviation sector," Applied Energy, Elsevier, vol. 157(C), pages 567-582.
    4. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2008. "Modelling Robust Flight-Gate Scheduling as a Clique Partitioning Problem," Transportation Science, INFORMS, vol. 42(3), pages 292-301, August.
    5. Du, Jia Yan & Brunner, Jens O. & Kolisch, Rainer, 2014. "Planning towing processes at airports more efficiently," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 293-304.
    6. 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.
    7. Narciso, Mercedes E. & Piera, Miquel A., 2015. "Robust gate assignment procedures from an airport management perspective," Omega, Elsevier, vol. 50(C), pages 82-95.
    8. M. M. Vazifeh & P. Santi & G. Resta & S. H. Strogatz & C. Ratti, 2018. "Addressing the minimum fleet problem in on-demand urban mobility," Nature, Nature, vol. 557(7706), pages 534-538, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Trust Tawanda & Philimon Nyamugure & Santosh Kumar & Elias Munapo, 2023. "An intelligent node labelling maximum flow algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 14(4), pages 1276-1284, August.
    2. Yagmur S. Gök & Silvia Padrón & Maurizio Tomasella & Daniel Guimarans & Cemalettin Ozturk, 2023. "Constraint-based robust planning and scheduling of airport apron operations through simheuristics," Annals of Operations Research, Springer, vol. 320(2), pages 795-830, January.
    3. Han, Xue & Zhao, Peixin & Kong, Dexin, 2023. "Two-stage optimization of airport ferry service delay considering flight uncertainty," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1103-1116.
    4. Xu, Guoning & Lin, Yupeng & Wu, Zhiying & Chen, Qingxin & Mao, Ning, 2023. "Research on the scheduling method of ground resource under uncertain arrival time," Operations Research Perspectives, Elsevier, vol. 11(C).

    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. Xue Han & Peixin Zhao & Qingchun Meng & Shengnan Yin & Di Wan, 2020. "Optimal scheduling of airport ferry vehicles based on capacity network," Annals of Operations Research, Springer, vol. 295(1), pages 163-182, December.
    2. Hagspihl, Thomas & Kolisch, Rainer & Fontaine, Pirmin & Schiffels, Sebastian, 2024. "Apron layout planning–Optimal positioning of aircraft stands," Transportation Research Part B: Methodological, Elsevier, vol. 179(C).
    3. Zhang, Dong & Klabjan, Diego, 2017. "Optimization for gate re-assignment," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 260-284.
    4. Silvia Padrón & Daniel Guimarans, 2019. "An Improved Method for Scheduling Aircraft Ground Handling Operations From a Global Perspective," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(04), pages 1-25, August.
    5. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2017. "Flight gate assignment and recovery strategies with stochastic arrival and departure times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 65-93, January.
    6. Han, Xue & Zhao, Peixin & Kong, Dexin, 2023. "Two-stage optimization of airport ferry service delay considering flight uncertainty," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1103-1116.
    7. 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.
    8. 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).
    9. Hutter, Leonie & Jaehn, Florian & Neumann, Simone, 2019. "Influencing factors on airplane boarding times," Omega, Elsevier, vol. 87(C), pages 177-190.
    10. Bert Dijk & Bruno F. Santos & Joao P. Pita, 2019. "The recoverable robust stand allocation problem: a GRU airport case study," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(3), pages 615-639, September.
    11. Alonso Tabares, Diego & Mora-Camino, Felix & Drouin, Antoine, 2021. "A multi-time scale management structure for airport ground handling automation," Journal of Air Transport Management, Elsevier, vol. 90(C).
    12. Jaehn, Florian & Neumann, Simone, 2015. "Airplane boarding," European Journal of Operational Research, Elsevier, vol. 244(2), pages 339-359.
    13. Jovanovic, Raka & Sanfilippo, Antonio P. & Voß, Stefan, 2023. "Fixed set search applied to the clique partitioning problem," European Journal of Operational Research, Elsevier, vol. 309(1), pages 65-81.
    14. Hagspihl, Thomas & Kolisch, Rainer & Ruf, Christian & Schiffels, Sebastian, 2022. "Dynamic gate configurations at airports: A network optimization approach," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1133-1148.
    15. Karsu, Özlem & Azizoğlu, Meral & Alanlı, Kerem, 2021. "Exact and heuristic solution approaches for the airport gate assignment problem," Omega, Elsevier, vol. 103(C).
    16. Skorupski, Jacek & Żarów, Piotr, 2021. "Dynamic management of aircraft stand allocation," Journal of Air Transport Management, Elsevier, vol. 90(C).
    17. 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).
    18. 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.
    19. Yin, Suwan & Han, Ke & Ochieng, Washington Yotto & Sanchez, Daniel Regueiro, 2022. "Joint apron-runway assignment for airport surface operations," Transportation Research Part B: Methodological, Elsevier, vol. 156(C), pages 76-100.
    20. Konstantinos G. Zografos & Michael A. Madas & Konstantinos N. Androutsopoulos, 2017. "Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs," Journal of Scheduling, Springer, vol. 20(1), pages 3-24, February.

    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:jomega:v:99:y:2021:i:c:s0305048318314798. 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.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.