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

Allocation in a Vertical Rotary Car Park

In: Markov Decision Processes in Practice

Author

Listed:
  • M. Fackrell

    (University of Melbourne)

  • P. Taylor

    (University of Melbourne)

Abstract

We consider a vertical rotary car park consisting of l levels with c parking spaces per level. Cars arrive at the car park according to a Poisson process, and if there are parking spaces available, they are parked according to some allocation rule. If the car park is full, arrivals are lost. Cars remain in the car park for an exponentially distributed length of time, after which they leave. We develop an allocation algorithm that specifies where to allocate a newly-arrived car that minimises the expected cumulative imbalance of the car park. We do this by modelling the working of the car park as a Markov decision process, and deriving an optimal allocation policy. We simulate the operation of some car parks when the policy decision making protocol is used, and compare the results with those observed when a heuristic allocation algorithm is used.

Suggested Citation

  • M. Fackrell & P. Taylor, 2017. "Allocation in a Vertical Rotary Car Park," International Series in Operations Research & Management Science, in: Richard J. Boucherie & Nico M. van Dijk (ed.), Markov Decision Processes in Practice, chapter 0, pages 337-370, Springer.
    • Handle: RePEc:spr:isochp:978-3-319-47766-4_12
    DOI: 10.1007/978-3-319-47766-4_12
    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.

    More about this item

    Keywords

    Rotary car park; Markov decision process;

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