Results 21 to 30 of about 46,824 (191)
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).
Dinitz, Yefim, Itzhak, Rotem
openaire +2 more sources
On the Optimization of Dijkstra’s Algorithm [PDF]
, 2011 In this paper, we propose some amendment on Dijkstras algorithm in order to optimize it by reducing the number of iterations. The main idea is to solve the problem where more than one node satisfies the condition of the second step in the traditional Dijkstras algorithm.
Kadry, Seifedine +2 more
openaire +2 more sources
A Dijkstra-Type Algorithm for Dynamic Games [PDF]
Dynamic Games and Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BARDI, MARTINO, J. P. Maldonado Lopez
openaire +3 more sources
Path Planning Algorithm of Dijkstra-Based Intelligent Aircraft under Multiple Constraints
Xibei Gongye Daxue Xuebao, 2020 Aiming at the rapid planning of the optimal flight path of the intelligent aircraft, considering the error constraints and correction probability constraints, a model for intelligent aircraft path planning under multiple constraints is constructed, and a
doaj +1 more source
An Application of the Multi-Level Heuristic for the Heterogeneous Fleet Vehicle Routing Problem [PDF]
, 2010 The Multi-Level heuristic is used to investigate the heterogeneous fleet vehicle routing problem (HFVRP). The initial solution for the Multi-Level heuristic is obtained by Dijkstra\u27s algorithm based on a cost network constructed by the sweep algorithm
Berrevoet, F. +5 more
core +6 more sources
Multiobjective Multidepot Capacitated Arc Routing Optimization Based on Hybrid Algorithm
Journal of Advanced Transportation, 2022 The multidepot capacitated arc routing problem (CARP) is investigated with the hybrid optimization algorithm of the Dijkstra algorithm and genetic algorithm.
Liang Wu
doaj +1 more source
CLEI Electronic Journal, 2023 This work presents an interactive proof assistant, based on Dijkstra-Scholten logic, aimed at teaching logic and discrete mathematics in higher education.
Federico Flaviani, Walter Carballosa
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
MODEL TRANSPORTASI PENGIRIMAN PRODUK PERISHABLE DENGAN MULTI KENDARAAN
Jurnal Manajemen Industri dan Logistik, 2019 : According to Graf theory, the shortest path determination is a problem of looking for a path between two vertices in a weighted graph to obtain the minimum amount of weight.The determination of the shortest path problem also called optimization problem.
Winanda Kartika
doaj +1 more source
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