IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v81y1998i0p271-28810.1023-a1018909224543.html
   My bibliography  Save this article

Solving the multi-airport Ground Holding Problem

Author

Listed:
  • Lorenzo Brunetta
  • Guglielmo Guastalla
  • Lisa Navazio

Abstract

The increasing demand for air traffic in the last years has led to a heavier use of airportsand airways, while their capacities have not grown accordingly. The main drawback of thisphenomenon is a situation of congestion in air traffic networks that produces departure delaysand queues before landing, causes large losses to air companies and affects air traffic safety.A way of reducing congestion is to adopt a Ground Holding policy, i.e., to hold on theground a limited number of flights before departure in order to avoid as much as possibleairborne delay. The Ground Holding Problem (GHP) is that of determining a way of distributingdelays to the flights in such a way as to minimize the overall cost of the delays (bothon the ground and in the air). The importance of Ground Holding policies is well recognizedand optimization models have been proposed: unfortunately, it is very difficult to have real,or -even realistic-, GHP instances to evaluate the quality of one procedure over the others.Given this lack of GHP instances, in this paper we introduce 32 new test cases, up to 5000flights on a network of 10 airports, in which congestion is caused by insufficient capacity inarrival airports. These instances (made accessible via ftp) are solved to computationallycompare a new heuristic algorithm with both a previous heuristic and an exact algorithm.The new algorithm we propose is based on -priority rules-, where the flight priority iscomputed as a cost function. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Lorenzo Brunetta & Guglielmo Guastalla & Lisa Navazio, 1998. "Solving the multi-airport Ground Holding Problem," Annals of Operations Research, Springer, vol. 81(0), pages 271-288, June.
  • Handle: RePEc:spr:annopr:v:81:y:1998:i:0:p:271-288:10.1023/a:1018909224543
    DOI: 10.1023/A:1018909224543
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018909224543
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1023/A:1018909224543?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.

    Citations

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


    Cited by:

    1. Giovanni Andreatta & Lorenzo Brunetta & Guglielmo Guastalla, 2000. "From Ground Holding to Free Flight: An Exact Approach," Transportation Science, INFORMS, vol. 34(4), pages 394-401, November.
    2. Rossi, Fabrizio & Smriglio, Stefano, 2001. "A set packing model for the ground holding problem in congested networks," European Journal of Operational Research, Elsevier, vol. 131(2), pages 400-416, June.
    3. Sadeque Hamdan & Oualid Jouini & Ali Cheaitou & Zied Jemai & Tobias Andersson Granberg, 2023. "On the binary formulation of air traffic flow management problems," Annals of Operations Research, Springer, vol. 321(1), pages 267-279, February.
    4. Woo, Young-Bin & Moon, Ilkyeong, 2021. "Scenario-based stochastic programming for an airline-driven flight rescheduling problem under ground delay programs," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).

    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:spr:annopr:v:81:y:1998:i:0:p:271-288:10.1023/a:1018909224543. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.