Results 11 to 20 of about 2,337,392 (235)
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 +5 more sources
Shortest Path Search Futsal Field Location With Dijkstra Algorithm [PDF]
IJCCS (Indonesian Journal of Computing and Cybernetics Systems), 2018 Pangkalpinang City is a city where futsal field rentals are experiencing growth and improvement. The number of lovers of futsal sport from outside Pangkalpinang city, especially those who are less aware of the streets in Pangkalpinang city will have ...
Delpiah Wahyuningsih, Erzal Syahreza
doaj +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.
Seifedine Nimer Kadry +2 more
openaire +3 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 +4 more sources
A QUANTUM IMPROVEMENT ON DIJKSTRA’S ALGORITHM FOR COMPUTER NETWORK ROUTING [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2008 The aim of this paper is to improve the Dijkstra algorithm which is widely used in the internet routing. Quantum computing approach is used to improve the work of Dijkstra algorithm for network routing by exploiting the massive parallelism existing in ...
Rana F. Ghani, Ahmed T. Sadik
doaj +1 more source
Teknologi Location Based Service (Global Positioning System) Pada Perangkat Mobile
ComTech, 2010 Article presents analysis and design of software using Location Based Service (LBS) that is part of communication technology based on geographic position.
Budi Yulianto
doaj +1 more source
Journal of Engineering, 2023 Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming
Sabreen Mahmood Shukr +2 more
doaj +1 more source
Targeted Multiobjective Dijkstra Algorithm: Initial Release
, 2023 This is the initial release of my implementation of the Targeted Multiobjective Dijkstra Algorithm. It is a One-to-One Multiobjective Shortest Path algorithm developed and implemented at the Zuse Institute Berlin in Germany. The algorithm development was
Pedro Maristany de las Casas
core +1 more source
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
openaire +1 more source
Journey to Crime Using Dijkstra's Algorithm [PDF]
Nigerian Journal of Environmental Sciences and Technology, 2017 This paper describes some benefits of crime mapping in a Geographic Information Systems (G.I.S.) environment. The underlining principle of Journey to Crime was discussed. Crime Spots and Police Stations in the study area were mapped, Shortest-Path, Closest Facility, Service Area and OD (Origin – Destination) Cost Matrix were determined based on ...
J. O. Olusina, J. B. Olaleye
openaire +1 more source