Results 21 to 30 of about 10,050 (224)
Comparative research on all to all pairs path finding algorithms in a real-world scenario [PDF]
This paper presents a comparative study of the implementation of all-to-all pairs shortest path algorithms, specifically Floyd-Warshall, Johnson’s, and Dijkstra’s.
Subrata Peter Nelson +4 more
doaj +1 more source
This study analyzes and implements the Floyd Warshall algorithm using Z-Score to track alternative routes to areas in Medan City, Indonesia that are prone to mugging. The data was obtained from Porlestabes (Police station) Medan-Indonesia.
Rozzi Kesuma Dinata +3 more
doaj +1 more source
Diera industri 4.0, penggunaan peta tidak lagi berbentuk lembaran ataupun buku. Kini terdapat sebuah layananan peta digital yaitu platform Leafleat.js, yang memudahkan penggunanya untuk mendapatkan informasi rute dari objek ke objek lainnya dan mencari ...
Rusydi Umar, Anton Yudhana, Andi Prayudi
doaj +1 more source
Floyd-Warshall Algorithm for Web-Based Route Optimization for a Road Network Study in Medan City
The socio-demographic conditions of the region have an influence on the transportation performance in the region. This study aims to determine the shortest path between two specified points, namely the starting and the end point of several sub-districts ...
Faridawaty Marpaung +3 more
semanticscholar +1 more source
Prim and Floyd-Warshall Comparative Algorithms in Shortest Path Problem [PDF]
Optimization is an effort to obtain the best results by considering the constraints, constraints, and limitations that exist on a problem; the goal is to minimize or suppress the things that harm and maximize the things that are considered profitable. Generally, the Floyd-Warsall algorithm is widely used to solve shortest path problems, while the Prim ...
Zuhri Ramadhan +2 more
+4 more sources
The expediency of using the inverted Floyd–Warshall algorithm for a deeper study of factors of maximum influence on the occurrence and development of fires in the war zones of Donetsk and Lugansk oblasts is shown.
Olga Butenko, Anna Topchiy
doaj +1 more source
Seamount larval dispersal networks: A potential strategy for conserving ecological connectivity from deep-sea mining. [PDF]
Abstract Seamounts are unique habitats in the deep sea facing anthropogenic stressors, including future deep‐sea mining. To conserve patchy marine habitats such as seamounts, it is critical to design conservation area networks that maintain connectivity by larval dispersal. This study conducted biophysical modeling to quantify larval dispersal among 18
Saito N +6 more
europepmc +2 more sources
Optimizing the shortest route is needed by a company in the process of distributing goods to consumers. This optimization can help companies optimize the mileage and costs from source to destination.
Annisa Zaen Febryantika +3 more
semanticscholar +1 more source
A Spatial Agent-Based Consumer Model: Maximizing and Satisfying Behavior within Multi-Store Market [PDF]
In this paper, we propose using a mixed genetic-floyd-warshall algorithm in combination with a Floyd-warshall algorithm to model the satisficing behaviour of consumers across spatially differentiated stores.
Omid Roozmand +2 more
doaj +1 more source
Iterative Algorithm for Finding the Shortest Ways in an Unweighted Undirected Graph
There is a problem of finding the shortest paths between two vertices in an unweighted, undirected graph, which is aggravated by the fact that the available algorithms for finding all paths have a complexity of at least .
Valentin Sysoev
doaj +1 more source

