Results 1 to 10 of about 5,425,704 (264)
Dijkstra's algorithm to find the nearest vaccine location. [PDF]
Procedia Comput Sci, 2023 Since the start of Covid-19 pandemic has made many people look for vaccine locations. In general, Dijkstra algorithm is used to find the shortest path. The shortest path problem concentrates on finding the path with the minimum distance. The Dijkstra algorithm was chosen because it has several advantages other than advantageous in terms of running time
Jason +4 more
europepmc +4 more sources
Recent Application of Dijkstra’s Algorithm in the Process of Production Planning
Applied Sciences, 2022 This paper aims to develop a method that could serve as a tool for evaluating extracted raw materials in terms of use by considering the place of extraction and consumption.
Marcel Behún +4 more
doaj +2 more sources
Partitioning graphs to speedup Dijkstra's algorithm [PDF]
ACM Journal of Experimental Algorithmics, 2005 We study an acceleration method for point-to-point shortest-path computations in large and sparse directed graphs with given nonnegative arc weights. The acceleration method is called the arc-flag approach and is based on Dijkstra's algorithm. In the arc-flag approach, we allow a preprocessing of the network data to
Rolf H. Möhring +4 more
semanticscholar +3 more sources
Determining an optimal path for forest road construction using Dijkstra's algorithm
Journal of Forest Science, 2016 From an economic point of view a well-designed road path with the minimum construction cost is an optimal path that can be found using Dijkstra's algorithm.
A. Parsakhoo, M. Jajouzadeh
doaj +2 more sources
Routing in triple loop circulants: A case of networks-on-chip. [PDF]
Heliyon, 2020 In this paper we propose and analyze various approaches to organizing routing in a triple loop circulant topologies as applied to networks-on-chip: static routing based on universal graph search algorithms, such as Dijkstra's algorithm and a possible ...
Romanov AY, Starykh VA.
europepmc +2 more sources
Vehicle Route Planning using Dynamically Weighted Dijkstra's Algorithm with Traffic Prediction [PDF]
arXiv.org, 2022 Traditional vehicle routing algorithms do not consider the changing nature of traffic. While implementations of Dijkstra's algorithm with varying weights exist, the weights are often changed after the outcome of algorithm is executed, which may not ...
Piyush Udhan +5 more
semanticscholar +1 more source
A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots
Journal of Advanced Research in Natural and Applied Sciences, 2023 Autonomous Mobile Robots (AMRs) are frequently used in many fields of technology. In this study, an AMR was designed to execute different path planning algorithms.
Orkan Murat Çelik, Murat Köseoğlu
doaj +1 more source
Optimal Path Planning Method for IMU System-Level Calibration Based on Improved Dijkstra’s Algorithm
IEEE Access, 2023 The calibration path of system-level calibration directly affects the incentive effect of the error term and thus the calibration accuracy. Currently, the planning of system-level calibration paths is predominantly designed based on personal experience ...
Xuesong Bai +4 more
semanticscholar +1 more source
A reinforcement learning approach for widest path routing in software-defined networks
ICT Express, 2023 In this paper, a routing method based on reinforcement learning (RL) under software-defined networks (SDN), namely the Q-learning widest-path routing algorithm (Q-WPRA), is proposed.
Chih-Heng Ke, Yi-Hao Tu, Yi-Wei Ma
doaj +1 more source
Jurnal Derivat, 2021 The purpose of this study are (1) to represent the route of café location in Bumiayu in the form of graph, (2) To find a solution from the application of the Dijkstra’s algorithm to find location of café in Bumiayu, and (3) To find the recommended ...
Intan Alifiani +2 more
doaj +1 more source