Results 21 to 30 of about 280,639 (334)
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
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
On Solving the Quadratic Shortest Path Problem [PDF]
INFORMS Journal on Computing, 2019 The quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized. We derive several semidefinite programming relaxations for the quadratic shortest path problem with a matrix variable of order $m+1$, where $m$ is the number of arcs in the ...
Hao Hu, Renata Sotirov
openaire +4 more sources
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 +2 more sources
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
On an instance of the inverse shortest paths problem [PDF]
Mathematical Programming, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Burton, Didier, Toint, Philippe
openaire +3 more sources
Lasso formulation of the shortest path problem [PDF]
2020 59th IEEE Conference on Decision and Control (CDC), 2020 The shortest path problem is formulated as an $l_1$-regularized regression problem, known as lasso. Based on this formulation, a connection is established between Dijkstra's shortest path algorithm and the least angle regression (LARS) for the lasso problem.
Dong, Anqi +2 more
openaire +4 more sources
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles [PDF]
, 2019 Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest sequence of perfect matchings which transforms one given perfect matching ...
Ito, Takehiro +4 more
core +2 more sources