Allocation in a Vertical Rotary Car Park

M. Fackrell () and P. Taylor ()
Additional contact information
M. Fackrell: University of Melbourne
P. Taylor: University of Melbourne

Chapter Chapter 12 in Markov Decision Processes in Practice, 2017, pp 337-370 from Springer

Abstract: 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.

Keywords: Rotary car park; Markov decision process (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-319-47766-4_12

Ordering information: This item can be ordered from
http://www.springer.com/9783319477664

DOI: 10.1007/978-3-319-47766-4_12

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().