The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Many real-world multi-state systems can be modeled as multistate flow networks (MFN) such that the net flow into and out of a node (excluding the source and target nodes) is equal to zero, e.g., distribution systems and supply chains. The quickest path (QP) reliability problem is to evaluate the probability, i.e., , that at least units of data can be sent from the source...
In order to conform to the real world systems such as distribution systems and supply chain management system, we assume the capacity of each arc in the quickest path problem is stochastic (multi-state). In this study, we propose a simple algorithm to evaluate the probability that d units of data can be sent from the source node to the sink node through the multi-state quickest path flow network within...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.