Results 41 to 50 of about 5,083,450 (268)

UniALT for regular language contrained shortest paths on a multi-modal transportation network [PDF]

, 2011
Shortest paths on road networks can be efficiently calculated using Dijkstra\u27s algorithm (D). In addition to roads, multi-modal transportation networks include public transportation, bicycle lanes, etc.
Kirchler, Dominik, Liberti, Leo, Pajor, Thomas, Wolfler Calvo, Roberto   +3 more
core   +1 more source

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

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

Education-oriented Proof Assistant Based on Calculational Logic: Proof Theory Algorithms and Assessment Experience

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

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

Tree Contraction, Connected Components, Minimum Spanning Trees: a GPU Path to Vertex Fitting [PDF]

, 2014
Standard parallel computing operations are considered in the context of algorithms for solving 3D graph problems which have applications, e.g., in vertex finding in HEP.
Hobson, PR, Lopes, RHC, Reid, ID
core   +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, Kazienko, Przemysław, Stawiak, Paweł   +2 more
core   +1 more source

An Efficient Approach for Solving Time-Dependent Shortest Path Problem under Fermatean Neutrosophic Environment [PDF]

Neutrosophic Sets and Systems
Efficiently 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, Ansong Feng, Guozhan Wang, Xiqing Liu   +3 more
doaj   +1 more source