Results 61 to 70 of about 391,490 (227)

The True Shortest Path of Obstacle Grid Graph Is Solved by SGP Vertex Extraction and Filtering Algorithm

Algorithms
In the obstacle grid map, due to the limitations in search direction imposed by classical path algorithms and meta-heuristic algorithms, the shortest paths are not the true shortest paths (TSPs) but rather the shortest grid paths (SGPs).
Yijie Zhang, Jizhou Chen
doaj   +1 more source

Cost-based multi-parameter logistics routing path optimization algorithm

Mathematical Biosciences and Engineering, 2019
The traditional path optimization problem is to consider the shortest path of the vehicle, but the shortest path does not effectively reduce the logistics cost.
Fulin Dang , Chunxue Wu, Yan Wu, Rui Li, Sheng Zhang , Huang Jiaying , Zhigang Liu   +6 more
doaj   +1 more source

When the path is never shortest: a reality check on shortest path biocomputation

, 2017
Shortest path problems are a touchstone for evaluating the computing performance and functional range of novel computing substrates. Much has been published in recent years regarding the use of biocomputers to solve minimal path problems such as route ...
A Adamatzky, A Adamatzky, A Adamatzky, A. Tero, Andrew Adamatzky, C Scherber, CD Harvey, CR Reid, IH Riedel-Kruse, J Baumgardner, J Houten Van, J Houten Van, J Jones, Jeff Jones, K Ramsch, K Vittori, L Zhu, M Dorigo, M Vela-Pérez, Michael Esau, R Mayne, R Mayne, R Mayne, Richard Mayne, S Stepney, Saikat Jana, SC Pratt, T Hennessey, T Nakagaki   +28 more
core   +1 more source

Performance Evaluation of Load-Balanced Routing via Bounded Randomization

CLEI Electronic Journal, 2000
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inherent single -path routing.
Sangman Bak, Jorge A. Cobb, Ernst L. Leiss   +2 more
doaj   +1 more source

Privacy-Preserving Shortest Path Computation

, 2016
Navigation is one of the most popular cloud computing services. But in virtually all cloud-based navigation systems, the client must reveal her location and destination to the cloud service provider in order to learn the fastest route.
Mitchell, John C., Planul, Jérémy, Wu, David J., Zimmerman, Joe   +3 more
core   +1 more source

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

Journal of Telecommunications and Information Technology, 2018
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
Shylashree Nagaraja
doaj   +1 more source

Path-Fault-Tolerant Approximate Shortest-Path Trees

, 2015
Let $G=(V,E)$ be an $n$-nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a {\em single-source shortest-path tree} (SPT) of $G$ with a \emph{sparse} set of \emph{auxiliary} edges selected from $E$, in order to ...
A. D’Andrea, A. D’Andrea, D. Bilò, D. Harel, E. Nardelli, L. Gualà, L. Roditty, M. Thorup, R. Albert, R. Bauer, S. Baswana, S. Baswana, S. Chechik   +12 more
core   +1 more source

The Capacity Expansion Path Problem in Networks

Journal of Applied Mathematics, 2013
This paper considers the general capacity expansion path problem (GCEP) for the telecommunication operators. We investigate the polynomial equivalence between the GCEP problem and the constrained shortest path problem (CSP) and present a pseudopolynomial
Jianping Li, Juanping Zhu
doaj   +1 more source

Distributional Properties of Stochastic Shortest Paths for Smuggled Nuclear Material [PDF]

Journal of Systemics, Cybernetics and Informatics, 2012
The shortest path problem on a network with fixed weights is a well studied problem with applications to many diverse areas such as transportation and telecommunications.
Leticia Cuellar, Feng Pan, Fred Roach, Kevin Saeger   +3 more
doaj  

Fuzzy Shortest Path Problem Based on Level 𝜆-Triangular LR Fuzzy Numbers

Advances in Fuzzy Systems, 2012
In problems of graphs involving uncertainties, the fuzzy shortest path problem is one of the most studied topics, since it has a wide range of applications in different areas and therefore deserves special attention.
S. Elizabeth, L. Sujatha
doaj   +1 more source