Allocation in a Vertical Rotary Car Park

  • M. FackrellEmail author
  • P. Taylor
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 248)


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.


Rotary car park Markov decision process 



Peter G. Taylor’s research is supported by the Australian Research Council (ARC) Laureate Fellowship FL130100039 and the ARC Centre of Excellence for the Mathematical and Statistical Frontiers (ACEMS) CE140100049.


  1. 1.
    E. Altman, Constrained Markov Decision Processes (Chapman and Hall/CRC, Boca Raton, FL, 1999)Google Scholar
  2. 2.
    F. Beretta, Motor vehicle automatic parking system, and related improved silos structure Patent - US 5338145 A (1994). Accessed on 30 April 2015
  3. 3.
    H.S. Buch, Storage structure in particular a multi-story car park. Patent - US 5864995 A (1999). Accessed on 30 April 2015
  4. 4.
    L.F.A.M. Gomes, An operations research approach to the optimal control of parking systems. Found. Control Eng. 11, 33–42 (1986)Google Scholar
  5. 5.
    H. Hwang, S. Lee, Expected service time model for a rotary parking system. Comput. Ind. Eng. 35, 559–562 (1998)CrossRefGoogle Scholar
  6. 6.
    D. Monahan, De-mystifying automated parking structures (2011). Reference 11 of Wikipedia, Automated parking system. Accessed on 11 March 2015
  7. 7.
    A.R. Odoni, On finding the maximal gain for Markov decision processes. Oper. Res. 17, 857–860 (1969)CrossRefGoogle Scholar
  8. 8.
    W.B. Powell, Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley, Hoboken, NJ, 2011)CrossRefGoogle Scholar
  9. 9.
    H. Schween, In a parking garage having more than one floor. Patent - US 5669753 A (1994). Accessed on 30 April 2015
  10. 10.
    H.A. Taha, Operations Research: An Introduction (MacMillan, New York, 1987)Google Scholar
  11. 11.
    D. Trevisani, Automated parking system and subassemblies therefor. Patent - US 5173027 A (1992). Accessed on 30 April 2015
  12. 12.
    L. Vita, Vehicle parking structure. Patent - US 5980185 A (1999). Accessed on 30 April 2015
  13. 13.
    Wikipedia, Automated Parking System. Accessed on 10 March 2015
  14. 14.
    Wikipedia, Car Parking System. Accessed on 10 March 2015
  15. 15.
    Wikipedia, Paternoster. Accessed on 10 March 2015
  16. 16.
    W.L. Winston, Operations Research, 4th edn. (Brooks/Cole: Belmont, CA, 2004)Google Scholar
  17. 17.
    YouTube, Revopark. Uploaded on 3 May 2007. url: Accessed on 10 March 2015
  18. 18.
    YouTube, Automated Rotary Parking System. Uploaded on 12 May 2009. url: Accessed on 10 March 2015
  19. 19.
    YouTube, Rotary Parking. Uploaded on 30 November 2010. url: Accessed on 10 March 2015
  20. 20.
    YouTube, PTV Vissim: Automated Parking Simulation. Uploaded on 3 February 2011. Accessed on 10 March 2015
  21. 21.
    YouTube, FATA Automated Parking Systems: 1 Car Park, 5 Systems, Uploaded on 2 August 2012. Accessed on 10 March 2015

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.School of Mathematics and StatisticsUniversity of MelbourneMelbourneAustralia

Personalised recommendations