OPTIMAL PATH SELECTION ALGORITHM FOR SERVICE DELIVERY
Abstract
The efficiency and timeliness of service delivery are paramount in various sectors, including logistics, telecommunications, and urban planning. This project focuses on developing and implementing an Optimal Path Selection Algorithm designed to minimize travel time, reduce operational costs, and enhance the overall speed and reliability of service distribution. The research investigates advanced graph theory and heuristic search algorithms (A*) to model the service network and identify the most efficient route between origin and destination nodes. The study involves collecting real-world or simulated data representing network constraints, traffic conditions, and service points. The resulting algorithm is evaluated against traditional routing methods using metrics like path length, computational complexity, and delivery latency. Findings demonstrate that the proposed optimal path selection algorithm significantly improves resource utilization and service turnaround time, offering a scalable and intelligent solution for optimizing service delivery operations.
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.