An efficient algorithm for evaluating logistics network reliability subject to distribution cost

Yi Feng Niu, Hing Keung William Lam, Ziyou Gao

Research output: Journal article publicationJournal articleAcademic researchpeer-review

18 Citations (Scopus)


This paper presents a (d, c)-minimal paths based algorithm to evaluate the reliability index R(d,c), defined as the probability that the source distributes a demand d successfully to the destination with the total distribution cost not exceeding budget constraint c. The proposed algorithm employs two schemes to reduce the search space of (d, c)-minimal paths: (1) by proposing some conditions, an improved method for solving (d, c)-minimal paths is developed; (2) an existing decomposition technique is applied to limit the search space. Computational results show a clear advantage of the proposed algorithm in seeking (d, c)-minimal paths.
Original languageEnglish
Pages (from-to)175-189
Number of pages15
JournalTransportation Research Part E: Logistics and Transportation Review
Publication statusPublished - 1 Jan 2014


  • D-Minimal path/(d, c)-minimal path
  • Distribution cost
  • Logistics network
  • Reliability

ASJC Scopus subject areas

  • Business and International Management
  • Civil and Structural Engineering
  • Transportation

Cite this