IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v32y1998i3p268-276.html
   My bibliography  Save this article

The Multiple Connections Multi-Airport Ground Holding Problem: Models and Algorithms

Author

Listed:
  • Lisa Navazio

    (Department of Electronics and Informatics, University of Padova, via Gradenigo, 6/A-35131 Padova, Italy)

  • Giorgio Romanin-Jacur

    (Department of Electronics and Informatics, University of Padova, via Gradenigo, 6/A-35131 Padova, Italy)

Abstract

In recent years air traffic has dramatically increased without a corresponding development of airports. Therefore, airports' limited capacity causes air traffic congestion and consequent expensive delays. The only strategy that can be applied in the short term with low investments aims at the optimal management of present resources; its principal device is Ground Holding, which consists of delaying an aircraft take off whenever it is foreseen it will not land in time because of congestion. We consider a traffic situation with “multiple connections” or “banking,” i.e., the situation where some flights are assigned a set of “preceding” flights; no “successive” flight can start until all its preceding flights have landed. The problem consists of distributing delays to flights, so as to minimize the total delay cost, by respecting airport capacity, connections, and time constraints imposed by airlines. We construct an integer linear programming model and we solve it to optimality with CPLEX. Because the computation time is too high (hours) for real-world instances, we propose an alternative heuristic algorithm, which shows a very low computation time (seconds) and acceptable errors when tested on 30 realistic instances with strongly diversified data.

Suggested Citation

  • Lisa Navazio & Giorgio Romanin-Jacur, 1998. "The Multiple Connections Multi-Airport Ground Holding Problem: Models and Algorithms," Transportation Science, INFORMS, vol. 32(3), pages 268-276, August.
  • Handle: RePEc:inm:ortrsc:v:32:y:1998:i:3:p:268-276
    DOI: 10.1287/trsc.32.3.268
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.32.3.268
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.32.3.268?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
    ---><---

    Citations

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


    Cited by:

    1. Benjamin Lev, 2005. "Book Reviews," Interfaces, INFORMS, vol. 35(1), pages 102-110, February.
    2. Mukherjee, Avijit, 2004. "Dynamic Stochastic Optimization Models for Air Traffic Flow Management," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt2vk8w6nc, Institute of Transportation Studies, UC Berkeley.
    3. 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).
    4. Wei, P. & Cao, Y. & Sun, D., 2013. "Total unimodularity and decomposition method for large-scale air traffic cell transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 53(C), pages 1-16.
    5. 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.
    6. Sun, D. & Clinet, A. & Bayen, A.M., 2011. "A dual decomposition method for sector capacity constrained traffic flow optimization," Transportation Research Part B: Methodological, Elsevier, vol. 45(6), pages 880-902, July.

    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:inm:ortrsc:v:32:y:1998:i:3:p:268-276. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.