Search Results - dynamic shortest-path algorithms

Parallel Multi Objective Shortest Path Update Algorithm in Large Dynamic Networks

Authors: S. M. Shovan Arindam Khanda Sajal K. Das

Source: IEEE Transactions on Parallel and Distributed Systems. 36:932-944

Research on Traffic Dynamic Shortest Path Allocation Model Based on Triangular Fuzzy Number Weight and K-Means Algorithm

Authors: Hanzheng Sun Dan Li Baoping Zhi et al.

Source: IEEE Transactions on Intelligent Transportation Systems. :1-13

A parallel all-pairs shortest paths algorithm for dynamic graphs

Authors: Lin Zhu Qiang-sheng Hua Hai Jin

Source: CCF Transactions on High Performance Computing.

Enhanced bi-directional dynamic programming algorithm for the resource constrained shortest path problem

Authors: Salani, Matteo Basso, Saverio Righini, Giovanni

Source: Transportation Research Procedia. 78:361-368

Subject Terms: ynamic Programming, Resource Constrained Shortest Path

File Description: application/pdf

Access URL: https://hdl.handle.net/2434/1049822
https://doi.org/10.1016/j.trpro.2024.02.046

A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications

Authors: Rasmus Kyng Simon Meierhans Maximilian Probst Gutenberg

Source: STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing

Subject Terms: FOS: Computer and information sciences, Shortest-Paths, Dynamic Graph Algorithms, All-Pair Shortest-Paths, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: http://arxiv.org/abs/2311.06402
http://hdl.handle.net/20.500.11850/680544

A multiphase dynamic programming algorithm for the shortest path problem with resource constraints

Authors: Ilyas Himmich Issmail El Hallaoui François Soumis

Source: European Journal of Operational Research. 315:470-483

Access URL: https://publications.polymtl.ca/57181/
https://doi.org/10.1016/j.ejor.2023.11.047

Single Source Shortest Path Algorithm - Based on Reverse Tracking from Destination, using Dynamic Programming

Authors: M Srihari L Suresh Bhagyashree Ambore et al.

Source: 2024 International Conference on Knowledge Engineering and Communication Systems (ICKECS). :1-4

SSSP-Del: Fully Dynamic Distributed Algorithm for Single-Source Shortest Path

Authors: Javanrood, Parshan Ripeanu, Matei

Subject Terms: FOS: Computer and information sciences, Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC)

Access URL: http://arxiv.org/abs/2508.14319

An efficient all-pairs approach for multi-objective dynamic shortest path problems.

Authors: da Silva, Juarez Machado Ramos, Gabriel de Oliveira Barbosa, Jorge Luis Victória

Source: Neural Computing & Applications. Oct2025, Vol. 37 Issue 30, p24823-24851. 29p.

Subject Terms: *MULTI-objective optimization, *ALGORITHMS, *MATHEMATICAL optimization, *GRAPH theory, *ROUTE choice, *ADAPTIVE routing (Computer network management)

A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths

Authors: Chuzhoy, Julia Zhang, Ruimin

Source: Proceedings of the 55th Annual ACM Symposium on Theory of Computing. :1159-1172

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Access URL: http://arxiv.org/abs/2304.09321

Implementing Efficient Dynamic Threat Avoidance Routing Based on Dijkstra’s Shortest Path Algorithm in the Advanced Framework for Simulation, Integration, and Modeling (AFSIM)

Authors: Dante C. Reid Lance E. Champagne Nathan B. Gaw

Source: 2023 Winter Simulation Conference (WSC). :2415-2426

A Parallel Algorithm for Updating a Multi-objective Shortest Path in Large Dynamic Networks

Authors: Arindam Khanda S. M. Shovan Sajal K. Das

Source: Proceedings of the SC '23 Workshops of the International Conference on High Performance Computing, Network, Storage, and Analysis. :739-746

Solving Minimum Steiner Tree on Grid using Dynamic Programming and Shortest Path First Algorithm.

Authors: Soelaiman, Rully Chanda D'Layla, Adifa Widyadhani Rizkynanda, Achmad Nashruddin et al.

Source: Engineering Letters. May2025, Vol. 33 Issue 5, p1705-1713. 9p.

Subject Terms: *DYNAMIC programming, *INFRASTRUCTURE (Economics), *ELECTRIC circuit networks, *COMMUNICATION infrastructure, *TREE graphs

Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies

Authors: Oleg G. Monakhov Emilia A. Monakhova Aleksandr Yu. Romanov et al.

Source: IEEE Access, Vol 9, Pp 160836-160846 (2021)

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, Pair routing algorithm, reserve shortest path, Electrical engineering. Electronics. Nuclear engineering, 0102 computer and information sciences, 02 engineering and technology, network-on-chip, 01 natural sciences, circulant network, TK1-9971

Access URL: https://ieeexplore.ieee.org/ielx7/6287639/6514899/09628133.pdf
https://doaj.org/article/4d94ff572dbe4e578a8f4d4c5de26dbe
http://xplorestaging.ieee.org/ielx7/6287639/6514899/09628133.pdf?arnumber=9628133

Shortest Path Planning and Efficient Fuzzy Logic Control of Mobile Robots in Indoor Static and Dynamic Environments

Authors: Hentout, Abdelfetah Maoudj, Abderraouf Kouider, Ahmed

Source: Romanian Journal of Information Science and Technology. 2024:21-36

Subject Terms: indoor static and dynamic environments, 0209 industrial biotechnology, mobile robots, Deterministic constructive algorithm, fuzzy logic control, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, shortest path planning

Access URL: https://portal.findresearcher.sdu.dk/da/publications/5c81800b-7fcb-49ad-acf5-08c5552c4138
https://doi.org/10.59277/ROMJIST.2024.94.02

Fine-Grained Optimality of Partially Dynamic Shortest Paths and More

Authors: Saha, Barna Williams, Virginia Vassilevska Xu, Yinzhan et al.

Source: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611978322

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, F.2.2, F.1.3, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC)

Access URL: http://arxiv.org/abs/2407.09651

Learn to Optimize the Constrained Shortest Path on Large Dynamic Graphs

Authors: Jiaming Yin Weixiong Rao Qinpei Zhao et al.

Contributors: Jiaming Yin Weixiong Rao Qinpei Zhao et al.

Source: IEEE Transactions on Mobile Computing. 23:2456-2469

Subject Terms: Constrained shortest path, Optimization, Combinatorial optimization, Computer and information sciences, Vehicle dynamics, Reinforcement Learning, Convolution, Roads, Constrained Shortest Path, Labeling, Combinatorial Optimization, Reinforcement learning, Q-learning, Heuristic algorithms, Dynamic Graphs, Dynamic graphs

File Description: application/pdf

Access URL: http://hdl.handle.net/10138/591343

Beyond Shortest Paths: Node Fairness in Route Recommendation

Authors: Ferrara, Antonio García Soriano, David Bonchi, Francesco

Source: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Subject Terms: Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica, Graph algorithms analysis, Dynamic graph algorithms, Paths and connectivity problems, Shortest paths, Graph algorithms

File Description: application/pdf

Access URL: https://hdl.handle.net/2117/441585
https://doi.org/10.14778/3746405.3746440

Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time

Authors: Xiao Mao

Source: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. :1141-1152

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Access URL: http://arxiv.org/abs/2306.02662

A dynamic programming algorithm for solving the k-Color Shortest Path Problem

Authors: Ferone D. Festa P. Fugaro S. et al.

Source: Optimization Letters. 15:1973-1992

Subject Terms: Aurora Universities Network, Constrained Shortest Path, Edge-colored network, Control and Optimization, 0502 economics and business, 05 social sciences, 1. No poverty, 0211 other engineering and technologies, Dynamic programming, Network optimization, 02 engineering and technology, 16. Peace & justice

Access URL: https://link.springer.com/content/pdf/10.1007/s11590-020-01659-z.pdf
https://link.springer.com/content/pdf/10.1007/s11590-020-01659-z.pdf
http://hdl.handle.net/11588/835657
https://dblp.uni-trier.de/db/journals/ol/ol15.html#FeroneFFP21
https://link.springer.com/article/10.1007/s11590-020-01659-z
https://link.springer.com/content/pdf/10.1007/s11590-020-01659-z.pdf
https://www.openaccessrepository.it/record/81185
https://link.springer.com/content/pdf/10.1007/s11590-020-01659-z.pdf
https://doi.org/10.1007/s11590-020-01659-z
https://hdl.handle.net/11588/835657