An Efficient Method for Selecting a Reliable Path under Uncertainty Conditions

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MORADI S.; Karamali Gh.R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Operational Research in its Applications Year:2020 | Volume:16 | Issue:4 (63) Page(s): 1-14

Download Full-Text

Persian Verion

View:

367

Download:

Cites:

Information Journal Paper

Title

An Efficient Method for Selecting a Reliable Path under Uncertainty Conditions

Author(s)

MORADI S. | Karamali Gh.R. | Issue Writer Certificate

Keywords

NetworkQ3

Reliable PathQ1

Constrained PathQ1

Logical CutsQ1

Uncertainty ConditionsQ1

Abstract

In a Network that has the potential to block some paths, choosing a Reliable Path, so that its survival probability is high, is an important and practical issue. The importance of this issue is very considerable in critical situations such as natural disasters, floods and earthquakes. In the case of the Reliable Path, survival or blocking of each arc on a Network in critical situations is an uncertain parameter that is estimated and among all the paths that connect two distinct points, the route that is most likely to be survived is selected. Since decisions about choosing routes are dependent on other factors, such as distance, cost, or duration of the route, each of these indicators can be added to the problem as some constraints. For modeling the problem, considering the probability of survival of any arc, a Reliable Path is defined as a path that the product of probability of its arcs is as close as possible to one. Then the logarithm function is used to linearize the probability multiplication and the problem model is converted to the constrained shortest path model form. Finally, an algorithm is provided to solve the proposed model, which in any iteration using Logical Cuts, eliminates the obtained suboptimal paths and approaches the optimal solution. The results of applying this method on some Networks with different structure and size show that the proposed algorithm is able to achieve a path that can be expected with high probability of surviving in critical conditions and its distant does not exceed the specified limit.

Cites

No record.

References

No record.

Cite

APA: Copy

MORADI, S., & Karamali, Gh.R.. (2020). An Efficient Method for Selecting a Reliable Path under Uncertainty Conditions. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 16(4 (63) ), 1-14. SID. https://sid.ir/paper/164752/en

Vancouver: Copy

MORADI S., Karamali Gh.R.. An Efficient Method for Selecting a Reliable Path under Uncertainty Conditions. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2020;16(4 (63) ):1-14. Available from: https://sid.ir/paper/164752/en

IEEE: Copy

S. MORADI, and Gh.R. Karamali, “An Efficient Method for Selecting a Reliable Path under Uncertainty Conditions,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 16, no. 4 (63) , pp. 1–14, 2020, [Online]. Available: https://sid.ir/paper/164752/en

Related Journal Papers