Results 21 to 30 of about 735,367 (300)
Finding next-to-shortest paths in a graph [PDF]
, 2004 We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest $(u,v)$-path is a shortest $(u,v)$-path amongst $(u,v)$-paths with length strictly greater than the length of the shortest $(u,v)$-path.
Bang-Jensen +5 more
core +1 more source
Solving the Network Shortest Path Problem on a Quantum Annealer
IEEE Transactions on Quantum Engineering, 2020 This article addresses the formulation for implementing a single source, single-destination shortest path algorithm on a quantum annealing computer. Three distinct approaches are presented.
Thomas Krauss, Joey McCollum
doaj +1 more source
A Multi Objective Programming Approach to Solve Integer Valued Neutrosophic Shortest Path Problems [PDF]
Neutrosophic Sets and Systems, 2019 Neutrosophic (NS) set hypothesis gives another way to deal with the vulnerabilities of the shortest path problems (SPP). Several researchers have worked on fuzzy shortest path problem (FSPP) in a fuzzy graph with vulnerability data and completely ...
Ranjan Kumar +5 more
doaj +1 more source
ANT COLONY OPTIMIZATION PARAMETER SELECTION FOR SHORTEST PATH PROBLEM [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 The shortest path problem has been studied to be solved through diverse deterministic and also stochastic approaches such as Ant Colony Optimization. One of the most challenging issues with the implication of Ant Colony Optimization to solve the shortest
N. Zarrinpanjeh +5 more
doaj +1 more source
Shortest Paths Avoiding Forbidden Subpaths [PDF]
, 2009 In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P.
Ahmed, Mustaq, Lubiw, Anna
core +6 more sources
The shortest path problem [PDF]
, 2015 The shortest path problem is solved and applied to the calculations of half lives with respect to spontaneous fission of heavy nuclei. The dynamical programming method of Bellman and Kalaba is used to find the fission path in the i-dimensional space of ...
Baran, Andrzej
core +2 more sources
The Shortest Path Problem for a Multiple Graph
Моделирование и анализ информационных систем, 2017 In the article, the definition of an undirected multiple graph of any natural multiplicity k > 1 is stated. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is the union of k linked edges,
Alexander V. Smirnov
doaj +1 more source
The Steiner bi-objective shortest path problem
EURO Journal on Computational Optimization, 2021 In this paper, we introduce the Steiner Bi-objective Shortest Path Problem. This problem is defined on a directed graph G=(V,A), with a subset T⊂V of terminals. Arcs are labeled with travel time and cost.
Hamza Ben Ticha +3 more
doaj
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
A Hybrid Routing Approach Using Two Searching Layers
Electrical, Control and Communication Engineering, 2021 This paper considers SUB_GOALs by using basic A* algorithm and Subgoal Graphs in a hybrid approach to execute optimal route. SUB_GOALs identified with pre-searching from basic A* at break points and Subgoal Graphs at corners of obstacles are added to ...
Koca Gonca Ozmen, Yetkin Seda
doaj +1 more source