Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{197218,
        author = {Mikhaela falcao and Bhavesh Kadam and Sweta Nigam},
        title = {Route Planning for Food Delivery Services Using Tsinghua's SSSP Algorithm: A Comparative Analysis with Dijkstra},
        journal = {International Journal of Innovative Research in Technology},
        year = {2026},
        volume = {12},
        number = {11},
        pages = {5524-5528},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=197218},
        abstract = {Dynamic route optimization powers modern food delivery ecosystems, where milliseconds in path computation translate to millions in savings. Dijkstra's Single Source Shortest Path (SSSP) algorithm faces sorting bottlenecks in urban-scale graphs, prompting Tsinghua University's 2025 advancement: a deterministic SSSP solver clustering frontiers for O(m log²/³ n) performance. This research simulates a Mumbai-inspired network (5k nodes, dynamic orders), detailing algorithms, app workflows, and benchmarks. Tsinghua yields more than double the throughput, 16% faster deliveries under peak loads.},
        keywords = {Dijkstra Algorithm, Dynamic Graph Routing, Food Delivery Dispatch, Shortest Path Optimization, Tsinghua SSSP},
        month = {April},
        }