Results 51 to 60 of about 391,490 (227)
Open source environment to define constraints in route planning for GIS-T [PDF]
, 2004 Route planning for transportation systems is strongly related to shortest path algorithms, an optimization problem extensively studied in the literature.
Pérez Vidal, Lluís +1 more
core +1 more source
Maze solvers demystified and some other thoughts
, 2017 There is a growing interest towards implementation of maze solving in spatially-extended physical, chemical and living systems. Several reports of prototypes attracted great publicity, e.g.
A Adamatzky +25 more
core +1 more source
Shortest path or random walks? A framework for path weights in network meta-analysis [PDF]
, 2023 Gerta Rücker +5 more
openalex +1 more source
Discussiones Mathematicae Graph Theory, 2014 A buttoning of a tree that has vertices v1, v2, . . . , vn is a closed walk that starts at v1 and travels along the shortest path in the tree to v2, and then along the shortest path to v3, and so forth, finishing with the shortest path from vn to v1 ...
Short Ian
doaj +1 more source
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem
IEEE Access, 2021 The clustered shortest-path tree problem (CluSPTP) is an extension of the classical single-source shortest-path problem, in which, given a graph with the set of nodes partitioned into a predefined, mutually exclusive and exhaustive set of clusters, we ...
Ovidiu Cosma +2 more
doaj +1 more source
Shortest-Path Reconstruction Algorithms [PDF]
The Computer Journal, 1993 Summary: We study the problem of computing shortest paths between pairs of vertices in an \(n\)-vertex graph, given only the all pairs shortest paths distance matrix. This computation is called a reconstruction, since the algorithm has no access to explicit information about edges in the original graph. We present the following results: 1.
openaire +2 more sources
ARP-Path: ARP-Based, Shortest Path Bridges [PDF]
IEEE Communications Letters, 2011 This letter is a summary proposal for an evolution of the Ethernet transparent bridge paradigm that provides simple, shortest path bridging in campus networks. ARP-Path Ethernet Switches set up an on-demand path between two hosts just reusing and flooding the standard ARP request frame through all links and confirming the path reaching to the ...
Ibáñez Fernández, Guillermo Agustín +4 more
openaire +3 more sources
CASPaR: Congestion avoidance shortest path routing for delay tolerant networks
International Journal of Distributed Sensor Networks, 2017 Unlike traditional transmission control protocol/Internet protocol–based networks, delay/disruption tolerant networks may experience connectivity disruptions and guarantee no end-to-end connectivity between source and destination.
Michael Stewart +3 more
doaj +1 more source
The Multi-Objective Shortest Path Problem with Multimodal Transportation for Emergency Logistics
MathematicsThe optimization of emergency logistical transportation is crucial for the timely dispatch of aid and support to affected areas. By incorporating practical constraints into emergency logistics, this study establishes a multi-objective shortest path mixed-
Jinzuo Guo +4 more
doaj +1 more source
Convergence results for continuous-time dynamics arising in ant colony optimization
, 2013 This paper studies the asymptotic behavior of several continuous-time dynamical systems which are analogs of ant colony optimization algorithms that solve shortest path problems. Local asymptotic stability of the equilibrium corresponding to the shortest
Bhaya, Amit +3 more
core +2 more sources