LEAST CONGESTED AND SHORTEST DISTANCE PATH IN KOTA KINABALU TRAFFIC NETWORK, SABAH, MALAYSIA

Mobility Problem such as traffic congestion exists when the traffic volume demand exceeds the capacity of the existing intersections. Solving traffic congestion using conventional approaches, such as building flyover and road widening might not be very effective in the long term. Therefore, a suggested approach in this study is to change the driver’s criteria in selecting the best path. The best path in this study has the criterion of not only the shortest path, but it also includes another criterion like congestion level. The added criterion in selecting the best path is the level of service of the intersection. The additional parameter is the degree of saturation which is defined as the level of services. Dijkstra’s algorithm is applied to solve the network graph. Maple Software is used to find the best solution. In conclusion, the combined parameters of route distances and degree of saturation have signified that the best optimal path chosen is the one with the least congested and distance routes, instead of just solely selecting the shortest distance or lowest traffic congestion level