Results 31 to 40 of about 47,124 (214)
A Modification of Shortest Path Algorithm According to Adjustable Weights Based on Dijkstra Algorithm [PDF]
Engineering and Technology Journal, 2023 It is possible to represent the road map on the paper and study it using Dijkstra`s algorithm to find the shortest path on the real earth. Dijkstra`s Algorithms are used for calculating the shortest path from source to sink to enable query operations ...
Luay Jabbar, Eyad Abass, Sundus Hasan
doaj +1 more source
Shortest Path Discovery in the Multi-layered Social Network [PDF]
, 2011 Multi-layered social networks consist of the fixed set of nodes linked by multiple connections. These connections may be derived from different types of user activities logged in the IT system.
Bródka, Piotr +2 more
core +1 more source
Surface Optimal Path Planning Using an Extended Dijkstra Algorithm
IEEE Access, 2020 Extensive studies have been conducted on the Dijkstra algorithm owing to its bright prospect. However, few of them have studied the surface path planning of mobile robots.
Min Luo, Xiaorong Hou, Jing Yang
doaj +1 more source
Hybrid Bellman–Ford–Dijkstra algorithm
Journal of Discrete Algorithms, 2017 The paper considers the single-source shortest paths problem in a digraph with negative edge costs allowed. A new, hybrid algorithm for finding shortest paths from a source \(s\) in a graph \(G\) with general edge costs is constructed by combining Bellman-Ford and Dijkstra algorithms (hence BFD algorithm).
Yefim Dinitz, Rotem Itzhak
openaire +2 more sources
An Efficient Approach for Solving Time-Dependent Shortest Path Problem under Fermatean Neutrosophic Environment [PDF]
Neutrosophic Sets and SystemsEfficiently determining optimal paths and calculating the least travel time within complex networks is of utmost importance in addressing transportation challenges.
K. Vidhya, A. Saraswathi, Said Broumi
doaj +1 more source
Robot Path Planning of Improved Adaptive Ant Colony System Algorithm Based on Dijkstra
Journal of Robotics, 2022 Path planning is one of the key technologies of robot. Aiming at the problems of slow convergence speed and inefficient search of traditional Ant Colony System Algorithm, an adaptive Ant Colony System Algorithm based on Dijkstra is proposed in the paper.
Chonglin Gu +3 more
doaj +1 more source
Multipath optimized link state routing for mobile ad hoc networks [PDF]
, 2011 International audienceMultipath routing protocols for Mobile Ad hoc NETwork (MANET) address the problem of scalability, security (confidentiality and integrity), lifetime of networks, instability of wireless transmissions, and their adaptation to ...
Abolhasan +11 more
core +6 more sources
Applications of graph algorithms in GIS [PDF]
, 2010 A
Fack, Veerle, Vanhove, Stéphanie
core +2 more sources
Delivery Route Management based on Dijkstra Algorithm
مجلة بغداد للعلوم, 2021 For businesses that provide delivery services, the efficiency of the delivery process in terms of punctuality is very important. In addition to increasing customer trust, efficient route management, and selection are required to reduce vehicle fuel costs
Ng Lih Sheng +3 more
doaj +1 more source
Transit Node Routing Reconsidered [PDF]
, 2013 Transit Node Routing (TNR) is a fast and exact distance oracle for road networks. We show several new results for TNR. First, we give a surprisingly simple implementation fully based on Contraction Hierarchies that speeds up preprocessing by an order of ...
D. Delling +9 more
core +2 more sources