Delivery Route Optimization Using Dijkstra’s Algorithm for the Travelling Salesman Problem
International Journal of Advanced Scientific Research and Engineering Trends · 2025-06-26 · 9 (6) · 19-23
DOI: 10.65521/ijasret.v9i6.1555 ↗At a glance
Journal article in International Journal of Advanced Scientific Research and Engineering Trends, published online on 2025-06-26. Written by K. Pavani and 2 co-authors. The full text is freely available (open access, CC BY-ND 4.0).
Abstract (original language)
This paper presents an optimized delivery route planning system using a hybrid approach of Dijkstra’s algorithm and heuristic methods to address the Travelling Salesman Problem (TSP). The objective is to find the most efficient route for a delivery agent in a food delivery scenario using the Zomato delivery analytics dataset. The system integrates Dijkstra's algorithm with the Greedy Nearest Neighbor strategy and compares it with Ant Colony Optimization (ACO) and Genetic Algorithm (GA). A comparative analysis of route accuracy, performance time, computational complexity, and scalability is discussed. The proposed system demonstrates significant improvement in route optimization, particularly for dynamically changing environments with multiple constraints. Visualization of route paths and performance metrics confirms the benefits of integrating classical and nature-inspired algorithms in a hybrid framework.
Cite
APA
Pavani, K., Anitha, M., & Priyanka, B. (2025). Delivery Route Optimization Using Dijkstra’s Algorithm for the Travelling Salesman Problem. International Journal of Advanced Scientific Research and Engineering Trends, 9(6), 19-23. https://doi.org/10.65521/ijasret.v9i6.1555
Vancouver
Pavani K, Anitha M, Priyanka B. Delivery Route Optimization Using Dijkstra’s Algorithm for the Travelling Salesman Problem. International Journal of Advanced Scientific Research and Engineering Trends. 2025;9(6):19-23. doi:10.65521/ijasret.v9i6.1555
BibTeX
@article{Pavani2025,
author = {Pavani, K. and Anitha, M. and Priyanka, B.},
title = {Delivery Route Optimization Using Dijkstra’s Algorithm for the Travelling Salesman Problem},
journal = {International Journal of Advanced Scientific Research and Engineering Trends},
year = {2025},
volume = {9},
number = {6},
pages = {19--23},
doi = {10.65521/ijasret.v9i6.1555}
}
EUVIMED