WEIGHTED METHODS OF MULTI-CRITERIA VIA DIJKSTRA'S ALGORITHM IN NETWORK GRAPH FOR LESS CONGESTION, SHORTER DISTANCE AND TIME TRAVEL IN ROAD TRAFFIC NETWORK

Drivers tend to face road mobility problems known as traffic congestion when the traffic volume exceeds its capacity at any road intersections. Drivers then tend to select a path, normally by just considering a single criterion like distance, for example, without considering other factors which affect traffic congestion. Ultimately, drivers endeavour to reach their destination, and hence their need to select the most appropriate path in the road traffic network, since the wrong path selection might affect the goals of their endeavours, like having to reach meetings and appointments on time, saving fuel costs, and attaining quality productivity time. Therefore, a suggested approach in this study is to include multi-criteria in selecting the best path. The multi-criteria in selecting the best path in this study are the degree of saturation (level of service), route distance and time travel of the path. The network graphs with the different parameters are solved using the weighted methods, namely Weighted-Sum Method (WSM) and Weighted-Product method (WPM) via Dijkstra’s algorithm. In conclusion, the path with combined multi-criteria of distance, time travel and degree of saturation would be the best way to select the best path, instead of solely choosing either one of the criteria, namely, on the shortest distance, travel time or minimum degree of saturation