Results 11 to 20 of about 5,425,704 (264)
APLIKASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN RUTE TERPENDEK DARI KAMPUS A KE B UIN RADEN FATAH
E-Jurnal Matematika, 2021 Finding the shortest direction is one of the options that have been considered while traveling. One of the problems that occur for lecturers, staff, and students of UIN Raden Fatah is determining the shortest direction from Campus A to B. The application
RENDI SAPUTRAMA, HARTATIANA HARTATIANA
doaj +1 more source
Targeted multiobjective Dijkstra algorithm
Networks, 2023 We introduce the Targeted Multiobjective Dijkstra Algorithm (T‐MDA), a label setting algorithm for the One‐to‐One Multiobjective Shortest Path (MOSP) Problem. It is based on the recently published Multiobjective Dijkstra Algorithm (MDA) and equips it with A*‐like techniques.
Pedro Maristany de las Casas +3 more
openaire +3 more sources
Sustainability, 2022 In the event of a flood, the choice of evacuation routes is vital for personnel security. This is particularly true when road factors play an important role in evacuation time.
Yang Zhu +8 more
semanticscholar +1 more source
Implementation of Dijkstra's Algorithm to Determine the Shortest Route in a City
Journal of Computer Science, Information Technologi and Telecommunication Engineering, 2021 This study discusses the search for the shortest route from city A to city G using the Dijkstra algorithm based on distance traveled. Dijkstra's algorithm is one of the algorithms used to solve the shortest path and does not have a negative cost.
M. F. Fahroza +3 more
semanticscholar +1 more source
Open pit limit optimization using dijkstra’s algorithm [PDF]
International Journal of Mining and Geo-Engineering, 2020 In open-pit mine planning, the design of the most profitable ultimate pit limit is a prerequisite to developing a feasible mining sequence. Currently, the design of an ultimate pit is achieved through a computer program in most mining companies.
Mehdi Najafi +2 more
doaj +1 more source
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.
Seifedine Nimer Kadry +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.
Martino Bardi +1 more
openaire +3 more sources
Flight-schedule using Dijkstra's algorithm with comparison of routes findings
International Journal of Electrical and Computer Engineering (IJECE), 2022 The Dijkstra algorithm, also termed the shortest-route algorithm, is a model that is categorized within the search algorithms. Its purpose is to discover the shortest-route, from the beginning node (origin node) to any node on the tracks, and is applied ...
I. Salem +4 more
semanticscholar +1 more source
Sensors, 2023 This paper presents a novel approach for network slicing in 5G backhaul networks, targeting services with low or very low latency requirements. We propose a modified A* algorithm that incorporates network quality of service parameters into a composite ...
Robert Botez +4 more
doaj +1 more source
Programmatic implementation of the Dijkstra algorithm in the Transact-SQL language using relational algebra [PDF]
E3S Web of Conferences, 2020 The article is devoted to the topical issue of data processing in the database management systems. It presents a solution to the problem of finding paths in a graph using Dijkstra’s algorithm, set as a sequence of relational operations and functions of ...
Urubkin Mikhail +4 more
doaj +1 more source