IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-319-47766-4_11.html
   My bibliography  Save this book chapter

Stochastic Dynamic Programming for Noise Load Management

In: Markov Decision Processes in Practice

Author

Listed:
  • T. R. Meerburg

    (Air Traffic Control the Netherlands)

  • Richard J. Boucherie

    (University of Twente)

  • M. J. A. L. Kraaij

    (Air Traffic Control the Netherlands)

Abstract

Noise load reduction is among the primary performance targets for some airports. For airports with a complex lay-out of runways, runway selection may then be carried out via a preference list, an ordered set of runway combinations such that the higher on the list a runway combination, the better this combination is for reducing noise load. The highest safe runway combination in the list will actually be used. The optimal preference list selection minimises the probability of exceeding the noise load limit at the end of the aviation year. This paper formulates the preference list selection problem in the framework of Stochastic Dynamic Programming that enables determining an optimal strategy for the monthly preference list selection problem taking into account future and unpredictable weather conditions, as well as safety and efficiency restrictions. The resulting SDP has a finite horizon (aviation year), continuous state space (accumulated noise load), time-inhomogeneous transition densities (monthly weather conditions) and one-step rewards zero. For numerical evaluation of the optimal strategy, we have discretised the state space. In addition, to reduce the size of the state space we have lumped into a single state those states that lie outside a cone of states that may achieve the noise load restrictions. Our results indicate that the SDP approach allows for optimal preference list selection taking into account uncertain weather conditions.

Suggested Citation

  • T. R. Meerburg & Richard J. Boucherie & M. J. A. L. Kraaij, 2017. "Stochastic Dynamic Programming for Noise Load Management," International Series in Operations Research & Management Science, in: Richard J. Boucherie & Nico M. van Dijk (ed.), Markov Decision Processes in Practice, chapter 0, pages 321-335, Springer.
    • Handle: RePEc:spr:isochp:978-3-319-47766-4_11
    DOI: 10.1007/978-3-319-47766-4_11
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:isochp:978-3-319-47766-4_11. 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.