Abstract
After natural disaster, especially for large-scale disasters and affected areas, vast relief materials are often needed. In the meantime, the traffic networks are always of uncertainty because of the disaster. In this paper, we assume that the edges in the network are either connected or blocked, and the connection probability of each edge is known. In order to ensure the arrival of these supplies at the affected areas, it is important to select a reliable path. A reliable path selection model is formulated, and two algorithms for solving this model are presented. Then, adjustable reliable path selection model is proposed when the edge of the selected reliable path is broken. And the corresponding algorithms are shown to be efficient both theoretically and numerically. © 2013 Jing Wang et al.
Cite
CITATION STYLE
Wang, J., Zhu, J., & Yang, H. (2013). Reliable path selection problem in uncertain traffic network after natural disaster. Mathematical Problems in Engineering, 2013. https://doi.org/10.1155/2013/413034
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.