Track: Logistics, Transport and Traffic Management

Abstract

This paper presents a design of solving Taxi-Delay during peak hours utilizing techniques from graph theory. The Minimum Spanning Tree algorithm (denote MST) is efficient for searching optimal transport routes between locations. The intuition of the MST problem is that it depicts different sort of scenarios where it is crucial to use this theoretical approach and how to use this tool for discovering a solution. Graph theory incorporates various algorithms for searching the minimum spanning tree and this paper uses one of them. To model the situation of Taxi-Delay optimization we use connected weighted graph where vertices represent locations and the edges represent the transport routes between the locations. The weight of an edge represents the time to drive the Taxi between two locations. A theoretical discussion and a model example are carried out to assess the MST.