Log in

Relevant bibliographies by topics / Dijkstra’s algorithm / Journal articles

To see the other types of publications on this topic, follow the link: Dijkstra’s algorithm.

Journal articles on the topic 'Dijkstra’s algorithm'

Author: Grafiati

Published: 4 June 2021

Last updated: 14 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Dijkstra’s algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Maekawa, Kotaro, Kazuhito Sawase, and Hajime Nobuhara. "Multi-Resolution Dijkstra Method Based on Multi-Agent Simulation and its Application to Genetic Algorithm for Classroom Optimization." Journal of Advanced Computational Intelligence and Intelligent Informatics 18, no. 2 (March 20, 2014): 113–20. http://dx.doi.org/10.20965/jaciii.2014.p0113.

Full text

Abstract:

The combinatorial optimization problem of university classroom schedule assignments is formulated using multiagent simulation and genetic algorithms in the evaluation and optimization process. The method we propose consists of global and local multiagent planning. Conventional global planning requires setting subgoals manually, which became a bottleneck in optimization. To solve this problem, a multi-resolution Dijkstra method for selected autonomously, assuming eight classrooms as a real University of Tsukuba building and 250 agents, we confirmed the effectiveness of the proposed multi-resolution Dijkstra’s algorithm as for both global and local route selections, compared to the uniform Dijkstra’s method.

APA, Harvard, Vancouver, ISO, and other styles

2

Biswas, Siddhartha. "Z-Dijkstra’s Algorithm to solve Shortest Path Problem in a Z-Graph." Oriental journal of computer science and technology 10, no. 1 (March 23, 2017): 180–86. http://dx.doi.org/10.13005/ojcst/10.01.24.

Full text

Abstract:

In this paper the author introduces the notion of Z-weighted graph or Z-graph in Graph Theory, considers the Shortest Path Problem (SPP) in a Z-graph. The classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to Z-graphs. Consequently the author proposes a new algorithm called by Z-Dijkstra's Algorithm with the philosophy of the classical Dijkstra's Algorithm to solve the SPP in a Z-graph.

APA, Harvard, Vancouver, ISO, and other styles

3

Wayahdi, Muhammad Rhifky, Subhan Hafiz Nanda Ginting, and Dinur Syahputra. "Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path." International Journal of Advances in Data and Information Systems 2, no. 1 (February 1, 2021): 45–52. http://dx.doi.org/10.25008/ijadis.v2i1.1206.

Full text

Abstract:

The problem of finding the shortest path from a path or graph has been quite widely discussed. There are also many algorithms that are the solution to this problem. The purpose of this study is to analyze the Greedy, A-Star, and Dijkstra algorithms in the process of finding the shortest path. The author wants to compare the effectiveness of the three algorithms in the process of finding the shortest path in a path or graph. From the results of the research conducted, the author can conclude that the Greedy, A-Star, and Dijkstra algorithms can be a solution in determining the shortest path in a path or graph with different results. The Greedy algorithm is fast in finding solutions but tends not to find the optimal solution. While the A-Star algorithm tends to be better than the Greedy algorithm, but the path or graph must have complex data. Meanwhile, Dijkstra's algorithm in this case is better than the other two algorithms because it always gets optimal results.

APA, Harvard, Vancouver, ISO, and other styles

4

Han, Xiao Gang, Qin Lei Sun, and Jiang Wei Fan. "Parallel Dijkstra's Algorithm Based on Multi-Core and MPI." Applied Mechanics and Materials 441 (December 2013): 750–53. http://dx.doi.org/10.4028/www.scientific.net/amm.441.750.

Full text

Abstract:

Dijkstra’s algorithm is a typical but low efficiency shortest path algorithm. The parallel Dijkstra’s algorithm based on message passing interface (MPI) is efficient and easy to implement, but it’s not very suitable for PC platform. This paper describes a parallel Dijkstra’s algorithm. We designed the parallel algorithm and realized it based on multi-core PC and MPI software platform. The implementation is convenient, and the performance experiment shows that the algorithm has satisfied speedup and efficiency.

APA, Harvard, Vancouver, ISO, and other styles

5

Elkabour, Ahmed, and Dr. Rahma Teirab Abaker Haroun. "Mitigating Routing Attacks in Mobile Ad Hoc Networks." International Journal for Innovation Education and Research 7, no. 7 (July 31, 2019): 227–33. http://dx.doi.org/10.31686/ijier.vol7.iss7.1603.

Full text

Abstract:

Abstract - Mobile Ad hoc Networks have been highly vulnerable to attacks due to the dynamic nature of its network infrastructure. Among these attacks, routing attacks have received considerable attention since it could cause the most devastating damage to MANET. In existing solutions typically attempt to isolate malicious nodes based on binary or naive fuzzy response decisions. However, binary responses may result in the unexpected network partition, causing additional damages to the network infrastructure. In this paper proposes a risk-aware response mechanism to systematically cope with the identified routing attacks. To avoid the routing attacks Dijkstra’s and Destination sequenced Distance Vector algorithm are used. Dijkstra's algorithm solves the single-source shortest-path problem when all edges have non-negative weights. The primary improvement for ad hoc networks made in DSDV over conventional distance vector is the addition of a sequence number in each routing table entry. Index Terms - Intrusion response, risk aware, dempster- shafer theory, Dijkstra’s algorithm, Destination sequenced Distance Vector.

APA, Harvard, Vancouver, ISO, and other styles

6

Kudryavtsev, Yevgeniy M. "Structurally-Parametrical Optimization Technological Process by Dijkstra's Method in System Mathcad." Materials Science Forum 931 (September 2018): 1238–44. http://dx.doi.org/10.4028/www.scientific.net/msf.931.1238.

Full text

Abstract:

The article describes the procedure of structurally-parametrical optimization of technological process by Dijkstra's method with using of Dijkstra’s functional (recurrent) equation and Mathcad system. The technological process includesnof operations and each operation can be executed by various types of equipment. Expenses (cost, time, ...) on execution ofioperation bykequipment after execution byjequipment (i-1) operation are known -c(i, j, k). The algorithm of the decision of a problem by Dijkstra’s method includes two phases.The firstphase is calculations of the minimum expenses for execution of all partial technological processes, from first operation of process to the last.The secondphase is definition of the required optimum set of equipment which is carrying out all technological process with the minimum expenses from last operation of process to the first. The proposed procedure of structurally-parametrical optimization of technological process using Dijkstra’s method and Mathcad software significantly decreases time and labour costs on execution of such calculations and efficiently to execute investigations related with change of equipment parameters.

APA, Harvard, Vancouver, ISO, and other styles

7

Kumar Rao, Kavikondala Praveen, and Tamilarasan Senthil Murugan. "An Efficient Routing Algorithm for Software Defined Networking using Bellman Ford Algorithm." International Journal of Online and Biomedical Engineering (iJOE) 15, no. 14 (October 26, 2019): 87. http://dx.doi.org/10.3991/ijoe.v15i14.11546.

Full text

Abstract:

<p class="0abstract">Software-Defined Networking (SDN) is the developing technology and has the advantages of handling dynamic nodes in the network with improved performance. SDN has the problem of allocating the resources to the user with high latency and this affects the overall system performance. To solve this problem, the routing method based on Bellman Ford Algorithm (BFA) is proposed in the SDN. The Bellman-Ford has less computation time in identifying the shortest path in the nodes of SDN graph. The BFA is applied to identify the optimal path for the nodes to the user with low latency. The BFA is compared with Dijikstra’s algorithm to analyze its performance. The experimental outcome shows that the BFA has lower latency compared to the Dijkstra's algorithm. The lower computation time is achieved due to BFA has a lower magnitude time in vertices and edges compared Dijkstra's algorithm. The Dijkstra’s algorithm has the latency of 10.8 ms, while proposed BFA has the latency of 2.97ms.</p>

APA, Harvard, Vancouver, ISO, and other styles

8

Olusina, J. O., and J. B. Olaleye. "Journey to Crime Using Dijkstra’s Algorithm." Nigerian Journal of Environmental Sciences and Technology 1, no. 1 (March 2017): 1–14. http://dx.doi.org/10.36263/nijest.2017.01.0019a.

Full text

Abstract:

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 Dijkstra's Algorithm. Results show that the distribution of police stations does not correspond with the spread of crime spots.

APA, Harvard, Vancouver, ISO, and other styles

9

Nurhasanah, Fitri Yani, Windu Gata, Dwiza Riana, Muh Jamil, and Surya Fajar Saputra. "Shortest Path Finding Using Dijkstra’s Algorithm." PIKSEL : Penelitian Ilmu Komputer Sistem Embedded and Logic 9, no. 1 (March 24, 2021): 89–102. http://dx.doi.org/10.33558/piksel.v9i1.2365.

Full text

Abstract:

In the professional work, discipline is a very important to see work ethic of an employee. Discipline has also the most important element of good behavior, both as individual and social. A problem is when people on the road in finding the shortest path in order to get to the destination on time. Finding shortest path improves workers discipline and add value to employees. With the Dijkstra’s Algorithm, we can find the shortest route. The value on the edge of a graph can be expressed as the distance between nodes (roads). Through this proposed application, it easier for us to find the shortest route in a more effective time.

APA, Harvard, Vancouver, ISO, and other styles

10

Chang, Wen-Chih, Te-Hua Wang, and Yan-Da Chiu. "Board Game Supporting Learning Prim’s Algorithm and Dijkstra’s Algorithm." International Journal of Multimedia Data Engineering and Management 1, no. 4 (October 2010): 16–30. http://dx.doi.org/10.4018/jmdem.2010100102.

Full text

Abstract:

The concept of minimum spanning tree algorithms in data structure is difficult for students to learn and to imagine without practice. Usually, learners need to diagram the spanning trees with pen to realize how the minimum spanning tree algorithm works. In this paper, the authors introduce a competitive board game to motivate students to learn the concept of minimum spanning tree algorithms. They discuss the reasons why it is beneficial to combine graph theories and board game for the Dijkstra and Prim minimum spanning tree theories. In the experimental results, this paper demonstrates the board game and examines the learning feedback for the mentioned two graph theories. Advantages summarizing the benefits of combining the graph theories with board game are discussed.

APA, Harvard, Vancouver, ISO, and other styles

11

Murota, Kazuo, and Akiyoshi Shioura. "Dijkstra’s algorithm and L-concave function maximization." Mathematical Programming 145, no. 1-2 (February 5, 2013): 163–77. http://dx.doi.org/10.1007/s10107-013-0643-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

S, Nandhini, Shajitha Begum S, and Sanjay M S. "Routing Algorithm for Fastest Path – a Queuing Approach." International Journal of Engineering & Technology 7, no. 4.10 (October 2, 2018): 753. http://dx.doi.org/10.14419/ijet.v7i4.10.26107.

Full text

Abstract:

Finding a fastest route for data packets is a complex process as far as large scale network is considered. Fastest path helps to minimize the delay, data loss and in turn minimizes the total cost of the network. Dijkstra’s algorithm is one of the most commonly used algorithms for finding the shortest path from one source node to another destination node, which pertains to positive weights only. In this paper, Dijkstra’s Algorithm combined with the features of single server queuing model is presented to find the fastest route between any two given nodes. In this improvised algorithm, every edge along with its end vertices is considered as M/M/1 queuing model. The Waiting time of a packet, number of packets in the system and the probability that the queue length exceeds packets are considered along with the weight of the particular link, for the calculation of the fastest route.

APA, Harvard, Vancouver, ISO, and other styles

13

Hutapea, Yohana Permata, Chriestie E. J. C. Montolalu, and Hanny A. H. Komalig. "Dijkstra Algorithm for Determining the Shortest Path in the Case of Seven Hotels in Manado City Towards Manado’s Sam Ratulangi Airport." d'CARTESIAN 9, no. 2 (January 7, 2021): 158. http://dx.doi.org/10.35799/dc.9.2.2020.29146.

Full text

Abstract:

Manado city has many notable tourist sites, resulting in the increase of the number of tourists visiting every year. Tourists require hotels with adequate facilities for their stay, such as 4-star hotels. After visiting Manado, tourists go back to where they come from. One of the transportation mode being used is airplanes. They then need a path to go through and not the usual one; they need the shortest path to get to Sam Ratulangi airport. Based on previous research, the shortest path is modeled by Graph Theory. Hotels will be represented as vertices, and the path from each hotels and to the airport will be represented as edges. The shortest path are searched by using Dijkstra’s Algorithm then will see the difference to shortest path from google maps. Based on the analysis results, Dijkstra’s Algorithm selects the shortest path with the smallest weight. The difference between Dijkstra’s Algorithm and google maps can be concluded that, in determining the shortest path used for the trip from the 4-star hotel to the airport, Dijkstra’s Algorithm is emphasized towards short travel distance, whereas google maps is emphasized more in short travel time.

APA, Harvard, Vancouver, ISO, and other styles

14

Abbas, Mohamed Abdelhamid. "Developing the Performance of Tiling Arrays." International Journal of Computational Models and Algorithms in Medicine 2, no. 3 (July 2011): 14–25. http://dx.doi.org/10.4018/jcmam.2011070102.

Full text

Abstract:

Genomic tiling arrays are able to inspect the genome of haphazard species for which the sequence is known. The plan of proper oligonucleotide probes for such arrays is computationally difficult if features such as oligonucleotide quality and recurring regions are considered. Prior works have developed the minimal tiling path problem for the choice of oligonucleotides using Dijkstra’s shortest path algorithm to compute universal finest tiling paths from millions of candidate oligonucleotides on computers. Although Dijkstra’s algorithm works well, it is complicated and may take a long time for routers to process it and the efficiency of the network fails. In this paper, the author discusses a search approach that can decrease the average complexity time of tilling arrays. This aspiration is realized by searching for the shortest path to the probes using a faster algorithm. This paper enhances A* Algorithm and exploits the enhanced version, called A**, instead of Dijkstra’s algorithm. The enhanced version is more efficient and can decrease the average time complexity, thus increasing the performance of tiling array.

APA, Harvard, Vancouver, ISO, and other styles

15

Parsakhoo, A., and M. Jajouzadeh. "Determining an optimal path for forest road construction using Dijkstra’s algorithm." Journal of Forest Science 62, No. 6 (June 29, 2016): 264–68. http://dx.doi.org/10.17221/9/2016-jfs.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Kaur, Dr Gurusharan. "Application of Dijkstra’s Algorithm in Wireless Communication System." International Journal for Research in Applied Science and Engineering Technology 8, no. 9 (September 30, 2020): 1054–57. http://dx.doi.org/10.22214/ijraset.2020.31662.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Abdulaziz, Abdul-hafiz, Emmanuel Adewale Adedokun, and Sani Man-Yahya. "Improved Extended Dijkstra’s Algorithm for Software Defined Networks." International Journal of Applied Information Systems 12, no. 8 (November 9, 2017): 22–26. http://dx.doi.org/10.5120/ijais2017451714.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Gunkel, Christina, Alexander Stepper, Arne C. Müller, and Christine H. Müller. "Micro crack detection with Dijkstra’s shortest path algorithm." Machine Vision and Applications 23, no. 3 (February 26, 2011): 589–601. http://dx.doi.org/10.1007/s00138-011-0324-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Rachmawati, Dian, and Lysander Gustin. "Analysis of Dijkstra’s Algorithm and A* Algorithm in Shortest Path Problem." Journal of Physics: Conference Series 1566 (June 2020): 012061. http://dx.doi.org/10.1088/1742-6596/1566/1/012061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Tamatjita, Elizabeth Nurmiyati, and Aditya Wikan Mahastama. "Shortest Path with Dynamic Weight Implementation using Dijkstra’s Algorithm." ComTech: Computer, Mathematics and Engineering Applications 7, no. 3 (September 30, 2016): 161. http://dx.doi.org/10.21512/comtech.v7i3.2534.

Full text

Abstract:

Shortest path algorithms have been long applied to solve daily problems by selecting the most feasible route with minimum cost or time. However, some of the problems are not simple. This study applied the case using Dijkstra's algorithm on a graph representing street routes with two possible digraphs: one-way and twoway. Each cost was able to be changed anytime, representing the change in traffic condition. Results show that the usage of one way digraph in mapping the route does make the goal possible to reach, while the usage of twoway digraph may cause confusion although it is probably the possible choice in the real world. Both experiments showed that there are no additional computation stresses in re-calculating the shortest path while going halfway to reach the goal.

APA, Harvard, Vancouver, ISO, and other styles

21

Lewis, Rhyd. "Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties." Algorithms 13, no. 11 (October 22, 2020): 269. http://dx.doi.org/10.3390/a13110269.

Full text

Abstract:

In this paper we review many of the well-known algorithms for solving the shortest path problem in edge-weighted graphs. We then focus on a variant of this problem in which additional penalties are incurred at the vertices. These penalties can be used to model things like waiting times at road junctions and delays due to transfers in public transport. The usual way of handling such penalties is through graph expansion. As an alternative, we propose two variants of Dijkstra’s algorithm that operate on the original, unexpanded graph. Analyses are then presented to gauge the relative advantages and disadvantages of these methods. Asymptotically, compared to using Dijkstra’s algorithm on expanded graphs, our first variant is faster for very sparse graphs but slower with dense graphs. In contrast, the second variant features identical worst-case run times.

APA, Harvard, Vancouver, ISO, and other styles

22

Zhang, Yang, Lee D. Han, and Hyun Kim. "Dijkstra’s-DBSCAN: Fast, Accurate, and Routable Density Based Clustering of Traffic Incidents on Large Road Network." Transportation Research Record: Journal of the Transportation Research Board 2672, no. 45 (September 7, 2018): 265–73. http://dx.doi.org/10.1177/0361198118796071.

Full text

Abstract:

Incident hotspots are used as a direct indicator of the needs for road maintenance and infrastructure upgrade, and an important reference for investment location decisions. Previous incident hotspot identification methods are all region based, ignoring the underlying road network constraints. We first demonstrate how region based hotspot detection may be inaccurate. We then present Dijkstra’s-DBSCAN, a new network based density clustering algorithm specifically for traffic incidents which combines a modified Dijkstra’s shortest path algorithm with DBSCAN (density based spatial clustering of applications with noise). The modified Dijkstra’s algorithm, instead of returning the shortest path from a source to a target as the original algorithm does, returns a set of nodes (incidents) that are within a requested distance when traveling from the source. By retrieving the directly reachable neighbors using this modified Dijkstra’s algorithm, DBSCAN gains its awareness of network connections and measures distance more practically. It avoids clustering incidents that are close but not connected. The new approach extracts hazardous lanes instead of regions, and so is a much more precise approach for incident management purposes; it reduces the [Formula: see text] computational cost to [Formula: see text], and can process the entire U.S. network in seconds; it has routing flexibility and can extract clusters of any shape and connections; it is parallellable and can utilize distributed computing resources. Our experiments verified the new methodology’s capability of supporting safety management on a complicated surface street configuration. It also works for customized lane configuration, such as freeways, freeway junctions, interchanges, roundabouts, and other complex combinations.

APA, Harvard, Vancouver, ISO, and other styles

23

Yahya, Widhi, Achmad Basuki, and Jehn Ruey Jiang. "The Extended Dijkstra’s-based Load Balancing for OpenFlow Network." International Journal of Electrical and Computer Engineering (IJECE) 5, no. 2 (April 1, 2015): 289. http://dx.doi.org/10.11591/ijece.v5i2.pp289-296.

Full text

Abstract:

<span lang="EN-US">This paper proposes load-balancing algorithm on the basis of the Extended Dijkstra’s shortest path algorithm for Software Defined Networking (SDN). The Extended Dijkstra’s algorithm considers not only the edge weights, but also the node weights to find the nearest server for a requesting client. The proposed algorithm also considers the link load in order to avoid congestion. We use Pyretic to implement the proposed algorithm and compare it with related ones under the Abilene network topology with the Mininet emulation tool. As shown by the comparisons, the proposed algorithm outperforms the others in term of the network end-to-end latency, throughput and response time at the expense of a little heavier computation load and more memory usage on the SDN controller.</span>

APA, Harvard, Vancouver, ISO, and other styles

24

Alam, Md Almash, and Md Omar Faruq. "Finding Shortest Path for Road Network Using Dijkstra’s Algorithm." Bangladesh Journal of Multidisciplinary Scientific Research 1, no. 2 (July 29, 2019): 41–45. http://dx.doi.org/10.46281/bjmsr.v1i2.366.

Full text

Abstract:

Roads play a Major role to the people live in various states, cities, town and villages, from each and every day they travel to work, to schools, to business meetings, and to transport their goods. Even in this modern era whole world used roads, remain one of the most useful mediums used most frequently for transportation and travel. The manipulation of shortest paths between various locations appears to be a major problem in the road networks. The large range of applications and product was introduced to solve or overcome the difficulties by developing different shortest path algorithms. Even now the problem still exists to find the shortest path for road networks. Shortest Path problems are inevitable in road network applications such as city emergency handling and drive guiding system. Basic concepts of network analysis in connection with traffic issues are explored. The traffic condition among a city changes from time to time and there are usually huge amounts of requests occur, it needs to find the solution quickly. The above problems can be rectified through shortest paths by using the Dijkstra’s Algorithm. The main objective is the low cost of the implementation. The shortest path problem is to find a path between two vertices (nodes) on a given graph, such that the sum of the weights on its constituent edges is minimized. This problem has been intensively investigated over years, due to its extensive applications in graph theory, artificial intelligence, computer network and the design of transportation systems. The classic Dijkstra’s algorithm was designed to solve the single source shortest path problem for a static graph. It works starting from the source node and calculating the shortest path on the whole network. Noting that an upper bound of the distance between two nodes can be evaluated in advance on the given transportation network.

APA, Harvard, Vancouver, ISO, and other styles

25

Paryati and Krit Salahddine. "The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph." E3S Web of Conferences 297 (2021): 01062. http://dx.doi.org/10.1051/e3sconf/202129701062.

Full text

Abstract:

Kruskal’s Algorithm is an algorithm used to find the minimum spanning tree in graphical connectivity that provides the option to continue processing the least-weighted margins. In the Kruskal algorithm, ordering the weight of the ribs makes it easy to find the shortest path. This algorithm is independent in nature which will facilitate and improve path creation. Based on the results of the application system trials that have been carried out in testing and comparisons between the Kruskal algorithm and the Dijkstra algorithm, the following conclusions can be drawn: that a strength that is the existence of weight sorting will facilitate the search for the shortest path. And considering the characteristics of Kruskal’s independent algorithm, it will facilitate and improve the formation of the path. The weakness of the Kruskal algorithm is that if the number of nodes is very large, it will be slower than Dijkstra’s algorithm because it has to sort thousands of vertices first, then form a path.

APA, Harvard, Vancouver, ISO, and other styles

26

Gupta, Jagreet Das. "OPTIMIZED HIERARCHY BASED SHORTEST PATH ALGORITHM FOR ROAD NETWORK GRAPHS." Journal of Mathematical Sciences & Computational Mathematics 2, no. 1 (November 2, 2020): 169–80. http://dx.doi.org/10.15864/jmscm.2111.

Full text

Abstract:

Efficiently determining Shortest Paths on Road Maps has been a heavily engineered function for many routing apps like Google Maps & Yandex Maps for years now. Dutch computer scientist, Edsger W. Dijkstra set the stepping stone by formulating the now famous, Dijkstra’s algorithm for shortest paths. Later it was improved upon by newer algorithms like A*. We introduce a way to implement modern algorithms such as Contraction Hierarchy, Highway Hierarchy and PHAST Algorithm to find optimal shortest paths in real life scenario road maps. It bases heavily on constructing a virtual “highway” which the shortest path should pass through theoretically as they are heavily traversed in real life generally. It considers parameters such as Road Distance between nodes(Edge Weight), Importance Factor during Contraction Hierarchy Phase, Cartesian Distance From Target, External Real Time Factors like Weather and Traffic. We determine a Heuristic Function using the above parameters and then use that to run a Bi-Directional PHAST based A* from both the source and the target node and then determine the shortest path once a common highway exists in both directional search’s settled vector or a fallback stage is reached.

APA, Harvard, Vancouver, ISO, and other styles

27

Adilakshmi, S., and N. Ravi Shankar. "IMPLEMENTED MODIFIED DIJKSTRA’S ALGORITHM TO FIND PROJECT COMPLETION TIME." Advances in Mathematics: Scientific Journal 9, no. 12 (December 15, 2020): 10787–95. http://dx.doi.org/10.37418/amsj.9.12.62.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Xu, M. H., Y. Q. Liu, Q. L. Huang, Y. X. Zhang, and G. F. Luan. "An improved Dijkstra’s shortest path algorithm for sparse network." Applied Mathematics and Computation 185, no. 1 (February 2007): 247–54. http://dx.doi.org/10.1016/j.amc.2006.06.094.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Asaduzzaman, Mina, Tan Kim Geok, Ferdous Hossain, Shohel Sayeed, Azlan Abdaziz, Hin-Yong Wong, C. P. Tso, Sharif Ahmed, and Md Ahsanul Bari. "An Efficient Shortest Path Algorithm: Multi-Destinations in an Indoor Environment." Symmetry 13, no. 3 (March 5, 2021): 421. http://dx.doi.org/10.3390/sym13030421.

Full text

Abstract:

The shortest path-searching with the minimal weight for multiple destinations is a crucial need in an indoor applications, especially in supermarkets, warehouses, libraries, etc. However, when it is used for multiple item searches, its weight becomes higher as it searches only the shortest path between the single sources to each destination item separately. If the conventional Dijkstra algorithm is modified to multi-destination mode then the weight is decreased, but the output path is not considered as the real shortest path among multiple destinations items. Our proposed algorithm is more efficient for finding the shortest path among multiple destination items with minimum weight, compared to the single source single destination and modified multi-destinations of Dijkstra’s algorithm. In this research, our proposed method has been validated by real-world data as well as by simulated random solutions. Our advancement is more applicable in indoor environment applications based on multiple items or destinations searching.

APA, Harvard, Vancouver, ISO, and other styles

30

Norhafezah, K., A. H. Nurfadzliana, and O. Megawati. "Simulation of municipal solid waste route optimization by Dijkstra’s algorithm." Journal of Fundamental and Applied Sciences 9, no. 5S (January 19, 2018): 732. http://dx.doi.org/10.4314/jfas.v9i5s.52.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Kumar, Pawan. "Entropy Maximization Problem in Network using Dijkstra’s-Floyd Warshall Algorithm." International Journal of Computer Applications 181, no. 37 (January 17, 2019): 38–42. http://dx.doi.org/10.5120/ijca2019918341.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Pritee, Kumari, and Garg R.D. "Identification of Optimum Shortest Path using Multipath Dijkstra’s Algorithm Approach." International Journal of Advanced Remote Sensing and GIS 6, no. 1 (October 30, 2017): 2442–48. http://dx.doi.org/10.23953/cloud.ijarsg.321.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Ciesielski, Krzysztof Chris, Alexandre Xavier Falcão, and Paulo A. V. Miranda. "Path-Value Functions for Which Dijkstra’s Algorithm Returns Optimal Mapping." Journal of Mathematical Imaging and Vision 60, no. 7 (February 3, 2018): 1025–36. http://dx.doi.org/10.1007/s10851-018-0793-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Abbas, Qaiser, Qasim Hussain, Tehseen Zia, and Arfan Mansoor. "REDUCED SOLUTION SET SHORTEST PATH PROBLEM: CAPTON ALGORITM WITH SPECIAL REFERENCE TO DIJKSTRA’S ALGORITHM." Malaysian Journal of Computer Science 31, no. 3 (July 30, 2018): 175–87. http://dx.doi.org/10.22452/mjcs.vol31no3.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Urubkin, Mikhail, Vasiliy Galushka, Vladimir Fathi, Denis Fathi, and Sofya Petrenkova. "Programmatic implementation of the Dijkstra algorithm in the Transact-SQL language using relational algebra." E3S Web of Conferences 164 (2020): 10016. http://dx.doi.org/10.1051/e3sconf/202016410016.

Full text

Abstract:

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 the Transact-SQL language. The efficiency of the known information system architectures and the impact of various ways of distributing functions between system components are reviewed. The article describes features of the relational algebra and the Transact-SQL operations, and provides a brief description of Dijkstra’s algorithm. For its programmatic implementation, several stages are defined, for each of which a formal description of the relational operations performed on it is given. The outputs of these operations are shown using the example of the database tables, and the algorithm to find the final path is given. The issues of the proposed method’s productivity and security of programmatic implementation of the path search in a graph are discussed separately.

APA, Harvard, Vancouver, ISO, and other styles

36

Ramzaev, V. М., I. N. Khaimovich, and I. V. Martynov. "Methods for finding shortest paths on graphs in organizational and economic systems and their implementation." Information Technology and Nanotechnology, no. 2416 (2019): 368–75. http://dx.doi.org/10.18287/1613-0073-2019-2416-368-375.

Full text

Abstract:

The article implements the functions in Postgre SQL DBMS, finding the shortest paths on graphs, using the wave algorithm method, the Dijkstra’s method and the Floyd method. The authors determined models of dependencies of the running time of implementations of the shortest-path search algorithms on graphs on the number of graph vertices experimentally. A comparison of the data obtained as a result of the study was carried out to find the best applications of implementations of the shortest path search algorithms in the Postgre SQL DBMS.

APA, Harvard, Vancouver, ISO, and other styles

37

Bhowmik, B., and S. Nag Chowdhury. "Prograph Based Analysis of Single Source Shortest Path Problem with Few Distinct Positive Lengths." Engineering, Technology & Applied Science Research 1, no. 4 (August 16, 2011): 90–97. http://dx.doi.org/10.48084/etasr.41.

Full text

Abstract:

In this paper we propose an experimental study model S3P2 of a fast fully dynamic programming algorithm design technique in finite directed graphs with few distinct nonnegative real edge weights. The Bellman-Ford’s approach for shortest path problems has come out in various implementations. In this paper the approach once again is re-investigated with adjacency matrix selection in associate least running time. The model tests proposed algorithm against arbitrarily but positive valued weighted digraphs introducing notion of Prograph that speeds up finding the shortest path over previous implementations. Our experiments have established abstract results with the intention that the proposed algorithm can consistently dominate other existing algorithms for Single Source Shortest Path Problems. A comparison study is also shown among Dijkstra’s algorithm, Bellman-Ford algorithm, and our algorithm.

APA, Harvard, Vancouver, ISO, and other styles

38

Swathika, O. V. Gnana, Nilabhra Banerjee, and S. K. Pranesh. "Hybrid Kruskal’s-Dijkstra’s Algorithm for Shortest Path Identification in Reconfigurable Microgrid." Advanced Science Letters 23, no. 5 (May 1, 2017): 4215–18. http://dx.doi.org/10.1166/asl.2017.8310.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Fitriansyah, A., N. W. Parwati, D. R. Wardhani, and N. Kustian. "Dijkstra’s Algorithm to Find Shortest Path of Tourist Destination in Bali." Journal of Physics: Conference Series 1338 (October 2019): 012044. http://dx.doi.org/10.1088/1742-6596/1338/1/012044.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Sun, Yanbin, Penglin Shen, Huimin Jiang, Yuehua Zhang, Jinqiu Guan, and Lan Li. "Transport Waste Separation and Recovery Trajectory Judged Based on Dijkstra’s Algorithm." IOP Conference Series: Earth and Environmental Science 526 (July 8, 2020): 012227. http://dx.doi.org/10.1088/1755-1315/526/1/012227.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Mousaei, Ali, Hosein Taghaddos, S. Marzieh Bagheri, and Ulrich Hermann. "Optimizing Heavy Lift Plans for Industrial Construction Sites Using Dijkstra’s Algorithm." Journal of Construction Engineering and Management 147, no. 11 (November 2021): 04021160. http://dx.doi.org/10.1061/(asce)co.1943-7862.0002157.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Chernoy, Viacheslav, Mordechai Shalom, and Shmuel Zaks. "On the performance of Dijkstra’s third self-stabilizing algorithm for mutual exclusion and related algorithms." Distributed Computing 23, no. 1 (May 1, 2010): 43–60. http://dx.doi.org/10.1007/s00446-010-0104-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Barzegar, Maryam, Abolghasem Sadeghi-Niaraki, Maryam Shakeri, and Soo-Mi Choi. "An Improved Route-Finding Algorithm Using Ubiquitous Ontology-Based Experiences Modeling." Complexity 2019 (November 11, 2019): 1–15. http://dx.doi.org/10.1155/2019/9584397.

Full text

Abstract:

Every day, people are hired in different organizations and old and retiring employees are eliminated from enterprise systems. Eliminating these individuals from organizations leads to the loss of their spatial experiences. In addition, since new employees lack relevant experience, they need a long time to develop the correct skills for the company and may even cause damage to the organization during this learning process. Therefore, storing the spatial experience of individuals is a critical issue. Due to the intelligence of ubiquitous Geospatial Information System (GIS), any experience from any user can be received and stored. In the future, based on these experiences, an appropriate service to each user may be provided as needed. This paper aims to propose an ontology-based model to store spatial experiences in the field of ubiquitous GIS route finding. For this purpose, first ontology is designed for route finding, and then according to this ontology, an ontology-based route-finding algorithm is developed for ubiquitous GIS. Finally, this algorithm is implemented for Tehran, Iran, and its results are compared with the shortest path algorithm (Dijkstra’s algorithm) in terms of the route length and travel time for peak traffic time. The results show that while the route length obtained from the ontology-based algorithm is more than Dijkstra’s algorithm, the travel time is lower, and on some routes the difference in travel time saved reaches 35 minutes.

APA, Harvard, Vancouver, ISO, and other styles

44

IMRAN, ARIF, and LIANE OKDINAWATI. "ADAPTATION OF THE VARIABLE NEIGHBORHOOD SEARCH HEURISTIC TO SOLVE THE VEHICLE ROUTING PROBLEM." Jurnal Teknik Industri 12, no. 1 (March 30, 2012): 10. http://dx.doi.org/10.22219/jtiumm.vol12.no1.10-15.

Full text

Abstract:

The vehicle routing problem is investigated by using some adaptations of the variable neighborhood search (VNS).The initial solution was obtained by Dijkstra’s algorithm based on cost network constructed by the sweep algorithm andthe 2-opt. Our VNS algorithm use several neighborhoods which were adapted for this problem. In addition, a number oflocal search methods together with a diversification procedure were used. The algorithm was then tested on the data setsfrom the literature and it produced competitive results if compared to the solutions published.

APA, Harvard, Vancouver, ISO, and other styles

45

Schneck, Arne, and Klaus Nökel. "Accelerating Traffic Assignment with Customizable Contraction Hierarchies." Transportation Research Record: Journal of the Transportation Research Board 2674, no. 1 (January 2020): 188–96. http://dx.doi.org/10.1177/0361198119898455.

Full text

Abstract:

In many algorithms for traffic assignment, the most time-consuming step is shortest path search between all O–D pairs. Almost unnoticed by the transport modeling community, there has been an enormous amount of research on acceleration techniques for the shortest path problem in road networks in the past decade. These techniques usually divide the problem into a relatively expensive preprocessing phase and a significantly accelerated search phase. In this paper, the recently developed customizable contraction hierarchies are used for both shortest path search and network loading in the bi-conjugate Frank–Wolfe algorithm. For the largest test network, this approach achieves a speedup by a factor of 42 compared with a straightforward implementation of Dijkstra’s algorithm.

APA, Harvard, Vancouver, ISO, and other styles

46

Khaing, Ohnmar, Dr Htight Htight Wai, and Dr Ei Ei Myat. "Using Dijkstra’s Algorithm for Public Transportation System in Yangon Based on GIS." International Journal of Science and Engineering Applications 7, no. 11 (November 4, 2018): 442–47. http://dx.doi.org/10.7753/ijsea0711.1008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Swathika, O. V. Gnana, S. Hemamalini, Shivam Mishra, Sumedh Meher Pophali, and Nilay Alokkumar Barve. "Shortest Path Identification in Reconfigurable Microgrid Using Hybrid Bellman Ford-Dijkstra’s Algorithm." Advanced Science Letters 22, no. 10 (October 1, 2016): 2932–35. http://dx.doi.org/10.1166/asl.2016.7081.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Roghanian, E., and Z. Shakeri Kebria. "The combination of TOPSIS method and Dijkstra’s algorithm in multi-attribute routing." Scientia Iranica 24, no. 5 (October 1, 2017): 2540–49. http://dx.doi.org/10.24200/sci.2017.4390.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Kornilov, S. N., E. A. Deev, and J. I. Lukyanov. "Optimization Method of the Multimodal Transportation on the Base of Dijkstra’s Algorithm." IOP Conference Series: Earth and Environmental Science 272 (June 21, 2019): 032017. http://dx.doi.org/10.1088/1755-1315/272/3/032017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Wu, Ter-Feng, Pu-Sheng Tsai, Nien-Tsu Hu, and Jen-Yang Chen. "Combining turning point detection and Dijkstra’s algorithm to search the shortest path." Advances in Mechanical Engineering 9, no. 2 (February 2017): 168781401668335. http://dx.doi.org/10.1177/1687814016683353.

Full text

Abstract:

In this study, image processing was combined with path-planning object-avoidance technology to determine the shortest path to the destination. The content of this article comprises two parts: in the first part, image processing was used to establish a model of obstacle distribution in the environment, and boundary sequence permutation method was used to conduct orderly arrangement of edge point coordinates of all objects, to determine linking relationship between each edge point, and to individually classify objects in the image. Then, turning point detection method was used to compare the angle size between vectors before and after each edge point and to determine vertex coordinates of polygonal obstacles. In the second part, a modified Dijkstra’s algorithm was used to turn vertices of convex-shaped obstacles into network nodes, to determine the shortest path by a cost function, and to find an obstacle avoidance path connecting the start and end points. In order to verify the feasibility of the proposed architecture, an obstacle avoidance path simulation was made by the graphical user interface of the programming language MATLAB. The results show that the proposed method in path planning not only is feasible but can also obtain good results.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!