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

Yi Feng Niu; Hing Keung William Lam; Ziyou Gao

doi:10.1016/j.tre.2014.04.009

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 publication › Journal article › Academic research › peer-review

36 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	175-189
Number of pages	15
Journal	Transportation Research Part E: Logistics and Transportation Review
Volume	67
DOIs	https://doi.org/10.1016/j.tre.2014.04.009
Publication status	Published - 1 Jan 2014

Keywords

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

More information

10.1016/j.tre.2014.04.009

Cite this

@article{82703dd02b5d41d793255ebf3983f98a,

title = "An efficient algorithm for evaluating logistics network reliability subject to distribution cost",

abstract = "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.",

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

author = "Niu, \{Yi Feng\} and Lam, \{Hing Keung William\} and Ziyou Gao",

year = "2014",

month = jan,

day = "1",

doi = "10.1016/j.tre.2014.04.009",

language = "English",

volume = "67",

pages = "175--189",

journal = "Transportation Research Part E: Logistics and Transportation Review",

issn = "1366-5545",

publisher = "Elsevier Ltd",

}

TY - JOUR

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

AU - Niu, Yi Feng

AU - Lam, Hing Keung William

AU - Gao, Ziyou

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

KW - D-Minimal path/(d, c)-minimal path

KW - Distribution cost

KW - Logistics network

KW - Reliability

UR - https://www.scopus.com/pages/publications/84900823464

U2 - 10.1016/j.tre.2014.04.009

DO - 10.1016/j.tre.2014.04.009

M3 - Journal article

SN - 1366-5545

VL - 67

SP - 175

EP - 189

JO - Transportation Research Part E: Logistics and Transportation Review

JF - Transportation Research Part E: Logistics and Transportation Review

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this