Floyd-Warshall Research Articles

Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train

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.

PENENTUAN RUTE TERDEKAT LOKASI KLINIK BERSALIN DI KOTA SURAKARTA MENGGUNAKAN ALGORITMA FLOYD WARSHALL

Maternity clinics are an option for mothers who will give birth, in addition to locations that are more affordable than hospitals, the place is evenly spread so that their presence can be identified. Maternity Clinic was also chosen because some mothers feel anxious to give birth in a hospital environment, conditions that can slow contractions, make labor longer and interventions are more likely. So giving birth to a baby in a maternity clinic is an alternative that is widely chosen. But not all of them know the location of the nearest Maternity Clinic. Then you will find a way to help find the location of the Maternity Clinic in the city of Surakarta to be faster. The purpose of this study was to make it easier to find where the maternity clinic was located and be able to facilitate and provide access to the community who needed a search for a maternity clinic in the Surakarta area. This research proposes Floyd Warshall algorithm to provide the shortest route. The data used is clinic location data obtained from the Health Office. The results of this research are the shortest route that is connected in the Google Map, namely information on the location of Maternity Clinic locations and nodes scattered in the Surakarta area which can be of benefit to the community about Maternity Clinic places.Keywords: Floyd Warshall Algorithm, Geographic Information System, Maternity Clinic, The Shortest Route

Optimal Coordination Path Selecting Method for Conduction Transformation Based on Floyd Algorithm

Adaptive modification design occupies a large proportion in modern product design, which is essentially a coordination process. Due to the conduction phenomenon, it often leads to the problem that the solution space is too large or even unsolvable. Aiming at the problems caused by the conduction phenomenon, an optimal coordination path selecting method for conduction transformation based Floyd algorithm is proposed. The product conduction transformation coordination process is considered as a path by combining the product graph theory model. The selection criteria of the start and end nodes is given. The functional contribution index, modified adaptation index and conduction impact index are described in detail. The calculation of the comprehensive coordination factor composed of them is given and used as the evaluation index of the conduction transformation coordination path. Floyd algorithm is adopted to coordination path optimization selection model, case study and system development, in order to verify the method proposed in this paper.

Business Intelligence Improved by Data Mining Algorithms and Big Data Systems: An Overview of Different Tools Applied in Industrial Research

The proposed paper shows different tools adopted in an industry project oriented on business intelligence (BI) improvement. The research outputs concern mainly data mining algorithms able to predict sales, logistic algorithms useful for the management of the products dislocation in the whole marketing network constituted by different stores, and web mining algorithms suitable for social trend analyses. For the predictive data mining and web mining algorithms have been applied Weka, Rapid Miner and KNIME tools, besides for the logistic ones have been adopted mainly Dijkstra's and Floyd-Warshall's algorithms. The proposed algorithms are suitable for an upgrade of the information infrastructure of an industry oriented on strategic marketing. All the facilities are enabled to transfer data into a Cassandra big data system behaving as a collector of massive data useful for BI. The goals of the BI outputs are the real time planning of the warehouse assortment and the formulation of strategic marketing actions. Finally is presented an innovative model oriented on E-commerce sales neural network forecasting based on multi-attribute processing. This model can process data of the other data mining outputs supporting logistic actions. This model proves how it is possible to embed many data mining algorithms into a unique prototypal information system connected to a big data, and how it can work on real business intelligence. The goal of the proposed paper is to show how different data mining tools can be adopted into a unique industry information system.

New Method for Zero Potential Non-stop Operation of Distribution Network Based on Injection Current

In the case of live working in the distribution network, a live method of live working that satisfies the requirements for personal safety and power supply reliability needs to be studied, because of the serious safety accidents caused by misuse and weak safety awareness. Based on the zero potential characteristics of the operating point, a new method based on injection current for zero-potential uninterrupted operation in distribution network is proposed. The Floyd algorithm is used to calculate the shortest electrical distance from the live working point to the substation, and the capacitance value of the ground is measured by the resonant grounding system, and the current value injected further to the neutral point is calculated. By regulating the zero-sequence voltage, the neutral point voltage is equal to the difference between the operating phase line voltage drop and the operating phase power supply voltage, ensuring that the operating point voltage is zero. Finally, based on the PSCAD simulation software, the system model is established. The simulation verifies the feasibility of the proposed method by comparing the voltage curves of the working phase.

Multi-UAV Cooperative Patrol Task Planning Novel Method Based on Improved PFIH Algorithm

This paper investigates the cooperative patrol task planning problems for multiple unmanned aerial vehicles by considering the patrol task requirements. A new cooperative patrol task planning approach is proposed to complete the patrol task. Firstly, the cooperative patrol task planning model for multiple unmanned aerial vehicles is established. Then, the corresponding complex constraint condition processing method with two steps is designed; that is, obtaining the initial result via Floyd algorithm firstly and then generating the optimal solution by adopting the improved Push Forward Insertion Heuristic (IPFIH) algorithm. It is proved that the proposed algorithm can obtain feasible solutions that meet all constraints and maximize the patrol payoff under the limited resources conditions. Finally, a numerical simulation is provided to demonstrate the effectiveness of the proposed cooperative patrol task planning approach.

Research on Resource Migration Based on Novel RRH-BBU Mapping in Cloud Radio Access Network for HSR Scenarios

Cloud radio access network (C-RAN) is considered as a promising architecture for 5G with advantages of green energy, convenient resources allocation. In this paper, we explore the feasibility of C-RAN for high-speed railway (HSR) scenarios. A novel phenomenon of group handover is defined in the extensively and densely distributed railway network and we present a resource migration cost with a closed-form expression to depict the group handover. To reduce the cost, we propose a novel connection relationship between the remote radio head (RRH) and the baseband unit (BBU) pool. Based on this, we establish a flexible network so as to allocate the resource dynamically and formulate a graph by abstracting the RRH-BBU and BBU-BBU mapping relationship. Then the minimization of resource migration cost along the high-speed train (HST) routine is converted into the shortest path problem (SPP). By using the modified Floyd-Warshall algorithm, the SPP can be solved with high efficiency compared with the conventional algorithm. Finally, the simulation result shows that the proposed mechanism can decrease the resources migration cost significantly.

Research on multi-load AGV path planning of weaving workshop based on time priority.

The multi-load AGV (Automatic Guided Vehicle) is a new kind of materials handling equipment used to load cloth automatically in an intelligent weaving workshop. It can transport multiple rolls of cloth and choose the correct, most effective path to improve the transportation efficiency without people engaged in. This paper creates a feasible path topology according to the layout of the workshop and the logistics environment, and uses the Warshall-Floyd algorithm to search for the optimal route between two arbitrary points. The aim of the path planning is to maximize the machine efficiency, which is constrained by environmental limits, load limits and work limits. This paper establishes the mathematical model of the path planning problem using the mixed genetic particle swarm optimization algorithm (GA-PSO) to solve the problem, and the particle iteration mechanism based on the time priority is proposed to make the evolution more directional and accelerate the convergence speed of the algorithm. The effectiveness and practicability of the model and methods are verified by simulation and benefit analysis.

Implementation of Manifold Learning Algorithm Isometric Mapping

In dealing with high-dimensional data, such as the global climate model, facial data analysis, human gene distribution and so on, the problem of dimensionality reduction is often encountered, that is, to find the low dimensional structure hidden in high-dimensional data. Nonlinear dimensionality reduction facilitates the discovery of the intrinsic structure and relevance of the data and can make the high-dimensional data visible in the low dimension. The isometric mapping algorithm (Isomap) is an important algorithm for nonlinear dimensionality reduction, which originates from the traditional dimensionality reduction algorithm MDS. The MDS algorithm is based on maintaining the distance between the samples in the original space and the distance between the samples in the lower dimensional space; the distance used here is Euclidean distance, and the Isomap algorithm discards the Euclidean distance, and calculates the shortest path between samples by Floyd algorithm to approximate the geodesic distance along the manifold surface. Compared with the previous nonlinear dimensionality reduction algorithm, the Isomap algorithm can effectively compute a global optimal solution, and it can ensure that the data manifold converges to the real structure asymptotically.

An Optimized Algorithm and Test Bed for Improvement of Efficiency of ESS and Energy Use

The Republic of Korea (ROK) has four distinct seasons. Such an environment provides many benefits, but also brings some major problems when using new and renewable energies. The rainy season or typhoons in summer become the main causes of inconsistent production rates of these energies, and this would become a fatal weakness in supplying stable power to the industries running continuously, such as the aquaculture industry. This study proposed an improvement plan for the efficiency of Energy Storage System (ESS) and energy use. Use of sodium-ion batteries is suggested to overcome the disadvantages of lithium-ion batteries, which are dominant in the current market; a greedy algorithm and the Floyd–Warshall algorithm were also proposed as a method of scheduling energy use considering the elements that could affect communication output and energy use. Some significant correlations between communication output and energy efficiency have been identified through the OPNET-based simulations. The simulation results showed that the greedy algorithm was more efficient. This algorithm was then implemented with C-language to apply it to the Test Bed developed in the previous study. The results of the Test Bed experiment supported the proposals.

Network Topology Optimization Based on Time-Triggered DIMA

Distributed Integrated Modular Avionics System (DIMA) has attracted extensive attention in recent years, and the time-triggered Ethernet (TTE) supports the time triggering mechanism of DIMA system, so it has become the main protocol adopted by this system. In order to generate a network topology with lower architecture cost, load balancing and relatively short path, we studied the network topology optimization problem based on TTE. In view of the arbitrariness of TTE network topology, based on the analysis of time-triggered DIMA model, Floyd algorithm and simulated annealing algorithm are applied to realize topology optimization. The simulation results show that the proposed topology design and optimization method can not only effectively reduce network congestion, but also save network cost.

Research on the Modeling and Simulation of Optimal Dynamic Aerial Ammunition Scheduling and Transportation

To optimize the aerial ammunition scheduling and transportation, both the synergy among all departments of aerial ammunition support system and uncertain factors, such as traffic and attack situations, are taken into consideration in the model. The traffic and attack situations of roads are quantified as crossing time through the model so that the optimization can be simplified into multi-source shortest path problem. Then the optimal transport path of aerial ammunition and combination of storages can be determined by the improved Floyd-Warshall algorithm. Simulation result shows that the dynamic aerial ammunition scheduling and transportation model proposed in this paper is more suitable than traditional model in changing the decision according to the real-time fighting, so as to provide more reliable guarantee of troops.

Optimization of ISP Service Maintenance Router Using Dijkstra and Flyod-Warshall Algorithm

In this paper, Dijkstra algorithm and Floyd-Warshall algorithm are proposed to reduce the number of repetitive operations and read the shortest path and the fastest time from the starting point to all other nodes to arrive at the destination. The Dijkstra algorithm is used to sort location data by distance and sort location data based on the travel time using the Floyd-Warshall algorithm. This application is expected to provide benefits as an example to facilitate ISP personnel in obtaining the shortest path information or route to the point of service interruption. This will optimize disruption handling time and vehicle fuel. Operational costs are more efficient. For ISP Consumers, handling disruptions will be more quickly resolved. Test result indicate that the application can show steps to find the route to the ISP service disruption and advise which node is passed for the shortest distance and the fastest time. A numerical example was used to illustrate the efficiency of the proposed technique. The propose technique can be applied to real application transportation system and many other network optimization problem that can be formulated as shortest path problem.

Betweenness centrality for similarity-weight network and its application to measuring industrial sectors’ pivotability on the global value chain

This paper focuses on measuring the globally and nationally economic system’s connectedness and industrial sector’s function on the Global Value Chain (GVC), as reinforcements to the present studies on international trade. Firstly, we reconsidered the length-related and position-related measures in literatures about vertical specialization from the perspective of econophysics. Secondly, we redefined the inter-country and inter-sector propagating process of intermediate goods and proposed the concept of Strongest Relevance Path Length (SRPL) based on Revised Floyd–Warshall Algorithm (RFWA), which is the basis of new measurement. Thirdly, we introduced Average and Maximum Strongest Relevance Degree (ASRD and MSRD) to measure the connectedness and compactness of network respectively. Fourthly, enlightened by betweenness centrality, we introduced SRPL-based index to measure industrial sectors’ Pivotability in transferring intermediate goods Fifthly, these indices were applied to the empirical analysis of the economic system by physical statistics. Finally, through cascading failure analysis, we found that both ASRD and MSRD reflecting the overall performance of propagating process of intermediate goods are vulnerable to those sectors with high pivotability.

Non-crossing Rectilinear Shortest Minimum Bend Paths in the Presence of Rectilinear Obstacles

The paper presents a new algorithm to determine the shortest, non-crossing, rectilinear paths in a twodimensional grid graph. The shortest paths are determined in a manner ensuring that they do not cross each other and bypass any obstacles present. Such shortest paths are applied in robotic chip design, suburban railway track layouts, routing traffic in wireless sensor networks, printed circuit board design routing, etc. When more than one equal length noncrossing path is present between the source and the destination, the proposed algorithm selects the path which has the least number of corners (bends) along the path. This feature makes the path more suitable for moving objects, such as unmanned vehicles. In the author’s scheme presented herein, the grid points are the vertices of the graph and the lines joining the grid points are the edges of the graph. The obstacles are represented by their boundary grid points. Once the graph is ready, an adjacency matrix is generated and the Floyd-Warshall all-pairs shortest path algorithm is used iteratively to identify the non-crossing shortest paths. To get the minimum number of bends in a path, we make a modification to the Floyd-Warshall algorithm, which is constitutes the main contribution of the author presented herein.

A Regional Protection Partition Strategy Considering Communication Constraints and Its Implementation Techniques

Regional protection based on multisource information of a regional power network depends on communication technology. A partition strategy considering communication constraints and implementation techniques must be considered to realize the regional protection of a large power grid. This paper aims at examining the technical requirements of rapid and reliable regional protection, considering the number of hops as the factor affecting communication between secondary substations and primary substations, and combining this with the equalization of substations. Then, a primary substation selection model of regional protection based on an exhaustive method is proposed using the Floyd–Warshall algorithm (an algorithm for finding shortest paths in a weighted graph). The partition model is further established according to the multifactors that affect the communication delay time for regional protection. Focusing on the N-1 channel fault in the preset region after the formation of the subregions, this paper analyzes the circuitous process of information in an interrupt channel and considers the influence of communication delay time to further improve the partition strategy. Finally, this paper puts forward techniques for partition strategy implementation based on graph theory; an example analysis of an actual power network is also given, and the conclusions of multiple partitions of the same power network are compared and analyzed. Besides this, partition suggestions and theoretical guidance considering actual engineering demands are given.

Penerapan Algoritma Floyd Warshall Dalam Aplikasi Penentuan Rute Terpendek Mencari Lokasi BTS (Base Tower Station) Pada PT.GCI Palembang

For PT.GCI Palembang optimization of the shortest route is needed in the process of finding the location of BTS (Base Tower Station) because with the optimization of the shortest route determination can assist the technician in optimizing the distance to the location of BTS needs to be done maintenance and repair so as to increase the efficiency of time and the required costs. The shortest route problem is a problem in finding the path between two vertices on a weighted graph that has a combined value of the number of weights on the side of the graph passed by the minimum number. In this research using Floyd Warshall algorithm to determine the shortest route. Where the Floyd Warshall algorithm can compare all track opportunities in the graph for each side of all the nodes it passes to the least amount. Based on the results of calculations from this research obtained the shortest route that is from point 1 – 4- 3 – 2 that is equal to 10,9 km

АВТОМАТИЧЕСКАЯ СИНХРОНИЗАЦИЯ «ОСТРОВОВ» ПРИ ВОССТАНОВЛЕНИИ СИСТЕМ ЭЛЕКТРОСНАБЖЕНИЯ С РАСПРЕДЕЛЕННОЙ ГЕНЕРАЦИЕЙ

The PURPOSE of the paper is to develop an operation algorithm of the automatic synchronization system under the restoration of the power supply system after emergency cut-off from the main power source (MPS) and breaking of the power supply system into separate “islands”. METHODS. Some operation stages of the synchronization system use reachability matrices, for the construction of which the Floyd-Warshall algorithm is used. RESULTS AND THEIR DISCUSSION. The operation of the synchronization system using the proposed algorithm is demonstrated on the test scheme of the power supply system. The execution of the algorithm is triggered in case of emergency shutdown of current breakers (CB); the algorithm identifies the structure of the “islands” formed as a result of the accident and forms a definite order of the synchronization process; the error signals determined by the algorithm are applied to automatic speed regulators (ASR) and automatic voltage regulators (AVR) of distributed generators (DG); when the synchronism is achieved the algorithm generates the commands to switch on the current breakers. CONCLUSIONS. The proposed algorithm of the synchronization system allows to reconnect the “islands” formed as a result of the accident between each other and with the main power source. When the power supply system is disconnected from the main power source it is necessary to switch the automatic speed regulators of distributed generators to a floating response to eliminate the frequency deviation from the nominal one. In order to exclude an arbitrary load distribution between the distributed generators when the automatic speed regulators are switched to a floating response it is necessary to use a group control of active and reactive power.

FB-APSP: A new efficient algorithm for computing all-pairs shortest-paths

We describe a new forward-backward method for an all-pairs shortest-paths (APSP) algorithm. While most APSP algorithms only scan edges forward, the algorithm proposed here also scans all edges backward because it assumes that edges in the outgoing and incoming adjacency lists of the vertices appear with the same importance. The running time of the algorithm on a directed graph with n vertices, and m edges and positive real-valued edge weights in a deterministic way is O(nδ2⌈2logδ(n−1)−1⌉), and the space complexity is O(nδ⌈2logδ(n−1)−1⌉), where δ = m∕n is the density of the graph. Simulations on graphs with up to 10000 vertices with real, positive weights show that our FB-APSP algorithm, using additional working space less than 75% of space used by Speed-Up Floyd-Warshall algorithm, is faster on large sparse graphs, particularly planar graphs.

Identification of Lung Cancer Related Genes Using Enhanced Floyd Warshall Algorithm in a Protein to Protein Interaction Network

Identification of Lung Cancer Related Genes Using Enhanced Floyd Warshall Algorithm in a Protein to Protein Interaction Network