Back to Search
Start Over
Uncertain random shortest path problem.
- Source :
-
Soft Computing - A Fusion of Foundations, Methodologies & Applications . Feb2020, Vol. 24 Issue 4, p2431-2440. 10p. - Publication Year :
- 2020
-
Abstract
- The shortest path is an important problem in network optimization theory. This paper considers the shortest path problem under the situation where weights of edges in a network include both uncertainty and randomness and focuses on the case that the weights of edges are expressed by uncertain random variables. Some optimization models based on chance theory are proposed in order to find the shortest path which fully reflects uncertain and random information. This paper proposes also an intelligent algorithm to calculate the shortest path for an uncertain random network. A numerical example is given to illustrate its effectiveness. [ABSTRACT FROM AUTHOR]
- Subjects :
- *RANDOM variables
*MATHEMATICAL optimization
*UNCERTAINTY
*ROBUST optimization
Subjects
Details
- Language :
- English
- ISSN :
- 14327643
- Volume :
- 24
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Soft Computing - A Fusion of Foundations, Methodologies & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 141513457
- Full Text :
- https://doi.org/10.1007/s00500-018-03714-5