Results 1  10
of
139,660
Fuzzy Shortest Path Problem Based on Biological Method ⋆
"... The shortest path problem is a classical problem in graphic theory. A famous yet common algorithm to solve the shortest path problem is the Dijkstra algorithm which is effective when the length of edges is represented by crisp numbers. However, the length of the edge may be imprecise under an uncert ..."
Abstract
 Add to MetaCart
an uncertain environment. It is a valuable problem for research. In this paper, a new method based on a Physarum model is proposed to solve the shortest path problem under an uncertain environment described by fuzzy numbers. The proposed method uses a dynamic approach to determining the length of edges in each
Shortest Path Problem Under Intuitionistic Fuzzy Setting
"... In this article a fuzzy network has been considered whose edge weights are characterized by trapezoidal intuitionistic fuzzy numbers (TRIFNs).The network is acyclic with topological ordering. The shortest path and the corresponding path distance have been computed with the help of Bellman dynamic p ..."
Abstract
 Add to MetaCart
In this article a fuzzy network has been considered whose edge weights are characterized by trapezoidal intuitionistic fuzzy numbers (TRIFNs).The network is acyclic with topological ordering. The shortest path and the corresponding path distance have been computed with the help of Bellman dynamic
Fuzzy ShortestPath Network Problems With Uncertain Edge Weights
"... This paper presents two new types of fuzzy shortestpath network problems. We consider the edge weight of the network as uncertain, which means that it is either imprecise or unknown. Thus, the first type of fuzzy shortestpath problem uses triangular fuzzy numbers for the imprecise problem. The sec ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper presents two new types of fuzzy shortestpath network problems. We consider the edge weight of the network as uncertain, which means that it is either imprecise or unknown. Thus, the first type of fuzzy shortestpath problem uses triangular fuzzy numbers for the imprecise problem
IMPROVE ON DIJKSTRA SHORTEST PATH ALGORITHM FOR HUGE DATA
"... This paper introduces the classical Dijkstra algorithm in detail, and illustrates the method of implementation of the algorithm and the disadvantages of the algorithm: the network nodes require squareclass memory, so it is difficult to quantify the shortest path of the major nodes. At the same time ..."
Abstract
 Add to MetaCart
This paper introduces the classical Dijkstra algorithm in detail, and illustrates the method of implementation of the algorithm and the disadvantages of the algorithm: the network nodes require squareclass memory, so it is difficult to quantify the shortest path of the major nodes. At the same
Generalized Shortest Path Problem in Uncertain Environment Based on PSO
, 2008
"... Generalized network problems describe situations in which flow can be generated or consumed through arcs. This research considers generalized shortest path problem in stochastic environment in which the changing rate of flow is random. To satisfy the demands of decision makers, three types of models ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of models have been formulated to solve the generalized shortest path problem under different decision criteria. The PSO algorithm is build to solve the generalized shortest path problem in stochastic environment. Finally, a numerical example is given to illustrate the effectiveness of the given algorithm.
Shortestpath network interdiction
 Networks
, 2002
"... We study the problem of interdicting the arcs in anetwork in order to maximize the shortest s–t path length. “Interdiction”isanattackonanarcthatdestroysthearc or increases its effective length; there is alimited interdictionbudget.Weformulatethisbilevel,max–minproblem as amixedinteger program (MIP) ..."
Abstract

Cited by 49 (3 self)
 Add to MetaCart
We study the problem of interdicting the arcs in anetwork in order to maximize the shortest s–t path length. “Interdiction”isanattackonanarcthatdestroysthearc or increases its effective length; there is alimited interdictionbudget.Weformulatethisbilevel,max–minproblem as amixedinteger program (MIP
On the robust shortest path problem
 Computers and Operations Research
, 1998
"... The shortest path (SP) problem in a network with nonnegative arc lengths can be solved easily by Dijkstra’s labeling algorithm in polynomial time. In the case of significant uncertainty of the arc lengths, a robustness approach is more appropriate. In this paper, we study the SP problem under arc le ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
The shortest path (SP) problem in a network with nonnegative arc lengths can be solved easily by Dijkstra’s labeling algorithm in polynomial time. In the case of significant uncertainty of the arc lengths, a robustness approach is more appropriate. In this paper, we study the SP problem under arc
Results 1  10
of
139,660