Identification of least congested and shortest distance path in traffic network

Ting, Kien Hua and Noraini Abdullah (2018) Identification of least congested and shortest distance path in traffic network. Journal of the Asian Academy of Applied Business, 5. pp. 83-96. ISSN 1675-9869

[img] Text
Identification of least congested and shortest distance path in traffic network.pdf

Download (38kB)
[img] Text
Identification of least congested and shortest distance path in traffic network1.pdf
Restricted to Registered users only

Download (1MB) | Request a copy

Abstract

Traffic congestion, a mobility problem that exists as the traffic volume demand exceeds the capacity of the existing intersections. Conventional approaches such as building flyover and road widening might not be very effective in solving traffic congestion. Therefore, a suggested approach in this study was to change the driver's behavior in selecting the best path. The shortest path may not be the best path. The added criterion in selecting the best path was the level of service of the path, while the included parameter that determines the level of service was the degree of saturation. Dijkstra's algorithm was applied to solve the network graph. Excel solver was used to find the solution. Percentage of difference between paths was carried out to find out the difference and significant of the paths. In conclusion, the path with combined criteria of shortest distance and least congested (degree of saturation) would be the best path, instead of solely based on the shortest distance or minimum degree of saturation.

Item Type: Article
Keyword: Degree of saturation , Distance , Least congested , Shortest path , Dijkstra’s algorithm , Traffic network
Subjects: H Social Sciences > HE Transportation and Communications > HE1-9990 Transportation and communications > HE331-380 Traffic engineering. Roads and highways. Streets
Department: FACULTY > Faculty of Science and Natural Resources
Depositing User: SITI AZIZAH BINTI IDRIS -
Date Deposited: 26 Oct 2021 19:34
Last Modified: 26 Oct 2021 19:34
URI: https://eprints.ums.edu.my/id/eprint/30771

Actions (login required)

View Item View Item