Advertisement

Determining On-Street Parking Places in Urban Road Networks Using Meta-Heuristic Harmony Search Algorithm

  • Huseyin Ceylan
  • Ozgur Baskan
  • Cenk Ozan
  • Gorkem Gulhan
Chapter
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 262)

Abstract

This study aims to develop a simulation/optimization model for the solution to the problem of determining on-street parking places in urban road networks. The problem is dealt within the Discrete Network Design (DND) context due to the binary decision variables and the bi-level programming technique is used for the solution of the problem. The upper level represents the determination of on-street parking places while the reaction of drivers’ to the design is handled in user equilibrium manner in the lower level. The upper level problem is formulized as a non-linear mixed integer programming problem and the meta-heuristic Harmony Search (HS) optimization technique is employed for the solution. In the proposed model, VISUM traffic analysis software is utilized as the simulation tool for solving the lower level problem. The performance of the proposed model is tested on Sioux-Falls road network which has widely been used on DND studies in the previous works. Results show that determining optimal or near-optimal on-street parking places may be achieved by using the proposed model.

Keywords

On-street parking Discrete network design problem Harmony search algorithm Traffic management VISUM traffic model 

Notes

Acknowledgments

Scientific Research Foundation of Pamukkale University with the Project No. 2013BSP009 is acknowledged.

References

  1. 1.
    Shoup, D.C.: The ideal source of public revenue. Reg. Sci. Urban Econ. 34, 753–784 (2004)CrossRefGoogle Scholar
  2. 2.
    Yousif, S., Purnawan.: Traffic operations at on-street parking facilities. P. I. Civil Eng.-Transp. 157, 189–194 (2004)Google Scholar
  3. 3.
    Portilla, A.I., Orena, B.A., Berodia, J.L.M., Diaz, F.J.R.: Using M/M/∞ queuing model in on-street parking maneuvers. J. Transp. Eng.-Asce. 135(8), 527–535 (2009)CrossRefGoogle Scholar
  4. 4.
    Guo, H., Gao, Z., Yang, X., Zhao, X., Wang, W.: Modeling travel time under the influence of on-street parking. J Transp. Eng.-Asce. 138(2), 229–235 (2012)CrossRefGoogle Scholar
  5. 5.
    Bruynooghe, M.: An optimal method of choice of investments in a transport network. Presentation, Planning and Transport Research and Computation Seminars on Urban Traffic Model Reasearch (1972)Google Scholar
  6. 6.
    LeBlanc, L.J.: An algorithm for the discrete network design problem. Transp. Sci. 9(3), 183–199 (1975)CrossRefGoogle Scholar
  7. 7.
    Poorzahedy, H., Turnquist, M.A.: Approximate algorithm for the discrete network design problem. Transp. Res. B.-Meth. 16(1), 45–55 (1982)Google Scholar
  8. 8.
    Heragu, S.S.: Facilities Design, p. 647. PWS Publishing Company, Boston (1997)Google Scholar
  9. 9.
    Pinedo, M.L.: Scheduling Theory. Algorithms and Systems, 3rd edn, p. 647. Springer, LLC (2008)Google Scholar
  10. 10.
    Gao, Z.Y., Wu, J.J., Sun, H.J.: Solution algorithm for the bi-level discrete network design problem. Transp. Res. B.-Meth. 39, 479–495 (2005)CrossRefGoogle Scholar
  11. 11.
    Duthie, J., Waller, S.T.: Incorporating environmental justice measures into equilibrium-based network design. J. Trans. Res. B. 2089, 58–65 (2008)CrossRefGoogle Scholar
  12. 12.
    Ceylan, H., Ceylan, H.: Discrete design of urban road networks with meta-heuristic harmony search algorithm. Tek Dergi 24(1), 6211–6231 (2013)Google Scholar
  13. 13.
    Geem, Z.W., Kim, J.-H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)CrossRefGoogle Scholar
  14. 14.
    Ceylan, H., Ceylan, H., Haldenbilen, S., Baskan, O.: Transport energy modeling with meta-heuristic harmony search algorithm, an application to Turkey. Energy Policy 36, 2527–2535 (2008)CrossRefGoogle Scholar
  15. 15.
    Baskan, O.: Harmony search algorithm for continuous network design problem with link capacity expansions. KSCE J. Civ. Eng. (2013). doi: 10.1007/s12205-013-0122-6 Google Scholar
  16. 16.
    Ceylan, H., Ceylan, H.: A hybrid harmony search and TRANSYT hill climbing algorithm for signalized stochastic equilibrium transportation networks. Transp. Res. C.-Emer. 25, 152–167 (2012)CrossRefGoogle Scholar
  17. 17.
    PTV AG.: VISUM 12.5 Fundemantals. Karlsruhe, Germany (2012)Google Scholar
  18. 18.
    Wang, L., Mao, Y., Niu, Q., Fei, M.: A multi-objective binary harmony search algorithm. Lect. Notes Comput. Sc. 6729, 74–81 (2011)CrossRefGoogle Scholar
  19. 19.
    Suwansirikul, C., Friesz, T.L., Tobin, R.L.: Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem. Transp. Sci. 21(4), 254–263 (1987)CrossRefMATHGoogle Scholar
  20. 20.
    Bureau of Public Roads: Traffic Assignment Manual. U.S. Department of Commerce, Washington (1964)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Huseyin Ceylan
    • 1
  • Ozgur Baskan
    • 1
  • Cenk Ozan
    • 1
  • Gorkem Gulhan
    • 2
  1. 1.Department of Civil EngineeringPamukkale UniversityDenizliTurkey
  2. 2.Department of Urban and Regional PlanningPamukkale UniversityDenizliTurkey

Personalised recommendations