Results 31 to 40 of about 569,188 (376)
Study on single-valued neutrosophic graph with application in shortest path problem
CAAI Transactions on Intelligence Technology, 2020 Fuzzy set and neutrosophic set are two efficient tools to handle the uncertainties and vagueness of any real-world problems. Neutrosophic set is more useful than fuzzy set (intuitionistic fuzzy sets) to manage the uncertainties of a real-life problem ...
Ruxiang Liu
doaj +1 more source
A spectral approach to the shortest path problem [PDF]
Linear Algebra and its Applications, 2021 Let $G=(V,E)$ be a simple, connected graph. One is often interested in a short path between two vertices $u,v$. We propose a spectral algorithm: construct the function $ϕ:V \rightarrow \mathbb{R}_{\geq 0}$ $$ ϕ= \arg\min_{f:V \rightarrow \mathbb{R} \atop f(u) = 0, f \not\equiv 0} \frac{\sum_{(w_1, w_2) \in E}{(f(w_1)-f(w_2))^2}}{\sum_{w \in V}{f(w)^2}}.
openaire +3 more sources
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
ON ASSOCIATIVE SHORTEST PATH PROBLEMS [PDF]
Bulletin of informatics and cybernetics, 1997 Summary: We consider a wide class of shortest path problems in acyclic digraphs. In the problems, the length of a path is defined by using an associative binary operation. We derive recursive equations in dynamic programming for the problems, which involve additive, multiplicative, multiplicative-additive, minimum and fractional shortest path problems.
openaire +2 more sources
Expected Length of the Shortest Path of the Traveling Salesman Problem in 3D Space
Journal of Advanced Transportation, 2022 Finding the shortest path of the traveling salesman problem (TSP) is a typical NP-hard problem and one of the basic optimization problems. TSP in three-dimensional space (3D-TSP) is an extension of TSP. It plays an important role in the fields of 3D path
Hongtai Yang +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
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
Systematic Literature Review on Adjustable Robust Shortest Path Problem
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 In real-world optimization problems, effective path planning is important. The Shortest Path Problem (SPP) model is a classical operations research that can be applied to determine an efficient path from the starting point to the end point in a plan ...
Wida Nurul Fauziyah +2 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
A machine learning approach for predicting human shortest path task performance
Visual Informatics, 2022 Finding a shortest path for a given pair of vertices in a graph drawing is one of the fundamental tasks for qualitative evaluation of graph drawings.
Shijun Cai +4 more
doaj +1 more source