IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v24y1990i4p287-297.html
   My bibliography  Save this article

Airport gate position estimation for minimum total costs--Approximate closed form solution

Author

Listed:
  • Wirasinghe, S. C.
  • Bandara, S.

Abstract

A method to determine the optimum number of gate positions at an airport terminal, which minimizes the sum of the cost of gates and the cost of delays to aircraft is presented. It is based on an approximate procedure to determine the total deterministic delay to aircraft caused by a limited number of gates, given information regarding the peaking of the aircraft arrival rate, and the number of peaks per day. Closed-form solutions are obtained for the cases of one peak and several identical nonoverlapping peaks, respectively. The optimum number of gates required for the Calgary International Airport, based on a common gate use policy, is reported.

Suggested Citation

  • Wirasinghe, S. C. & Bandara, S., 1990. "Airport gate position estimation for minimum total costs--Approximate closed form solution," Transportation Research Part B: Methodological, Elsevier, vol. 24(4), pages 287-297, August.
    • Handle: RePEc:eee:transb:v:24:y:1990:i:4:p:287-297
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(90)90003-H
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    Citations

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


    Cited by:

    1. 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.
    2. Schwarz, Justus Arne & Selinka, Gregor & Stolletz, Raik, 2016. "Performance analysis of time-dependent queueing systems: Survey and classification," Omega, Elsevier, vol. 63(C), pages 170-189.
    3. H Ding & A Lim & B Rodrigues & Y Zhu, 2004. "New heuristics for over-constrained flight to gate assignments," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 760-768, July.
    4. 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.
    5. 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.
    6. 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).
    7. 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.
    8. Zhang, Dong & Klabjan, Diego, 2017. "Optimization for gate re-assignment," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 260-284.
    9. Solak, Senay & Clarke, John-Paul B. & Johnson, Ellis L., 2009. "Airport terminal capacity planning," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 659-676, July.
    10. Bolat, Ahmet, 2000. "Procedures for providing robust gate assignments for arriving aircrafts," European Journal of Operational Research, Elsevier, vol. 120(1), pages 63-80, January.
    11. Tam, Mei Ling, 2011. "An optimization model for wayfinding problems in terminal building," Journal of Air Transport Management, Elsevier, vol. 17(2), pages 74-79.

    More about this item

    Statistics

    Access and download statistics

    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:transb:v:24:y:1990:i:4:p:287-297. 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.

    We have no bibliographic references for this item. You can help adding them by using 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/548/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.