A STUDY OF GRAPH THEORY AND ITS APPLICATIONS IN TRANSPORTATION
Abstract
This work is reviewed with Application in Transportations via graph theory. It examines some of these applications by providing some and theorems that could be used to minimize transportation cost. It also gives some examples to illustrate how to find a minimum transportation path.
Graph theory, a fundamental area of discrete mathematics, offers powerful tools for modeling and analyzing complex systems, particularly in transportation networks. This study explores the applications of graph theory in transportation, focusing on how various graph-based algorithms and techniques can optimize routes, reduce congestion, and enhance efficiency in both urban and intercity transportation systems. Key topics include shortest path algorithms, network flow analysis, and graph-based scheduling, which are essential for improving traffic management, public transit, and logistics. Additionally, this research investigates real-world case studies where graph theory has been successfully implemented, demonstrating its potential in solving transportation problems such as route planning, network connectivity, and resource allocation. The study also highlights challenges and future directions in leveraging graph theory for sustainable and smart transportation solutions.
Keywords : Graph, Kruskal’s algorithm, Dijkstras algorithm, and Transportation.
Full-Text Access Notice
In accordance with the NERD Policy on promoting peer-reviewed publication, public access to the full text of a project, thesis or dissertation is restricted for three years, allowing the author and supervisors sufficient time to pursue peer-reviewed publication.
During this period, researchers with legitimate academic or research purposes may request authorisation directly from the author to enable NERD to release the indexed full texts of the work using the form below.