IDEAS home Printed from https://ideas.repec.org/a/taf/reroxx/v24y2011i2p26-43.html
   My bibliography  Save this article

Application of the Queuing Theory in the Planning of Optimal Number of Servers (Ramps) In Closed Parking Systems

Author

Listed:
  • Robert Maršanić
  • Zdenka Zenzerović
  • Edna Mrnjavac

Abstract

The principal objective of this scientific paper is to learn how to efficiently organise traffic areas and especially the size of parking capacities and hence how to ensure a quality parking service to local population and tourists as a component of the overall offer in urban and tourist destinations and how to ensure a return of investments in a reasonable period to parties investing in the parking capacity. What is the optimal capacity and how to calculate it in the best possible way by connecting parking supply and demand? This paper presents the application of the queuing theory to the planning of the optimal number of servers (ramps) in closed parking systems, since parking area can be defined as a queuing system. The illustrated model has been tested on the example of the "Delta" parking area in the City of Rijeka and the particular value of the model is its universal application. This approach has shown that by using the queuing theory, the optimal number of servers (ramps) in closed parking systems can be determined.

Suggested Citation

  • Robert Maršanić & Zdenka Zenzerović & Edna Mrnjavac, 2011. "Application of the Queuing Theory in the Planning of Optimal Number of Servers (Ramps) In Closed Parking Systems," Economic Research-Ekonomska Istraživanja, Taylor & Francis Journals, vol. 24(2), pages 26-43, January.
    • Handle: RePEc:taf:reroxx:v:24:y:2011:i:2:p:26-43
    DOI: 10.1080/1331677X.2011.11517453
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/1331677X.2011.11517453
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/1331677X.2011.11517453?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:reroxx:v:24:y:2011:i:2:p:26-43. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/rero .

    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.