Direct Route: Navigation Platform

Abstract

Navigation stands as a cornerstone of modern life, facilitating the daily journeys of billions of individuals. However, the inherent limitations of existing navigation systems become apparent when tasked with generating optimized routes for scenarios involving more than two coordinates. This deficiency is particularly pronounced in the realm of local delivery services, encompassing water supply, newspaper distribution, and e-commerce deliveries, where tight time constraints and intricate address networks pose formidable challenges. The inadequacy of current navigation systems to deliver optimized routes in such multifaceted scenarios underscores the urgency for innovative solutions. Our research project. is positioned to fill this void by deploying the "Nearest Neighbour Algorithm" as the principal method, complemented by a comprehensive exploration of comparable algorithms such as BFS (Breadth-First Search), DFS (Depth-First Search), Dijkstra's algorithm, and A" (A Star). The "Nearest Neighbour Algorithm" serves as the linchpin, orchestrating a tour that originates from a specified node and systematically visits each subsequent node while minimizing the overall distance travelled