Results 221 to 230 of about 5,083,450 (268)

Application of Improved Dijkstra Algorithm in Two-dimensional Path Planning Problem

International Conference on Intelligent Information Processing, 2019
The Dijkstra algorithm is a typical single-source shortest path algorithm for calculating the shortest path from one node to the other in a non-negative weight map, but its use of the roulette method greatly affects the node selection.
Ruifang Zhang, Tianyi Ji, Haitao Zheng
semanticscholar   +1 more source

Airport AGV path optimization model based on ant colony algorithm to optimize Dijkstra algorithm in urban systems

Sustainable Computing: Informatics and Systems, 2022
Yulan Zhou, N. Huang
semanticscholar   +1 more source

A parallelization of Dijkstra's shortest path algorithm

1998
The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultaneously work-efficient. We propose simple criteria which divide Dijkstra's sequential SSSP algorithm into a number of phases, such that the operations within a phase can be done in parallel.
Crauser, A., Mehlhorn, K., Meyer, U., Sanders, P.   +3 more
openaire   +2 more sources

Dijkstra’s Algorithm – The Closest Look

2015
Chapter 20 introduced Dijkstra’s algorithm. Here, we take a closer look at its workings, picking up the example we’ve been using of the airline flight plan. We use the algorithm to first determine the shortest among the links directly connected to the origin, so as to find the destination closest to it.
openaire   +1 more source

ENHANCED HEAP FOR DIJKSTRA'S ALGORITHM

Abstract Success of min heap is because of its typical structure with parents containing values smaller than their children which makes them faster for sorting n elements in n  time. This motivated Dijkstra to implement its ‘single source shortest path’ algorithm using min heap. However, one drawback of the min heap is its self-destructive nature that
ANUBHAV KUMAR PRASAD, ARUNI SINGH
openaire   +1 more source

Dijkstra’s Algorithm — The First Look

2015
I’ll start the chapter with the description of Dijkstra’s algorithm from the Math Wiki site; it’s a very elegant description and one that is worth reading:
openaire   +1 more source

Dijkstra algorithm in parallel- Case study

Proceedings of the 2015 16th International Carpathian Control Conference (ICCC), 2015
This article aims to highlight the usefulness of improving classical algorithms by generating new approaches, efficiency or parallel execution time optimization at all costs. The reconsideration of classical algorithms, but in different testing conditions can help all products that rely on them.
openaire   +1 more source

Optimization of Two-dimensional Path Optimization Algorithm Based on Dijkstra Ant Colony Optimization Algorithm

2024 2nd International Conference on Signal Processing and Intelligent Computing (SPIC)
To address the limitations of the traditional Dijkstra algorithm in two-dimensional path optimization problems, this article uses ant colony algorithm to optimize the Dijkstra algorithm, solving the limitations of the Dijkstra algorithm that requires ...
Heng Guo, Qingquan Liu, Zhihui Dang
semanticscholar   +1 more source

On Dijkstra’s Algorithm for Deadlock Detection

2009
We study a classical problem in operating systems concerning deadlock detection for systems with reusable resources. The elegant Dijkstra’s algorithm utilizes simple data structures, but it has the cost of quadratic dependence on the number of the processes.
Youming Li, Ardian Greca, James Harris
openaire   +1 more source

Evacuation route optimization under real-time toxic gas dispersion through CFD simulation and Dijkstra algorithm

Journal of Loss Prevention in the Process Industries, 2022
Jiyun Wang, Xiaoyang Yu, R. Zong, Shouxiang Lu   +3 more
semanticscholar   +1 more source