Hybrid Approach to Optimize Delivery Route with K-Dimensional Tree and Dijkstra’s Shortest Path Algorithm

Purab Sen, Aaditya Yadav, Abhishek Pandey, Samip Aanand Shah, Mehul Singh Bhakuni, Gayathri Ramasamy

2025

Abstract

To overcome the inefficiency of the traditional routing methods when it comes to route planning, this paper introduces a hybrid technique of K-D trees and Dijkstra's algorithm that can be used to plan optimal delivery routes. As the number of deliveries points and areas grow in large-scale delivery networks, it becomes more challenging to find the shortest path. The approach in this method uses K-D trees for spatial partitioning to reduce search space by identifying the closest delivery locations. TIME HEFT (Time Heuristic for TSP) (Wu et al., 2019) is a traditional TSP solving method based on heuristics. After determining the nearest neighbor, Dijkstra’s algorithm calculates the shortest path ensuring that it optimally navigates the graph with the least computational overhead. Designed to accelerate computation and scale far better than traditional methods, this integration allows for route optimization. The implemented system using Java Swing, contains a user interface that allows a vehicular route to be displayed interactively by inputting the delivery locations and also providing the best route possible to the user. To prove its efficacy, we present the experimental results demonstrating that our proposed approach not only significantly reduces the computation time but also achieves comparably good accuracy compared to the baselines, indicating its effectiveness for the logistics and delivery operations that require dynamic and efficient routing of goods.

Paper Citation

in Harvard Style

Sen P., Yadav A., Pandey A., Shah S., Bhakuni M. and Ramasamy G. (2025). Hybrid Approach to Optimize Delivery Route with K-Dimensional Tree and Dijkstra’s Shortest Path Algorithm. In Proceedings of the 1st International Conference on Research and Development in Information, Communication, and Computing Technologies - ICRDICCT`25; ISBN 978-989-758-777-1, SciTePress, pages 574-580. DOI: 10.5220/0013917100004919

in Bibtex Style

@conference{icrdicct`2525,
author={Purab Sen and Aaditya Yadav and Abhishek Pandey and Samip Shah and Mehul Bhakuni and Gayathri Ramasamy},
title={Hybrid Approach to Optimize Delivery Route with K-Dimensional Tree and Dijkstra’s Shortest Path Algorithm},
booktitle={Proceedings of the 1st International Conference on Research and Development in Information, Communication, and Computing Technologies - ICRDICCT`25},
year={2025},
pages={574-580},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0013917100004919},
isbn={978-989-758-777-1},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 1st International Conference on Research and Development in Information, Communication, and Computing Technologies - ICRDICCT`25
TI - Hybrid Approach to Optimize Delivery Route with K-Dimensional Tree and Dijkstra’s Shortest Path Algorithm
SN - 978-989-758-777-1
AU - Sen P.
AU - Yadav A.
AU - Pandey A.
AU - Shah S.
AU - Bhakuni M.
AU - Ramasamy G.
PY - 2025
SP - 574
EP - 580
DO - 10.5220/0013917100004919
PB - SciTePress