Results 11 to 20 of about 24,490 (264)
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
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
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
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
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
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
Two-degree-of-freedom manipulator path planning based on zeroing neural network [PDF]
MATEC Web of Conferences, 2020 In this paper, the shortest path problem of manipulator path planning is transformed into a linear programming problem, and solved by zeroing neural network (ZNN).
Li Yan, Liu Keping
doaj +1 more source
Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times [PDF]
مدیریت مهندسی و رایانش نرم, 2020 Network flow problems are considered a vital branch of operations research. These problems are classified into static and time-varying classes. Network flow problems are time-varying in real application, because any flow must take a given amount of time ...
Gholamhasan Shirdel, Hasan Rezapour
doaj +1 more source