Abstract

This paper characterizes the minimum risk path selection problem in an uncertain network. Assuming the accidental losses are the uncertain variables, we first present three types of uncertain risk indexes. After that, some uncertain risk programming models are built based on the proposed risk indexes. In order to obtain the minimum risk path, we convert these uncertain programming models to their corresponding deterministic forms by the operational law of uncertain variables. At last, a numerical example is given to demonstrate the models.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call