Modeling Road Network in the Main Campus of Universiti Putra Malaysia, Serdang, Selangor, Using Graph Theory

Abstract

Graph theory is a powerful mathematical tool that can be applied to solve many real-life problems including modeling traffic flows as directed graphs and analyzing them to propose solutions for congestion problems. This research aims to describe the road network of the north and south campuses of Universiti Putra Malaysia, Serdang, Selangor, as a directed graph, consisting of junctions as vertices and interchanges (or links) between junctions with other junctions as directed edges. This research also aims to determine the shortest path between a junction to all other junctions by using two shortest path algorithms, namely the Dijkstra and Floyd-Warshall algorithms, and consequently compare their efficiencies in producing the results. The algorithms are modified so that not only the length of the shortest path is given but also to identify the shortest path itself. Based on the findings of this research, we propose several strategies to minimize traffic congestion, especially during peak hours or convocation sessions, which would benefit both university and surrounding communities.