摘要：Reliability and transportation cost are two important indicators to measure the performance of logistics network. As a combination of reliability and transportation cost, the performance index of logistics network is defined as the probability that at least units of flow demand can be successfully transmitted from the source to the destination with the total transportation cost less than or equal to . In this paper, an algorithm is developed to calculate in terms of -minimal paths (-MPs for short). The proposed algorithm employs a decomposition technique to divide the search space of -MPs such that the search space of -MPs can be dramatically reduced, and thereby -MPs can be efficiently obtained. An example is provided to illustrate the proposed algorithm. Finally, computational experiments conducted on one benchmark network indicate that the proposed method has an advantage over the existing methods.
