Abstract
Network reliability is a magnificent way to evaluate the performance of the system, while providing objective system management and the improvement features of network, it also provides valuable information that will help us understand the quality and ability of the system and also tells us the important reference about the design, operation, or planning of new systems. So in recent years, network reliability has been widely used by scholars in a variety of different problems and cases (such as: manufacturing systems, power networks, computer computing and supply chain distribution, etc.), but the most prosperous research is Stochastic Supply Chain Network (SSCN) problem. The reason why people pay attention to this research is that network reliability can be the most appropriate application to the problem of SSCN. In network model, vertex denotes a supplier, a transfer center, or customer, while a route connecting a pair of vertices denotes a carrier. Each carrier will have their available transportation capacity and the capacity is not deterministic due to transportation capacity may be shared by different customer. Thus, we can view it as a SSCN. In this research, network reliability is used to solve the problem of SSCN and also consider multi-faceted and innovative factors of supply chain (such as transportation time limit, commodity deterioration, multi-commodity transportation and total transportation cost). The network reliability algorithm used in this research is direct algorithm which was proposed by professor Wei-Chang Yeh, its’ time complexity and computation time are faster and more intuitive than the past indirect algorithm.