Computational Technology Resources - CCP

E. Kita^1,2, W. Nanya¹, Y. Wakita¹ and T. Tamaki³

¹Nagoya University, Nagoya, Japan
²Kobe University, Kobe, Japan
³Okinawa National College of Technology, Nago, Japan

doi:10.4203/ccp.102.232

E. Kita, W. Nanya, Y. Wakita, T. Tamaki, "Maximization of the Amount of Traffic by Deleting Road Links", in , (Editors), "Proceedings of the Fourteenth International Conference on Civil, Structural and Environmental Engineering Computing", Civil-Comp Press, Stirlingshire, UK, Paper 232, 2013. doi:10.4203/ccp.102.232

Keywords: road network, road link, optimization, Braess's paradox.

Summary

When the traffic demand increases in the urban city road network, new roads are constructed for increasing the traffic capacity of the whole road network. The construction of new roads sometimes decreases the traffic capacity of the whole road network. The aim of this study is to identify the unnecessary road or road part (link) by using a traffic flow simulator. The problem to be solved is defined as the optimization problem. The objective function is the whole road network capacity. The function is maximized by deleting roads parts. The effect of the existence of the road to the whole road network capacity is estimated by the traffic simulator. Braess's paradox problem is considered as the test problem in order to discuss the validity of the model. The simulation results show that the present algorithm can identify the unnecessary road or road part.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £65 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 102 PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON CIVIL, STRUCTURAL AND ENVIRONMENTAL ENGINEERING COMPUTING Edited by: Paper 232 Maximization of the Amount of Traffic by Deleting Road Links E. Kita^1,2, W. Nanya¹, Y. Wakita¹ and T. Tamaki³ ¹Nagoya University, Nagoya, Japan ²Kobe University, Kobe, Japan ³Okinawa National College of Technology, Nago, Japan doi:10.4203/ccp.102.232 purchase the full-text of this paper Full Bibliographic Reference for this paper E. Kita, W. Nanya, Y. Wakita, T. Tamaki, "Maximization of the Amount of Traffic by Deleting Road Links", in , (Editors), "Proceedings of the Fourteenth International Conference on Civil, Structural and Environmental Engineering Computing", Civil-Comp Press, Stirlingshire, UK, Paper 232, 2013. doi:10.4203/ccp.102.232 Keywords: road network, road link, optimization, Braess's paradox. Summary When the traffic demand increases in the urban city road network, new roads are constructed for increasing the traffic capacity of the whole road network. The construction of new roads sometimes decreases the traffic capacity of the whole road network. The aim of this study is to identify the unnecessary road or road part (link) by using a traffic flow simulator. The problem to be solved is defined as the optimization problem. The objective function is the whole road network capacity. The function is maximized by deleting roads parts. The effect of the existence of the road to the whole road network capacity is estimated by the traffic simulator. Braess's paradox problem is considered as the test problem in order to discuss the validity of the model. The simulation results show that the present algorithm can identify the unnecessary road or road part. purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £65 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions