Log in

Relevant bibliographies by topics / Bellman-Ford algorithm / Journal articles

To see the other types of publications on this topic, follow the link: Bellman-Ford algorithm.

Journal articles on the topic 'Bellman-Ford algorithm'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

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 'Bellman-Ford 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

Afivah and Meira Perma Dewi. "Bellman-Ford Algorithm for Shortest Path Selection." Rangkiang Mathematics Journal 4, no. 1 (2025): 1–5. https://doi.org/10.24036/rmj.v4i1.65.

Full text

Abstract:

Determining the shortest path from one point to another (destination) is a problem often encountered in life. With the development of science and technology, the problem of finding the shortest path can be solved using various algorithms. The algorithm that is often used to find the shortest route is the Bellman-Ford algorithm. The Bellman-Ford algorithm requires initial location parameters and a destination as input to determine the shortest path. The algorithm's results provide the shortest distance along with the route from the initial location to the destination. Applying the Bellman-Ford

APA, Harvard, Vancouver, ISO, and other styles

2

Saxena, Mohit Chandra, Munish Sabharwal, and Preeti Bajaj. "An Optimised Shortest Path Algorithm for Network Rotuting & SDN." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 8s (2023): 20–31. http://dx.doi.org/10.17762/ijritcc.v11i8s.7172.

Full text

Abstract:

Network routing algorithms form the backbone of data transmission in modern network architectures, with implications for efficiency, speed, and reliability. This research aims to critically investigate and compare three prominent routing algorithms: Bellman-Ford, Shortest Path Faster Algorithm (SPFA), and our novel improved variant of Bellman-Ford, the Space-efficient Cost-Balancing Bellman-Ford (SCBF). We evaluate the performance of these algorithms in terms of time and space complexity, memory utilization, and routing efficacy, within a simulated network environment. Our results indicate tha

APA, Harvard, Vancouver, ISO, and other styles

3

Prasetyo Wibowo Yunanto. "Modification of Shortest Path Algorithm for Ambulance in Various Road Conditions for Emergency Patients." Journal of Information Systems Engineering and Management 10, no. 28s (2025): 19–31. https://doi.org/10.52783/jisem.v10i28s.4301.

Full text

Abstract:

Road conditions and quality can significantly affect ambulance arrival time. Arrival time can be optimized by choosing the shortest route free from potential congestion. Patient safety during the journey is an essential factor that must be considered. Poor road conditions are one of the factors that can affect patient safety. This study aims to provide ambulance navigation by choosing the shortest safe route for emergency patients in various road conditions. The simulation of finding the shortest route using the modified A* algorithm and the Bellman-Ford algorithm to avoid routes with specific

APA, Harvard, Vancouver, ISO, and other styles

4

Dinitz, Yefim, and Rotem Itzhak. "Hybrid Bellman–Ford–Dijkstra algorithm." Journal of Discrete Algorithms 42 (January 2017): 35–44. http://dx.doi.org/10.1016/j.jda.2017.01.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Rai, Avinish. "A Study on Bellman Ford Algorithm for Shortest Path Detection in Global Positioning System." International Journal for Research in Applied Science and Engineering Technology 10, no. 5 (2022): 2118–26. http://dx.doi.org/10.22214/ijraset.2022.42720.

Full text

Abstract:

Abstract: This is the Master of Technology project report of Mr. Avinish Rai (Roll No- MT/CS/45001/20), final year student in the department of Computer Science and Engineering, Birla Institute of Technology, under the supervision and guidance of Dr Ila Sahay Dayal. The thesis deals with Bellman ford algorithms is used to find the optimal shortest path between two or more than two nodes in the graph or in the tree. In this paper we add this bellman ford functionality in the G.P.S. this algorithm will work as the parameter in this and use from the initial node to target or source node. We will

APA, Harvard, Vancouver, ISO, and other styles

6

Motghare, Preshit, Gaurav Ulekar, Sudarshan Biradar, and Prof Dipti Pandit. "Hybrid Algorithm Combining Bellman-Ford, Dijkstra, and Machine Learning for Dynamic Network Routing." International Journal for Research in Applied Science and Engineering Technology 12, no. 11 (2024): 2368–77. https://doi.org/10.22214/ijraset.2024.65581.

Full text

Abstract:

Abstract: Optimizing routing in dynamic networks has emerged as an increasingly important problem today with re- duced latency, guaranteed connectivity and efficient data trans- fer under a variety of changing conditions. Among the more well known shortest path algorithms those of Bellman-Ford and Dijkstra’s have very notable advantages and disadvantages themselves; while Bellman-Ford has provisions against negative weighted edges and pays a penalty in computation, Dijkstra’s algorithm cannot work with negative weighted edges but is highly efficient. It introduces a new hybrid routing algorith

APA, Harvard, Vancouver, ISO, and other styles

7

Cholla, Dr Raman. "Optimizing the Bellman-Ford Algorithm Using GPU Parallelization." INTERNATIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT 09, no. 05 (2025): 1–9. https://doi.org/10.55041/ijsrem47660.

Full text

Abstract:

ABSTRACT The Bellman-Ford algorithm's temporal complexity of O(VE) renders it ineffective for big and dense networks, which is a serious computational disadvantage. The need for effective algorithms that can handle large-scale graph structures has increased due to the modern digital landscape's rapid data expansion. The Single Source Shortest Path (SSSP) problem, which entails determining the shortest pathways from a single source vertex to every other vertex in a graph, is one of the most basic and extensively researched topics in graph theory. Numerous real-world applications, including biol

APA, Harvard, Vancouver, ISO, and other styles

8

Yaddarabullah, Yaddarabullah. "Modifikasi Algoritme Bellman-Ford Untuk Pencarian Rute Terpendek Berdasarkan Kondisi Jalan." Jurnal Teknologi dan Sistem Komputer 7, no. 3 (2019): 109–15. http://dx.doi.org/10.14710/jtsiskom.7.3.2019.109-115.

Full text

Abstract:

The application of the Bellman-ford algorithm for finding the shortest path both weighted and unweighted graph has a weakness in determining the shortest path based on road conditions. This study modified the Bellman-Ford algorithm by adding the Technique for Order of Preference by Similarity to the Ideal Solution method to provide alternative road assessments based on its condition criteria including road density, road width, travel time, and distance. This modified Bellman-Ford has better performance in finding the alternative shortest path by choosing a road with smoother conditions, even t

APA, Harvard, Vancouver, ISO, and other styles

9

Yusuf, Moh Rizky, Nurwan Nurwan, Djihad Wungguli, and Lailany Yahya. "Implementation of the Floyd-Warshall Algorithm and Bellman-Ford Algorithm to Determine the Shortest Path in the Distribution of LPG Gas." E3S Web of Conferences 400 (2023): 03004. http://dx.doi.org/10.1051/e3sconf/202340003004.

Full text

Abstract:

In this article, the method use to determine the shortest path in the distribution of LPG is the Floyd-Warshall algorithm and the Bellman-Ford algorithm. These two methods will be compared to find out methods that can provide the best result. The best result is the path that has the minimum distance of distribution of LPG. Both of these algorithms are focused on simulating calculations that begin by representing the map in the form of a graph. Finally, the results obtained from this study are that using the Floyd-Warshall algorithm produces a path with a total distance of 111.05 KM while the B

APA, Harvard, Vancouver, ISO, and other styles

10

Ghimire, Roshani, and Ram Kumar Basnet. "Shortest Path Routing Performance Evaluation over SDN Environment." December 2023 5, no. 4 (2023): 405–22. http://dx.doi.org/10.36548/jei.2023.4.004.

Full text

Abstract:

Static routing has a manual configuration setup system, and the scope of static routing in an SDN network is just for small networks. The solution to this problem rises up with the new technology deﬁned as software-deﬁned networking (SDN) based on shortest path ﬁrst dynamic routing. SDN has the facility of a centralized controller that smooth the controls and routes computation over a data packet. The performance analysis of SDN networks that have SDN switches connected to the network based on the shortest path ﬁrst protocol are simulated on Mininet. The POX controller with Mininet programming

APA, Harvard, Vancouver, ISO, and other styles

11

Bhowmik, B., and Chowdhury S. Nag. "Prograph Based Analysis of Single Source Shortest Path Problem with Few Distinct Positive Lengths." Engineering, Technology & Applied Science Research 1, no. 4 (2011): 90–97. https://doi.org/10.5281/zenodo.14029.

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 prev

APA, Harvard, Vancouver, ISO, and other styles

12

Pramudita, Rully, and Nadya Safitri. "Algoritma Bellman-Ford Untuk Menentukan Jalur Tercepat Dalam Sistem Informasi Geografis." PIKSEL : Penelitian Ilmu Komputer Sistem Embedded and Logic 6, no. 2 (2018): 105–14. http://dx.doi.org/10.33558/piksel.v6i2.1502.

Full text

Abstract:

Abstract In a large city, there are many congestion problems, so the selection of the fastest route to reach the destination is needed. The city of Bandung is one of the big cities in Indonesia which has a fairly crowded traffic density and tends to be a lot of congestion in it. So we need a study that can discuss the path of independence. In the study to determine the shortest path there are several algorithm options to solve it. This research was conducted using the Bellman Ford algorithm to try to solve the problem of selecting the fastest path. The case that will be focused on in thi

APA, Harvard, Vancouver, ISO, and other styles

13

Jadhav, Lekha, Rahul Dubey, and Manish Shrivastava. "Cache Friendly Bellman-Ford algorithm using OpenCL." International Journal of Computer Applications 139, no. 13 (2016): 1–3. http://dx.doi.org/10.5120/ijca2016909305.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Septiani, Rini, Yuri Yudhaswana Joefrie, Rizka Ardiansyah, Septiano Anggun Pratama, and Rahmah Laila. "Geographical Information System Shortes Path Delivery Of Goods Using The Bellman-Ford And Dijkstra Algorithm (Case Study J&T Palu City)." JIPI (Jurnal Ilmiah Penelitian dan Pembelajaran Informatika) 10, no. 2 (2025): 1427–35. https://doi.org/10.29100/jipi.v10i2.6289.

Full text

Abstract:

The demand for goods delivery services (expedition services) is currently growing very rapidly to support the many e-commerce companies that have sprung up in Indonesia. In the delivery process, there is often a delay in delivery due to the random delivery path of the delivery service courier. The development of information technology, especially computer technology, can be used to solve problems in various fields of work. This study aims to optimize the determination of Goods Delivery routes using the Bellman-Ford and Dijkstra Algorithms. The case study was conducted at JT Goods Delivery Serv

APA, Harvard, Vancouver, ISO, and other styles

15

Zhang, Dandan, and Panjing Tan. "Internet of Things and Intelligent Transportation System." Journal of Physics: Conference Series 2066, no. 1 (2021): 012066. http://dx.doi.org/10.1088/1742-6596/2066/1/012066.

Full text

Abstract:

Abstract As the core of the new monitoring system, the Internet of Things realizes the integration of wireless sensor networks and traditional communication networks, and provides a platform for remote management and monitoring of the underlying equipment. The intelligent transportation system framework built on this basis combines intelligent transportation technology and the organic combination of vehicle management technologies is conducive to the safety, speed and reliability of vehicle transportation, and plays an important role in further reducing transportation costs. Based on this, thi

APA, Harvard, Vancouver, ISO, and other styles

16

Sulaiman, Oris Krianto, Amir Mahmud Siregar, Khairuddin Nasution, and Tasliyah Haramaini. "Bellman Ford algorithm - in Routing Information Protocol (RIP)." Journal of Physics: Conference Series 1007 (April 2018): 012009. http://dx.doi.org/10.1088/1742-6596/1007/1/012009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Goldberg, Andrew V., and Tomasz Radzik. "A heuristic improvement of the Bellman-Ford algorithm." Applied Mathematics Letters 6, no. 3 (1993): 3–6. http://dx.doi.org/10.1016/0893-9659(93)90022-f.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Lam, K. P., and C. W. Tong. "Optimisation circuits for the Bellman-Ford computation algorithm." Electronics Letters 30, no. 19 (1994): 1584–86. http://dx.doi.org/10.1049/el:19941077.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

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 la

APA, Harvard, Vancouver, ISO, and other styles

20

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

APA, Harvard, Vancouver, ISO, and other styles

21

Alamoudi, Othman, and Muhammad Al-Hashimi. "On the Energy Behaviors of the Bellman–Ford and Dijkstra Algorithms: A Detailed Empirical Study." Journal of Sensor and Actuator Networks 13, no. 5 (2024): 67. http://dx.doi.org/10.3390/jsan13050067.

Full text

Abstract:

The Single-Source Shortest Paths (SSSP) graph problem is a fundamental computation. This study attempted to characterize concretely the energy behaviors of the two primary methods to solve it, the Bellman–Ford and Dijkstra algorithms. The very different interactions of the algorithms with the hardware may have significant implications for energy. The study was motivated by the multidisciplinary nature of the problem. Gaining better insights should help vital applications in many domains. The work used reliable embedded sensors in an HPC-class CPU to collect empirical data for a wide range of s

APA, Harvard, Vancouver, ISO, and other styles

22

Chertkov, Alexandr A., Yaroslav N. Kask, and Ludmila B. Ochina. "STREAMING NETWORK ROUTING BASED ON BELLMAN-FORD ALGORITHM MODIFICATION." Vestnik Gosudarstvennogo universiteta morskogo i rechnogo flota imeni admirala S. O. Makarova 14, no. 4 (2022): 615–27. http://dx.doi.org/10.21821/2309-5180-2022-14-4-615-627.

Full text

Abstract:

The operational task of automating the construction and routing of the network model with the known coordinates of the conditional goals set for a group of vessels to achieve them in the minimum time is solved; it makes it possible to obtain the reserves of running time necessary for saving fuel and energy, taking into account the load, the cost of cargo, transportation costs, logistics characteristics, etc. It is emphasized that in stormy weather conditions and vessel management in situations related to schedule correction, flexible operational decisions of dispatching services, made on the b

APA, Harvard, Vancouver, ISO, and other styles

23

Supraptono, Eko, Arief Arfriandi, and Sulus Ilhamti Rizqian. "The Implementation Of Bellman-Ford Algorithm In Rembang Tourism Mobile Application As A Tourism Information Media." Data Science: Journal of Computing and Applied Informatics 3, no. 1 (2019): 46–56. http://dx.doi.org/10.32734/jocai.v3.i1-679.

Full text

Abstract:

Tourism is one of the methods to publish the beauty of nature or the uniqueness of culture in a region that spreads from the coast up to the mountains. The distribution and the access to tourist attractions require mobile application. In creating the application, Bellman – Ford algorithm was used to get the shortest route. The algorithm was the Bellman – Ford algorithm which was used to calculate the shortest distance to the tourist attraction on the weighted graph. Testing the functionality of the application used a black box. The results showed that functions on the mobile application could

APA, Harvard, Vancouver, ISO, and other styles

24

Devi, Boddu Rama, K. Kishan Rao, and M. Asha Rani. "Application of Modified Bellman-Ford Algorithm for Cooperative Communication." Wireless Personal Communications 109, no. 3 (2019): 2025–49. http://dx.doi.org/10.1007/s11277-019-06666-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Dahshan, Mostafa H. "Maximum Independent Set Approximation Based on Bellman-Ford Algorithm." Arabian Journal for Science and Engineering 39, no. 10 (2014): 7003–11. http://dx.doi.org/10.1007/s13369-014-1159-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Salman et al., Mustafa I. "Software Defined Network of Video Surveillance System Based on Enhanced Routing Algorithms." Baghdad Science Journal 17, no. 1(Suppl.) (2020): 0391. http://dx.doi.org/10.21123/bsj.2020.17.1(suppl.).0391.

Full text

Abstract:

Software Defined Network (SDN) is a new technology that separate the ‎control plane from the data plane. SDN provides a choice in automation and ‎programmability faster than traditional network. It supports the ‎Quality of Service (QoS) for video surveillance application. One of most ‎significant issues in video surveillance is how to find the best path for routing the packets ‎between the source (IP cameras) and destination (monitoring center). The ‎video surveillance system requires fast transmission and reliable delivery ‎and high QoS. To improve the QoS and to achieve the optimal path, the

APA, Harvard, Vancouver, ISO, and other styles

27

Vesovic, Mihailo, Aleksandra Smiljanic, and Dusan Kostic. "Performance of shortest path algorithm based on parallel vertex traversal." Serbian Journal of Electrical Engineering 13, no. 1 (2016): 31–43. http://dx.doi.org/10.2298/sjee1601031v.

Full text

Abstract:

Shortest path algorithms for different applications, such as Internet routing, VLSI design and so on are used. Dijkstra and Bellman-Ford are commonly used shortest path algorithms which are typically implemented in networks with hundreds of nodes. However, scale of shortest path problems is increasing, and more efficient algorithms are needed. With the development of multicore processors, one natural way to speedup shortest path algorithms is through parallelization. In this paper, we propose a novel shortest path algorithm with parallel vertex transversal, and compare its speed with standard

APA, Harvard, Vancouver, ISO, and other styles

28

Shen, Xue Zhen, and Xin Guo Tang. "Dynamic Routing Algorithm Based on HIP Multicast Model." Advanced Materials Research 424-425 (January 2012): 607–11. http://dx.doi.org/10.4028/www.scientific.net/amr.424-425.607.

Full text

Abstract:

A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be eq

APA, Harvard, Vancouver, ISO, and other styles

29

Jukna, Stasys, and Georg Schnitger. "On the optimality of Bellman–Ford–Moore shortest path algorithm." Theoretical Computer Science 628 (May 2016): 101–9. http://dx.doi.org/10.1016/j.tcs.2016.03.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Hutson, Kevin R., Terri L. Schlosser, and Douglas R. Shier. "On the Distributed Bellman-Ford Algorithm and the Looping Problem." INFORMS Journal on Computing 19, no. 4 (2007): 542–51. http://dx.doi.org/10.1287/ijoc.1060.0195.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Sunardi, Sunardi, Muhamad Azwar, Dedy Sofian MZ, Angga Radlisa Samsudin, and Fazlul Rahman. "Implementasi Algoritma Dijkstra dan Bellman-Ford untuk Optimasi Rute Pemadam Kebakaran di Kota Praya." JTIM : Jurnal Teknologi Informasi dan Multimedia 7, no. 2 (2025): 398–407. https://doi.org/10.35746/jtim.v7i2.744.

Full text

Abstract:

Forest and land fires are critical emergencies requiring rapid response to minimize casualties and property damage. In urban areas like Praya City, fire department response delays are often caused by inefficient routing, especially with traffic congestion and complex road infrastructure. This study aims to analyze and compare the performance of Dijkstra's and Bellman-Ford's algorithms for optimizing firefighter routes in Praya City. This quantitative research utilized a computational and comparative analysis approach. Road network data from Praya City was obtained from Google Maps and modeled

APA, Harvard, Vancouver, ISO, and other styles

32

Hutasoit, Ester Tetri H. "Pencarian Rute Terpendek Menggunakan Algoritma Bellman-Ford (Studi Kasus: PT. JNE Medan)." Jurnal Sistem Komputer dan Informatika (JSON) 1, no. 1 (2019): 20. http://dx.doi.org/10.30865/json.v1i1.1367.

Full text

Abstract:

Every human being wants to get to his destination on time. But often congestion causes human desires are blocked. Therefore, we need a way to overcome this problem by knowing the minimum distance to reach a place. The service sector is a field that offers services by helping consumers in various ways. The service sector is a field that will never experience bankruptcy even in difficult conditions because everyone certainly needs the help of others in completing or completing various things. Freight forwarding services are one of the services most widely used, especially in saving time and cost

APA, Harvard, Vancouver, ISO, and other styles

33

Chen, You Rong, Li Yu, Qi Fen Dong, and Zhen Hong. "Distributed Lifetime Optimized Routing Algorithm for Wireless Sensor Networks." Applied Mechanics and Materials 40-41 (November 2010): 448–52. http://dx.doi.org/10.4028/www.scientific.net/amm.40-41.448.

Full text

Abstract:

The network hub nodes consumed excessive energy and failed prematurely, thus it reduced the network lifetime. In order to solve the problem, distributed lifetime optimized routing algorithm (DLOR) for wireless sensor networks was proposed. Energy for transmitting data and neighbor node residual energy were considered comprehensively. Then new weight function was introduced and distributed asynchronous Bellman-Ford algorithm was also used to construct the shortest routing tree. Finally, data were gathered along the shortest routing tree to sink node. Simulation results show that DLOR algorithm

APA, Harvard, Vancouver, ISO, and other styles

34

Riti, Yosefina Finsensia, Jonathan Steven Iskandar, and Hendra Hendra. "Comparison Analysis of Graph Theory Algorithms for Shortest Path Problem." Jurnal Sisfokom (Sistem Informasi dan Komputer) 12, no. 3 (2023): 415–24. http://dx.doi.org/10.32736/sisfokom.v12i3.1756.

Full text

Abstract:

The Sumba region, Indonesia, is known for its extraordinary natural beauty and unique cultural richness. There are 19 interesting tourist attractions spread throughout the area, but tourists often face difficulties in planning efficient visiting routes. From this case, it can be solved by applying graph theory in terms of searching for the shortest distance which is completed using the shortest path search algorithm. Then these 19 tourist objects are used to build a weighted graph, where the nodes represent the tourist objects and the edges of the graph describe the distance or travel time bet

APA, Harvard, Vancouver, ISO, and other styles

35

Liu, Wei, Fu Quan Sun, Hui Lin Yuan, and Jin Bo Cao. "A New Routing Algorithm Based on Adjacent Matrix in Pipeline Laying." Advanced Materials Research 1065-1069 (December 2014): 1683–86. http://dx.doi.org/10.4028/www.scientific.net/amr.1065-1069.1683.

Full text

Abstract:

With the development of economy, higher requirements for pipeline laying are raised. Among them, how to choose path for laying effectivelyand cheaply is the most important. Compared with ‘Dijkstra’, ‘Bellman-Ford’, ‘Floyd’ and ‘Dynamic planning model’, a new routing algorithm based on adjacent matrix is proposed and detailed processes and rules are designed. Additionally the effectiveness of the algorithm is proved through being applied to an example.

APA, Harvard, Vancouver, ISO, and other styles

36

Yiltas-Kaplan, Derya. "Traffic Optimization with Software-Defined Network Controller on a New User Interface." JUCS - Journal of Universal Computer Science 28, no. (6) (2022): 648–69. https://doi.org/10.3897/jucs.80625.

Full text

Abstract:

Software-defined networking (SDN) has emerged as a solution to the cumbersome structures of classical computer networks. It separates control and data planes to give independence to devices with respect to either traffic routing or network management. The two isolated planes communicate with each other via the help of software modules, which are located in an SDN controller, such as Floodlight, NOX, or Ryu. In this study, Floodlight is used and an SDN topology with 20 switches is constructed with Python code in Mininet. All algorithms have been coded with Java. The default routing algorithm in

APA, Harvard, Vancouver, ISO, and other styles

37

Dinata, Rozzi Kesuma, Bustami Bustami, Ar Razi, and Muhammad Arasyi. "Algoritma Dijkstra dan Bellman-Ford dalam Sistem Pemetaan Barbershop di Kota Lhokseumawe." INFORMAL: Informatics Journal 7, no. 2 (2022): 128. http://dx.doi.org/10.19184/isj.v7i2.33303.

Full text

Abstract:

A Barbershop service provider is a company that provides hair care to the community. Many people are currently doing business in this field, and many business actors are opening Barbershops in a variety of locations, ranging from campuses to office districts to densely populated towns. In Lhokseumawe City, there are 12 Barbershops. The application's benefit is that it can identify the shortest path from the user's location to the selected Barbershop, as well as the Barbershop's location and a brief description of the Barbershops in Lhokseumawe City. Only the system's defined nodes can be used

APA, Harvard, Vancouver, ISO, and other styles

38

Arnau, Roger, José M. Calabuig, Luis M. García-Raffi, Enrique A. Sánchez Pérez, and Sergi Sanjuan. "A Bellman–Ford Algorithm for the Path-Length-Weighted Distance in Graphs." Mathematics 12, no. 16 (2024): 2590. http://dx.doi.org/10.3390/math12162590.

Full text

Abstract:

Consider a finite directed graph without cycles in which the arrows are weighted by positive weights. We present an algorithm for the computation of a new distance, called path-length-weighted distance, which has proven useful for graph analysis in the context of fraud detection. The idea is that the new distance explicitly takes into account the size of the paths in the calculations. It has the distinct characteristic that, when calculated along the same path, it may result in a shorter distance between far-apart vertices than between adjacent ones. This property can be particularly useful fo

APA, Harvard, Vancouver, ISO, and other styles

39

Wan, Dong. "The Design and Implementation of Micromouse Based on C8051F120." Applied Mechanics and Materials 313-314 (March 2013): 308–11. http://dx.doi.org/10.4028/www.scientific.net/amm.313-314.308.

Full text

Abstract:

According to the international Micromouse competition requirements suited for the IEEE standard maze, a kind of Micromouse based on C8051F120 is designed in this paper. The hardware structure and software algorithm are specifically introduced, the Center Toward Rule and the Bellman-Ford Algorithm is used for turning, searching and attitude control is optically designed. The designed Micromouse can find the optimal route of the IEEE standard maze by 0.4 s and walk rapidly and stably.

APA, Harvard, Vancouver, ISO, and other styles

40

Timofeeva, Olga, Alexey Sannikov, Maria Stepanenko, and Tatiana Balashova. "Modification of the Bellman–Ford Algorithm for Finding the Optimal Route in Multilayer Network Structures." Computation 11, no. 4 (2023): 74. http://dx.doi.org/10.3390/computation11040074.

Full text

Abstract:

One of the actual tasks of the contemporary logistics business using the “just in time” supply planning concept, is to distribute manufactured goods among the objects of the distribution network in the most efficient manner at the lowest possible cost. The article is devoted to the problem of finding the optimal path in network structures. The problem statement for multilayer data transmission networks (MDTN), which is one of the possible representations of multimodal transport networks, is considered. Thus, each MDTN layer can be represented as a separate type of transport. The problem is sol

APA, Harvard, Vancouver, ISO, and other styles

41

Mo, Yuanqiu, and Lanlin Yu. "A Lyapunov analysis of the continuous-time adaptive Bellman–Ford algorithm." Systems & Control Letters 157 (November 2021): 105045. http://dx.doi.org/10.1016/j.sysconle.2021.105045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Muzakir, Ari, and Hutrianto Hutrianto. "Bellman-Ford Algorithm for Completion of Route Determination: An Experimental Study." Jurnal Ilmiah Teknik Elektro Komputer dan Informatika 6, no. 1 (2020): 29. http://dx.doi.org/10.26555/jiteki.v16i1.16943.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Kumar, Kamlesh, and Vipin Saxena. "An Energy Computation in Distributed Computing Environment through Bellman-Ford Algorithm." International Journal of Computer Applications 142, no. 2 (2016): 1–6. http://dx.doi.org/10.5120/ijca2016909675.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Tamimi, Abdelfatah Aref. "Comparison Studies for Different Shortest path Algorithms." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 14, no. 8 (2015): 5979–86. http://dx.doi.org/10.24297/ijct.v14i8.1857.

Full text

Abstract:

While technological revolution has active role to the increase of computer information, growing computational capabilities of devices, and raise the level of knowledge abilities, and skills. Increase developments in science and technology. In graph used the shortest path algorithms for solving the shortest path problem. The shortest path can be single pair shortest path problem or all pairs shortest path problem. This paper discuss briefly the shortest path algorithms such as Dijkstra's algorithm, Bellman-Ford algorithm,Floyd- Warshall algorithm, and johnson's algorithm. It describes the previ

APA, Harvard, Vancouver, ISO, and other styles

45

Ms., Rasika P. Arbat. "COMPARATIVE STUDY ON SINGLE SOURCE SHORTEST PATH ALGORITHM." INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY 6, no. 1 (2017): 81–84. https://doi.org/10.5281/zenodo.230948.

Full text

Abstract:

We propose architecture for graph analysis to find out the single source shortest path to all other vertices is a common problem. The solution to this problem is Bellman- Ford’s algorithm that solves such a single source shortest path (SSSP) problem and better applies to be parallelized for many core architectures. In this we get, the high degree of parallelism is guaranteed at the cost of low work efficiency which is compared to similar algorithms in literature (e.g. Dijkstra’s) involves much more redundant work and a consequent waste of power consumption. This architecture is a parallel impl

APA, Harvard, Vancouver, ISO, and other styles

46

Karbowski, Andrzej. "On the connections between optimal control, regulation and dynamic network routing." Journal of Telecommunications and Information Technology, no. 3 (September 30, 2003): 67–72. http://dx.doi.org/10.26636/jtit.2003.3.189.

Full text

Abstract:

he paper is devoted to studying general features of dynamic network routing problems. It is shown that these problems may be interpreted as receding horizon optimal control problems or simply regulation problems. In the basic formulation it is assumed, that the nodes have no dynamics and the only goal of the optimization mechanism is to find the shortest paths from the source to the destination nodes. In this problem the optimization mechanism (i.e. the Bellman-Ford algorithm) may be interpreted as a receding horizon optimal control routine. Moreover, there is one-to-one correspondence between

APA, Harvard, Vancouver, ISO, and other styles

47

Hemalatha, S., and P. Valsalal. "Identification of Optimal Path in Power System Network Using Bellman Ford Algorithm." Modelling and Simulation in Engineering 2012 (2012): 1–6. http://dx.doi.org/10.1155/2012/913485.

Full text

Abstract:

Power system network can undergo outages during which there may be a partial or total blackout in the system. In that condition, transmission of power through the optimal path is an important problem in the process of reconfiguration of power system components. For a given set of generation, load pair, there could be many possible paths to transmit the power. The optimal path needs to consider the shortest path (minimum losses), capacity of the transmission line, voltage stability, priority of loads, and power balance between the generation and demand. In this paper, the Bellman Ford Algorithm

APA, Harvard, Vancouver, ISO, and other styles

48

Mo, Yuanqiu, Soura Dasgupta, and Jacob Beal. "Robustness of the Adaptive Bellman –Ford Algorithm: Global Stability and Ultimate Bounds." IEEE Transactions on Automatic Control 64, no. 10 (2019): 4121–36. http://dx.doi.org/10.1109/tac.2019.2904239.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Busato, Federico, and Nicola Bombieri. "An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures." IEEE Transactions on Parallel and Distributed Systems 27, no. 8 (2016): 2222–33. http://dx.doi.org/10.1109/tpds.2015.2485994.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

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 (2016): 2932–35. http://dx.doi.org/10.1166/asl.2016.7081.

Full text

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!