Paper Title :Traffic Congestion Problem of Road Networks in Kota Kinabalu via Network Graph
Author :Ting Kien Hua, Noraini Abdullah
Article Citation :Ting Kien Hua ,Noraini Abdullah ,
(2017 ) " Traffic Congestion Problem of Road Networks in Kota Kinabalu via Network Graph " ,
International Journal of Management and Applied Science (IJMAS) ,
pp. 61-72,
Volume-3,Issue-10
Abstract : KotaKinabalu is one of the major cities in Sabah which has traffic congestion due to abundance of private vehicle
and slow improvement of traffic facilities. Traffic congestion is an urban mobility problem that worsens traffic flow and
cause economic hindrance. Traffic volume and capacity are closely related to traffic congestion because once thevolumes
exceed the capacity, the traffic congestion will occur. The scope of the study is a network from Indah Permai (IP) to Kota
Kinabalu International Airport (KKIA).The objectives of this study are to find maximum flow, bottleneck and shortest path.
Hence, capacity and distance of the routes within the scope were obtained from Dewan Bandaraya Kota Kinabalu (DBKK)
and Google Map. Capacitated and weighted network graph were formed with all the obtained data. Next, Ford-Fulkerson
algorithm, Max flow-Min cut theorem and Dijkstra’s algorithm were applied to solve the network graph. The maximum flow
and the shortest path problem were formulated intoa linear programming(LP) model, and solved by using the excel solver in
Microsoft Excel. From theresults, the traffic congestion problem was minimized and traffic flow became smooth.
Keywords - Traffic Congestion, Maximum flow, Bottleneck, Shortest Distance, Linear ProgrammingModel
Type : Research paper
Published : Volume-3,Issue-10
DOIONLINE NO - IJMAS-IRAJ-DOIONLINE-9735
View Here
Copyright: © Institute of Research and Journals
|
|
| |
|
PDF |
| |
Viewed - 50 |
| |
Published on 2018-01-03 |
|