New Method in Searching for All Minimal Paths for the Directed Acyclic Network Reliability Problem

2016 ◽  
Vol 65 (3) ◽  
pp. 1263-1270 ◽  
Author(s):  
Wei-Chang Yeh
Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Xiu-Zhen Xu ◽  
Yi-Feng Niu ◽  
Qing Li

This paper focuses on performance assessment of a freight network with stochastic capacities by using reliability analysis, in which a node denotes a supplier, a transfer center, a distribution center, or a market, while an arc denotes a logistics service provider offering the freight traffic service for a pair of nodes. Due to some uncertainties in real environment (for example, a proportion of vehicles owned by the provider may be reserved by other customers), the available capacity of the provider along each arc is stochastic. Thus, network reliability that at least d units of commodity demand can be successfully delivered from the source to the destination denotes the operational performance of such a freight network. A d-minimal path–based method is developed to evaluate the freight network reliability. To advance the efficiency of solving d-minimal paths, an improved model is established by redefining capacity bounds of arcs and minimal paths. Furthermore, a new concept of expected capacity grounded on network reliability is presented to measure the service performance of the freight network. A practical case related to the coal delivery network is studied to demonstrate the implications of both network reliability and expected capacity.


2015 ◽  
Vol 25 (1) ◽  
pp. 1-19 ◽  
Author(s):  
Hector Cancela ◽  
Mohamed El Khadiri ◽  
Gerardo Rubino ◽  
Bruno Tuffin

2020 ◽  
Vol 37 (4) ◽  
pp. 479
Author(s):  
Majid Forghani Elahabad ◽  
Nezam Mahdavi Amiri ◽  
Nelson Kagan

Sign in / Sign up

Export Citation Format

Share Document