Relevant bibliographies by topics / Dijkstra's algorithm

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Dijkstra's algorithm'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 June 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Dijkstra's algorithm"

1

Dermawan, Tri Setya. "Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train." IJID (International Journal on Informatics for Development) 7, no. 2 (2019): 8. http://dx.doi.org/10.14421/ijid.2018.07202.

Full text
Abstract:
Abstract - The best route is the path found based on the minimum price of a train journey using the Dijkstra and Floyd-Warshall algorithms. This study aims to find out the comparison of Dijkstra and Floyd-Warshall algorithms in finding the best path on a train trip. The results of route discovery will be displayed in a web-based application using the PHP programming language and MySQL database. The results of these two algorithms are compared using 4 parameters: time complexity, memory complexity, level of completion and level of optimization.Based on the comparison results from the implementation that Dijkstra's algorithm has a time complexity of 81 faster than the Floyd-Warshall algorithm. For the memory complexity, Dijkstra's algorithm uses a memory of 512616 bytes less than the Floyd-Warshall algorithm for the executive category. Whereas for the economic category the Dijkstra algorithm uses a memory of 482488 bytes less than the Floyd-Warshall algorithm. For the level of completion of the two algorithms, there is no error. In addition, for the level of optimization the Dijkstra algorithm has advantages in this study, namely the data used is dynamic or variable data in each stage of the process.
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 (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

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 (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
4

Schulz, Frank, Dorothea Wagner, and Karsten Weihe. "Dijkstra's algorithm on-line." ACM Journal of Experimental Algorithmics 5 (December 31, 2000): 12. http://dx.doi.org/10.1145/351827.384254.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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 (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
6

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

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
7

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
8

VASILJEVIC, DRAGAN, and MILOS DANILOVIC. "A NOVEL LINEAR ALGORITHM FOR SHORTEST PATHS IN NETWORKS." Asia-Pacific Journal of Operational Research 30, no. 02 (2013): 1250054. http://dx.doi.org/10.1142/s0217595912500546.

Full text
Abstract:
We present two new linear algorithms for the single source shortest paths problem. The worst case running time of the first algorithm is O(m + C log C), where m is the number of edges of the input network and C is the ratio of the largest and the smallest edge weight. The pseudo-polynomial character of the time dependence can be overcome by the fact that Dijkstra's kind of shortest paths algorithms can be implemented "from the middle", when the shortest paths to the source are known in advance for a subset of the network vertices. This allows the processing of a subset of the edges with the proposed algorithm and processing of the rest of the edges with any Dijkstra's kind algorithm afterwards. Partial implementation of the algorithm enabled the construction of a second, highly efficient and simple linear algorithm. The proposed algorithm is efficient for all classes of networks and extremely efficient for networks with small C. The decision which classes of networks are most suitable for the proposed approach can be made based on simple parameters. Experimental efficiency analysis shows that this approach significantly reduces total computing time.
APA, Harvard, Vancouver, ISO, and other styles
9

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 (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
10

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

Dissertations / Theses on the topic "Dijkstra's algorithm"

1

Yarmolskyy, Oleksandr. "Využití distribuovaných a stochastických algoritmů v síti." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2018. http://www.nusl.cz/ntk/nusl-370918.

Full text
Abstract:
This thesis deals with the distributed and stochastic algorithms including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Furthermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in Matlab.
APA, Harvard, Vancouver, ISO, and other styles
2

Ward, Paul. "A Scalable Partial-Order Data Structure for Distributed-System Observation." Thesis, University of Waterloo, 2001. http://hdl.handle.net/10012/1161.

Full text
Abstract:
Distributed-system observation is foundational to understanding and controlling distributed computations. Existing tools for distributed-system observation are constrained in the size of computation that they can observe by three fundamental problems. They lack scalable information collection, scalable data-structures for storing and querying the information collected, and scalable information-abstraction schemes. This dissertation addresses the second of these problems. Two core problems were identified in providing a scalable data structure. First, in spite of the existence of several distributed-system-observation tools, the requirements of such a structure were not well-defined. Rather, current tools appear to be built on the basis of events as the core data structure. Events were assigned logical timestamps, typically Fidge/Mattern, as needed to capture causality. Algorithms then took advantage of additional properties of these timestamps that are not explicit in the formal semantics. This dissertation defines the data-structure interface precisely, and goes some way toward reworking algorithms in terms of that interface. The second problem is providing an efficient, scalable implementation for the defined data structure. The key issue in solving this is to provide a scalable precedence-test operation. Current tools use the Fidge/Mattern timestamp for this. While this provides a constant-time test, it requires space per event equal to the number of processes. As the number of processes increases, the space consumption becomes sufficient to affect the precedence-test time because of caching effects. It also becomes problematic when the timestamps need to be copied between processes or written to a file. Worse, existing theory suggested that the space-consumption requirement of Fidge/Mattern timestamps was optimal. In this dissertation we present two alternate timestamp algorithms that require substantially less space than does the Fidge/Mattern algorithm.
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Ning. "Shortest Path Queries in Very Large Spatial Databases." Thesis, University of Waterloo, 2001. http://hdl.handle.net/10012/1156.

Full text
Abstract:
Finding the shortest paths in a graph has been studied for a long time, and there are many main memory based algorithms dealing with this problem. Among these, Dijkstra's shortest path algorithm is one of the most commonly used efficient algorithms to the non-negative graphs. Even more efficient algorithms have been developed recently for graphs with particular properties such as the weights of edges fall into a range of integer. All of the mentioned algorithms require the graph totally reside in the main memory. Howevery, for very large graphs, such as the digital maps managed by Geographic Information Systems (GIS), the requirement cannot be satisfied in most cases, so the algorithms mentioned above are not appropriate. My objective in this thesis is to design and evaluate the performance of external memory (disk-based) shortest path algorithms and data structures to solve the shortest path problem in very large digital maps. In particular the following questions are studied:What have other researchers done on the shortest path queries in very large digital maps?What could be improved on the previous works? How efficient are our new shortest paths algorithms on the digital maps, and what factors affect the efficiency? What can be done based on the algorithm? In this thesis, we give a disk-based Dijkstra's-like algorithm to answer shortest path queries based on pre-processing information. Experiments based on our Java implementation are given to show what factors affect the running time of our algorithms.
APA, Harvard, Vancouver, ISO, and other styles
4

Williams, Vincent Troy. "An Experimental Study of Distance Sensitivity Oracles." Scholar Commons, 2010. http://scholarcommons.usf.edu/etd/3697.

Full text
Abstract:
The paper \A Nearly Optimal Oracle for Avoiding Failed Vertices and Edges" by Aaron Bernstein and David Karger lays out a nearly optimal algorithm for nding the shortest distances and paths between vertices with any given single failure in constant time without reconstructing the oracle. Using their paper as a guideline, we have implemented their algorithm in C++ and recorded each step in this thesis. Each step has its own pseudo-code and its own analysis to prove that the entire oracle construction stays within the stated running time and total space bounds, from the authors. The effciency of the algorithm is compared against that of the brute-force methods total running time and total space needed. Using multiple test cases with an increasing number of vertices and edges, we have experimentally validated that their algorithm holds true to their statements of space, running time, and query time.
APA, Harvard, Vancouver, ISO, and other styles
5

Silva, Inara Soldera Romano da [UNESP]. "Utilização de um algoritmo de caminho mínimo no processo de recolhimento do palhiço da cana-de-açúcar." Universidade Estadual Paulista (UNESP), 2009. http://hdl.handle.net/11449/90600.

Full text
Abstract:
Made available in DSpace on 2014-06-11T19:24:42Z (GMT). No. of bitstreams: 0 Previous issue date: 2009-12-16Bitstream added on 2014-06-13T19:52:21Z : No. of bitstreams: 1 silva_isr_me_botfca.pdf: 1100428 bytes, checksum: 826dc0fb9625c7e450be2699f43ec0bd (MD5)<br>A atual preocupação com o meio ambiente tem feito com que empresas produtoras de cana-de-açúcar invistam na mudança do sistema de colheita. Essa mudança consiste na redução da queima do canavial na pré-colheita e na utilização do corte mecanizado com cana crua. Porém, a colheita com corte mecanizado torna disponível a biomassa residual e sem as queimadas e com o maior acúmulo do palhiço sobre o solo, criamse condições favoráveis para o aparecimento de parasitas e atraso da brota da cana, comprometendo a próxima safra. Vários autores mostram a viabilidade do uso do palhiço na produção de energia. Pois, além do potencial energético desta biomassa, têm-se como vantagens as questões ambientais, a manutenção de empregos e a substituição dos recursos energéticos de fontes naturais. Mas, as grandes dificuldades ainda encontradas para aproveitamento desse resíduo para geração de energia são o grande número de maquinário envolvido no sistema de coleta deste resíduo e o alto custo que este processo demanda, principalmente o custo com transporte. O presente trabalho tem como objetivo propor aplicações de técnicas matemáticas de otimização para auxiliar o planejamento do recolhimento do palhiço da cana-de-açúcar para aproveitamento na geração de energia, estudando a melhor forma de carregamento dos fardos de palhiço, facilitando o transporte, diminuindo custos e desgastes de maquinários. Para isto, é sugerido o uso de técnicas de agricultura de precisão para mapear o palhiço enfardado, desta forma pode-se definir uma rota para recolher os fardos no campo e transportá-los para o centro de processamento. Para determinação da rota, propõe-se o uso do algoritmo de menor caminho da teoria de grafos, utilizando uma variação do algoritmo de Dijkstra.<br>The current concern with the environment has made sugar cane growers invest in changing their harvesting system. This change consists of the reduced burning of cane fields before harvesting and the use of mechanized cutting for raw canes. However, mechanized harvesting makes residual biomass available and, without the burning, the major accumulation of crop residue on the ground, creating favorable conditions for the emergence of parasites and delay of new shoots, affecting the next crop. Several authors show the feasibility of using crop residue for energy production. Besides the energy potential of the biomass, there are advantages for the environmental issues, preservation of jobs and the replacement of energy resources from natural sources. But the great difficulties still found in using this residue for power generation are the large number of machinery involved in the collection system of the waste and the high costs of this process, mainly transport costs. This paper aims to propose applications of mathematical optimization techniques to help plan the collection of sugar cane crop residue to be used for power generation, by studying the best way of loading bales of crop residue, making it easy to transport them, therefore reducing costs and wear on machinery. For this, we suggested the use of techniques of Precision Agriculture to map the baled crop residue, which allows you to define a route to pick up the bales in the field and transport them to the processing center. To determine the route, it is proposed to use the shortest path algorithm from graph theory, using a variation of Dijkstra's algorithm.
APA, Harvard, Vancouver, ISO, and other styles
6

Дорогін, Ілля Ростиславович. "Автоматизована система швидкого реагування на екстрені ситуації для мобільної платформи". Bachelor's thesis, КПІ ім. Ігоря Сікорського, 2019. https://ela.kpi.ua/handle/123456789/30986.

Full text
Abstract:
Структура та обсяг роботи. Пояснювальна записка дипломного проекту складається з шести розділів, містить 113 сторінок, 40 рисунків, 15 таблиць, 1 додатку, 19 джерел. Дипломний проект присвячений розробці автоматизованої системи швидкого реагування на екстрені ситуації. Цілями розробки є: прискорення процесу виклику екстренних служб, збільшення інформативності даних про виклик, автоматизація процесу диспетчеризації екстрених ситуацій. У розділі загальних положень детально описано предметне середовище, розглянуто процес діяльності та функціональну модель. Наведено огляд наявних аналогів, а також постановка задачі, де поставлено чіткі цілі розробки та задачі, необхідні для їх досягнення. Розділ інформаційного забезпечення присвячений опису вхідних та вихідних даних системи, структури бази даних та масивів інформації. Розділ математичного забезпечення складається з змістовної та математичної постановки задачі про найкоротший шлях, обґрунтування методу розв’язання та опису алгоритму Дейкстри з наведеним прикладом. У розділі програмного та технічного забезпечення описано засоби розробки, поставлені вимоги до технічного забезпечення, а також детально розглянута архітектура програмного забезпечення. У технологічному розділі представлене керівництво користувача та описано результати випробуваня програмного забезпечення.<br>Structure and scope of work. The explanatory note of the graduation project consists of six sections, containing 113 pages, 40 pictures, 15 tables, 1 application, 19 sources. This graduation project is dedicated to the development of Automated emergency response system for mobile platform. In the section of the general provisions, the processes of activity, the subject environment and the available analogues of the software product were considered. In the section of the information support, the input and output data are considered, the database is described. In mathematical section presents the mathematical formulation of the problem, the general formulation of the problem, algorithms for solving shortest path problem overview, and demonstration of the Dijkstra's algorithm. In the software section, the structure of classes, their relations and interactions in sequence and the main components of the program are presented. The requirements for the technical support are specified. The technology section provides user guides and software test methods.
APA, Harvard, Vancouver, ISO, and other styles
7

Barreto, Maurício Beraldin. "Estratégias para Planejamento e Recomposição em Redes de Telecomunicações." Universidade do Vale do Rio dos Sinos, 2011. http://www.repositorio.jesuita.org.br/handle/UNISINOS/4567.

Full text
Abstract:
Submitted by William Justo Figueiro (williamjf) on 2015-07-18T13:23:58Z No. of bitstreams: 1 51c.pdf: 3316384 bytes, checksum: 9eb62dc3d062f0ca82674a6d3feb7fdc (MD5)<br>Made available in DSpace on 2015-07-18T13:23:58Z (GMT). No. of bitstreams: 1 51c.pdf: 3316384 bytes, checksum: 9eb62dc3d062f0ca82674a6d3feb7fdc (MD5) Previous issue date: 2011-03-29<br>Nenhuma<br>O crescimento do tráfego nas redes de telecomunicações por serviços de banda larga, telefonia fixa e móvel tem demandado esforços no planejamento e estudo da recomposição da rede, em especial redes de transporte, tornando elevado o nível de complexidade na elaboração de projetos que envolvem redes. A complexidade de interligação aumenta de acordo com as restrições impostas pela capacidade de investimentos e custos operacionais na obtenção da solução ótima para a melhor topologia de rede. Para resolver problemas de planejamento e recomposição da rede de telecomunicações é necessária a utilização de recurso computacional, pois problemas que envolvem redes desta natureza possuem a característica do conjunto de problemas de otimização combinatória, considerados difíceis. Com o objetivo de planejar e realizar estudos na recomposição da rede de telecomunicações, neste trabalho é apresentada a estratégia que visa o uso de recursos heurísticos como algoritmo genético e Dijkstra, bem como o conceito de rede fictícia na modelagem e solução computacional na obtenção da solução ótima referente à topologia de rede, possibilitando a análise prévia do tráfego na topologia proposta caso houver a incidência de falhas.<br>The growth of traffic on telecommunications networks for broadband services, fixed and mobile telephony has demanded efforts in planning and study the restoration of the network, especially transport networks, making the high level of complexity in developing projects that involve networks. The interconnection complexity increases with the restrictions imposed by the capacity of investment and operating costs in obtaining the optimal solution for the best network topology. To resolve issues of planning and rebuilding of the telecommunication networks is necessary to use computational resources, since problems involving networks of this nature have the feature set of combinatorial optimization problems, considered difficult. With the objective to plan and carry out studies on the recomposition of the telecommunications network, in this work the strategy for use as heuristic genetic algorithm and Dijkstra, as well as the concept of fictitious network modeling and computational solution to obtain the solution great on the network topology, enabling preliminary analysis of traffic on the proposed topology where there incidence of failures.
APA, Harvard, Vancouver, ISO, and other styles
8

Krauter, Michal. "Nejkratší cesty v grafu." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2009. http://www.nusl.cz/ntk/nusl-236740.

Full text
Abstract:
This thesis deals with shortest paths problem in graphs. Shortest paths problem is the basic issue of graph theory with many pracitcal applications. We can divide this problem into two following generalizations: single-source shortest path problem and all-pairs shortest paths problem. This text introduces principles and algorithms for generalizations. We describe both classical and new more efficient methods. It contains information about how some of these algorithms were implemented and offers an experimental comparison of these algorithms.
APA, Harvard, Vancouver, ISO, and other styles
9

Silva, Inara Soldera Romano da 1982. "Utilização de um algoritmo de caminho mínimo no processo de recolhimento do palhiço da cana-de-açúcar /." Botucatu : [s.n.], 2009. http://hdl.handle.net/11449/90600.

Full text
Abstract:
Orientador: Helenice de Oliveira Florentino Silva<br>Banca: Adriana Cristina Cherri Nicola<br>Banca: Odivaldo José Seraphim<br>Resumo: A atual preocupação com o meio ambiente tem feito com que empresas produtoras de cana-de-açúcar invistam na mudança do sistema de colheita. Essa mudança consiste na redução da queima do canavial na pré-colheita e na utilização do corte mecanizado com cana crua. Porém, a colheita com corte mecanizado torna disponível a biomassa residual e sem as queimadas e com o maior acúmulo do palhiço sobre o solo, criamse condições favoráveis para o aparecimento de parasitas e atraso da brota da cana, comprometendo a próxima safra. Vários autores mostram a viabilidade do uso do palhiço na produção de energia. Pois, além do potencial energético desta biomassa, têm-se como vantagens as questões ambientais, a manutenção de empregos e a substituição dos recursos energéticos de fontes naturais. Mas, as grandes dificuldades ainda encontradas para aproveitamento desse resíduo para geração de energia são o grande número de maquinário envolvido no sistema de coleta deste resíduo e o alto custo que este processo demanda, principalmente o custo com transporte. O presente trabalho tem como objetivo propor aplicações de técnicas matemáticas de otimização para auxiliar o planejamento do recolhimento do palhiço da cana-de-açúcar para aproveitamento na geração de energia, estudando a melhor forma de carregamento dos fardos de palhiço, facilitando o transporte, diminuindo custos e desgastes de maquinários. Para isto, é sugerido o uso de técnicas de agricultura de precisão para mapear o palhiço enfardado, desta forma pode-se definir uma rota para recolher os fardos no campo e transportá-los para o centro de processamento. Para determinação da rota, propõe-se o uso do algoritmo de menor caminho da teoria de grafos, utilizando uma variação do algoritmo de Dijkstra.<br>Abstract: The current concern with the environment has made sugar cane growers invest in changing their harvesting system. This change consists of the reduced burning of cane fields before harvesting and the use of mechanized cutting for raw canes. However, mechanized harvesting makes residual biomass available and, without the burning, the major accumulation of crop residue on the ground, creating favorable conditions for the emergence of parasites and delay of new shoots, affecting the next crop. Several authors show the feasibility of using crop residue for energy production. Besides the energy potential of the biomass, there are advantages for the environmental issues, preservation of jobs and the replacement of energy resources from natural sources. But the great difficulties still found in using this residue for power generation are the large number of machinery involved in the collection system of the waste and the high costs of this process, mainly transport costs. This paper aims to propose applications of mathematical optimization techniques to help plan the collection of sugar cane crop residue to be used for power generation, by studying the best way of loading bales of crop residue, making it easy to transport them, therefore reducing costs and wear on machinery. For this, we suggested the use of techniques of Precision Agriculture to map the baled crop residue, which allows you to define a route to pick up the bales in the field and transport them to the processing center. To determine the route, it is proposed to use the shortest path algorithm from graph theory, using a variation of Dijkstra's algorithm.<br>Mestre
APA, Harvard, Vancouver, ISO, and other styles
10

Bergdorf, Johan, and Jesper Norman. "Compressing sparse graphs to speed up Dijkstra’s shortest path algorithm." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166730.

Full text
Abstract:
One of the problems that arises from the continuously growing amount of data is that it slows down and limits the uses of large graphs in real world situations. Because of this, studies are being done to investigate the possibility of compressing data in large graphs. This report presents an investigation on the usefulness of compressing sparse graphs and then applying Dijkstra’s shortest path algorithm. A minimal spanning tree algorithm was used to compress a graph and compared with a self-implemented compression algorithm. The minimal distances and how long time it takes for Dijkstra's algorithm to find the shortest path between nodes are investigated. The results show that it is not worth compressing the type of sparse graphs used in this study. It is hard to compress the graph without losing too much of the edges that preserve the shortest paths. The time gained when running Dijkstra's algorithm on the compressed graphs is not enough to compensate for the lack of getting a good shortest path solution.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Dijkstra's algorithm"

1

Anand, Sachin. Graph theory and algorithms:implementation of Dijkstra's shortest path algorithm in Java. Oxford Brookes University, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Newman, Mark. Computer algorithms. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198805090.003.0008.

Full text
Abstract:
This chapter introduces some of the fundamental concepts of numerical network calculations. The chapter starts with a discussion of basic concepts of computational complexity and data structures for storing network data, then progresses to the description and analysis of algorithms for a range of network calculations: breadth-first search and its use for calculating shortest paths, shortest distances, components, closeness, and betweenness; Dijkstra's algorithm for shortest paths and distances on weighted networks; and the augmenting path algorithm for calculating maximum flows, minimum cut sets, and independent paths in networks.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Dijkstra's algorithm"

1

Crauser, A., K. Mehlhorn, U. Meyer, and P. Sanders. "A parallelization of Dijkstra's shortest path algorithm." In Mathematical Foundations of Computer Science 1998. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0055823.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mohan, Anshuman, Wei Xiang Leow, and Aquinas Hobor. "Functional Correctness of C Implementations of Dijkstra’s, Kruskal’s, and Prim’s Algorithms." In Computer Aided Verification. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_37.

Full text
Abstract:
AbstractWe develop machine-checked verifications of the full functional correctness of C implementations of the eponymous graph algorithms of Dijkstra, Kruskal, and Prim. We extend Wang et al.’s CertiGraph platform to reason about labels on edges, undirected graphs, and common spatial representations of edge-labeled graphs such as adjacency matrices and edge lists. We certify binary heaps, including Floyd’s bottom-up heap construction, heapsort, and increase/decrease priority.Our verifications uncover subtle overflows implicit in standard textbook code, including a nontrivial bound on edge weights necessary to execute Dijkstra’s algorithm; we show that the intuitive guess fails and provide a workable refinement. We observe that the common notion that Prim’s algorithm requires a connected graph is wrong: we verify that a standard textbook implementation of Prim’s algorithm can compute minimum spanning forests without finding components first. Our verification of Kruskal’s algorithm reasons about two graphs simultaneously: the undirected graph undergoing MSF construction, and the directed graph representing the forest inside union-find. Our binary heap verification exposes precise bounds for the heap to operate correctly, avoids a subtle overflow error, and shows how to recycle keys to avoid overflow.
APA, Harvard, Vancouver, ISO, and other styles
3

Mérida-Casermeiro, E., J. Muñoz-Pérez, and R. Benítez-Rochel. "Neural Implementation of Dijkstra’s Algorithm." In Computational Methods in Neural Modeling. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44868-3_44.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tadimety, Phani Raj. "Dijkstra’s Algorithm – The Closest Look." In OSPF: A Network Routing Protocol. Apress, 2015. http://dx.doi.org/10.1007/978-1-4842-1410-7_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Tadimety, Phani Raj. "Dijkstra’s Algorithm — The First Look." In OSPF: A Network Routing Protocol. Apress, 2015. http://dx.doi.org/10.1007/978-1-4842-1410-7_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kadry, Seifedine, Ayman Abdallah, and Chibli Joumaa. "On the Optimization of Dijkstra’s Algorithm." In Informatics in Control, Automation and Robotics. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25992-0_55.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Youming, Ardian Greca, and James Harris. "On Dijkstra’s Algorithm for Deadlock Detection." In Advanced Techniques in Computing Sciences and Software Engineering. Springer Netherlands, 2009. http://dx.doi.org/10.1007/978-90-481-3660-5_66.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Möhring, Rolf H., Heiko Schilling, Birk Schütz, Dorothea Wagner, and Thomas Willhalm. "Partitioning Graphs to Speed Up Dijkstra’s Algorithm." In Experimental and Efficient Algorithms. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11427186_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Schulz, Frank, Dorothea Wagner, and Karsten Weihe. "Dijkstra’s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport." In Algorithm Engineering. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48318-7_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dolev, Shlomi, and Ted Herman. "Dijkstra’s Self-Stabilizing Algorithm in Unsupportive Environments." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45438-1_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Dijkstra's algorithm"

1

Li, Duanling, and Kun Niu. "Dijkstra's algorithm in AGV." In 2014 IEEE 9th Conference on Industrial Electronics and Applications (ICIEA). IEEE, 2014. http://dx.doi.org/10.1109/iciea.2014.6931472.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lanning, Daniel R., Gregory K. Harrell, and Jin Wang. "Dijkstra's algorithm and Google maps." In the 2014 ACM Southeast Regional Conference. ACM Press, 2014. http://dx.doi.org/10.1145/2638404.2638494.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Shu-xi, and Xing-qiu Zhao. "The improved Dijkstra's shortest path algorithm." In 2011 Seventh International Conference on Natural Computation (ICNC). IEEE, 2011. http://dx.doi.org/10.1109/icnc.2011.6022589.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Parra, Octavio J. Salcedo, Cristyan Manta, and Gustavo Lopez Rubio. "Dijkstra's Algorithm Model over MPLS / GMPLS." In 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2011. http://dx.doi.org/10.1109/wicom.2011.6040536.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Parulekar, M., V. Padte, T. Shah, K. Shroff, and R. Shetty. "Automatic vehicle navigation using Dijkstra's Algorithm." In 2013 International Conference on Advances in Technology and Engineering (ICATE 2013). IEEE, 2013. http://dx.doi.org/10.1109/icadte.2013.6524721.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Xiang-ying, Guo-shun Li, and Sheng-tian Zhang. "Routing Space Internet Based on Dijkstra's Algorithm." In 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing. IEEE, 2010. http://dx.doi.org/10.1109/nswctc.2010.163.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Xiang-ying, Guo-shun Li, and Sheng-tian Zhang. "Routing space Internet based on Dijkstra's algorithm." In 2009 First Asian Himalayas International Conference on Internet (AH-ICI). IEEE, 2009. http://dx.doi.org/10.1109/ahici.2009.5340354.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bozyigit, Alican, Gazihan Alankus, and Efendi Nasiboglu. "Public transport route planning: Modified dijkstra's algorithm." In 2017 International Conference on Computer Science and Engineering (UBMK). IEEE, 2017. http://dx.doi.org/10.1109/ubmk.2017.8093444.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ros-Giralt, Jordi, Alan Commike, Peter Cullen, and Richard Lethin. "Accelerating Dijkstra's Algorithm Using Multiresolution Priority Queues." In 2018 IEEE High Performance Extreme Computing Conference (HPEC). IEEE, 2018. http://dx.doi.org/10.1109/hpec.2018.8547539.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Wen-Zhi. "Resource allocation model based on Dijkstra's algorithm." In 2015 International Workshop on Materials, Manufacturing Technology, Electronics and Information Science. WORLD SCIENTIFIC, 2016. http://dx.doi.org/10.1142/9789813109384_0040.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Dijkstra's algorithm"

1

Striuk, Andrii, Olena Rybalchenko, and Svitlana Bilashenko. Development and Using of a Virtual Laboratory to Study the Graph Algorithms for Bachelors of Software Engineering. [б. в.], 2020. http://dx.doi.org/10.31812/123456789/4462.

Full text
Abstract:
The paper presents an analysis of the importance of studying graph algorithms, the reasons for the need to implement this project and its subsequent use. The existing analogues analysis is carried out, due to which a list of advantages and disadvantages is formed and taken into account in developing the virtual laboratory. A web application is created that clearly illustrates the work of graph algorithms, such as Depth-First Search, Dijkstra’s Shortest Path, Floyd- Warshall, Kruskal Minimum Cost Spanning Tree Algorithm. A simple and user- friendly interface is developed and it is supported by all popular browsers. The software product is provided with user registration and authorization functions, chat communication, personal cabinet editing and viewing the statistics on web- application use. An additional condition is taken into account at the design stage, namely the flexibility of the architecture, which envisaged the possibility of easy expansion of an existing functionality. Virtual laboratory is used at Kryvyi Rih National University to training students of specialty 121 Software Engineering in the disciplines “Algorithms and Data Structures” and “Discrete Structures”.
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!

To the bibliography