Skip to main content
Log in

Optimal Design of Two Road Networks Based on their Properties

  • Original Papers
  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

Abstract

In this paper, we discuss some fundamental properties of two idealized typical networks, namely, grid type and radial-circular type. The discussion is based on SPCP (Shortest Path Counting Problem), which reflects the traffic density of a road segment. Furthermore, we compare their effectiveness based on the obtained results of the above two road networks, and suggest some proposals on the design of car lanes by considering the direction of a road segment in relation to these road networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Clark, C. Urban population densities. Journal of the Royal Statistical Society (Series A), 114: 490–496 (1951)

    Google Scholar 

  2. Horwood, E.M. A three-dimensional calculus model of urban settlement. Highway Research Board Bulletin, 347: 143–146 (1962)

    Google Scholar 

  3. Koshizuka, T. Comparison of road networks patterns with respect to travel distance and passing volume (in Japanese). Journal of the City Planning Institute of Japan, 34: 763–768 (1999)

    Google Scholar 

  4. Li, M.Z. The average traveling distance and urban traffic pattern based on the analysis of SPCP. Submitted to OR Transactions.

  5. Li, M.Z., Fushimi, M. Analysis and comparison of the road traffic areas of circular and square working fields. OR Transactions, 6: 553–560 (2002)

    Google Scholar 

  6. Oyama, T. Weight of shortest path analysis for the optimal location problem. Journal of the Operations Research Society of Japan, 43(1): 176–196 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Oyama, T., Taguchi, A. On some results of the shortest path counting problem. Proceedings of the Spring Meeting of the Operations Research Society of Japan, 102–103 (1991)

  8. Oyama, T., Taguchi, A. Further results on the shortest path counting problem. Proceedings of the Fall Meeting of the Operations Research Society of Japan, 166–167 (1991)

  9. Oyama, T., Taguchi, A. Application of the shortest path counting problem to evaluate the importance of city road segments in Japan. In Y. Matsuda and M. Fushimi (eds.) Perspectives of Advanced Technology Society, Vol.3: Urban Life and Traffic, Maruzen Planet, Tokyo, 3–20 1996

  10. Oyama, T., Morohosi, H. Applying the shortest path counting problem to evaluate the importance of city road segments and the connectedness of the network-structured system. International Transactions in Operational Research, 11(5): 555–574 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. Sherratt, G.G. A model for general urban growth. In C. W. Churchman and M. Verhulst (eds.) Management Sciences, Models and Techniques, Vol.2, Pergamon Press, Elmsford, New York, 1960

  12. Smeed, R.J. Road development in urban areas. Journal of the Institution of Highway Engineers, 10: 5–30 (1963)

    Google Scholar 

  13. Vaughan, R.J. Urban Spatial Traffic Patterns, Pion, 1987

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ming-zhe Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, Mz., Zhang, Y. Optimal Design of Two Road Networks Based on their Properties. Acta Mathematicae Applicatae Sinica, English Series 23, 337–352 (2007). https://doi.org/10.1007/s10255-007-0376-1

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-007-0376-1

Keywords

2000 MR Subject Classification

Navigation