Uncertain random shortest path problem
- 16 Downloads
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.
KeywordsShortest path problem Chance theory Uncertain random variable Uncertain random network
This work was supported by National Natural Science Foundation of China (Grants No. 61563050), Joint Key Program of National Natural Science Foundation of China (Grants No. U1703262), Innovation Team Research Program of Universities in Xinjiang Uyghur Autonomous Region (Grants No. XJEDU2017 T001), and this work was granted by China Scholarship Council (Grants 201708 655050).
Compliance with ethical standards
Conflict of interest
The authors declare that there is no conflict of interest regarding the publication of this paper.
This article does not contain any studies with human participants performed by any of the authors.
- Floyd RW (1962) Algorithm-97-shortest path. Comm Assoc Comput Mach 5(6):345Google Scholar
- Liu B (2009a) Some research problems in uncertainty theory. J Uncertain Syst 3(1):3–10Google Scholar
- Liu B (2012) Why is there a need for uncertainty theory. J Uncertain Syst 6(1):3–10Google Scholar
- Liu YH, Ha MH (2010) Expected value of function of uncertain variables. J Uncertain Syst 4(3):181–186Google Scholar
- Shi G, Sheng YH, Cui Q (2015) Relative entropy model of uncertain random shortest path. Int J e-Navig Marit Econ 2:87–100Google Scholar
- Zhang B, Peng J (2012) Uncertain programming model for Chinese postman problem with uncertain weights. Ind Eng Manag Syst 11(1):18–25Google Scholar