A two-phase method for multi-echelon location-routing problems in supply chains

Zhuo Dai, Faisal Aqlan, Kuo Gao, Yefu Zhou

Research output: Contribution to journalArticle

Abstract

The multi-echelon location-routing problems (LRPs) arise from transportation applications such as distribution systems of supply chains in city logistics. The literature review shows that most of the previous studies on location-routing in supply chains involve two-echelon LRPs. The main objective of this study is to develop a two-phase method based on improved Clarke and Wright savings algorithm for three-echelon and four-echelon LRPs. Computational experiments show that compared with other methods, the proposed method can obtain the solution for two LRPs in a shorter time. Moreover, computational experiments show this method can solve three and four location-routing problems in reasonable time. The study also provides managerial insights on the proposed models and method. Finally, the limitations on models and method as well as future research directions are given.

LanguageEnglish (US)
Pages618-634
Number of pages17
JournalExpert Systems With Applications
Volume115
DOIs
StatePublished - Jan 1 2019

Fingerprint

Supply chains
Logistics
Experiments

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Computer Science Applications
  • Artificial Intelligence

Cite this

@article{93539089ff654d7897c97f04234f2fe1,
title = "A two-phase method for multi-echelon location-routing problems in supply chains",
abstract = "The multi-echelon location-routing problems (LRPs) arise from transportation applications such as distribution systems of supply chains in city logistics. The literature review shows that most of the previous studies on location-routing in supply chains involve two-echelon LRPs. The main objective of this study is to develop a two-phase method based on improved Clarke and Wright savings algorithm for three-echelon and four-echelon LRPs. Computational experiments show that compared with other methods, the proposed method can obtain the solution for two LRPs in a shorter time. Moreover, computational experiments show this method can solve three and four location-routing problems in reasonable time. The study also provides managerial insights on the proposed models and method. Finally, the limitations on models and method as well as future research directions are given.",
author = "Zhuo Dai and Faisal Aqlan and Kuo Gao and Yefu Zhou",
year = "2019",
month = "1",
day = "1",
doi = "10.1016/j.eswa.2018.06.050",
language = "English (US)",
volume = "115",
pages = "618--634",
journal = "Expert Systems with Applications",
issn = "0957-4174",
publisher = "Elsevier Limited",

}

A two-phase method for multi-echelon location-routing problems in supply chains. / Dai, Zhuo; Aqlan, Faisal; Gao, Kuo; Zhou, Yefu.

In: Expert Systems With Applications, Vol. 115, 01.01.2019, p. 618-634.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A two-phase method for multi-echelon location-routing problems in supply chains

AU - Dai, Zhuo

AU - Aqlan, Faisal

AU - Gao, Kuo

AU - Zhou, Yefu

PY - 2019/1/1

Y1 - 2019/1/1

N2 - The multi-echelon location-routing problems (LRPs) arise from transportation applications such as distribution systems of supply chains in city logistics. The literature review shows that most of the previous studies on location-routing in supply chains involve two-echelon LRPs. The main objective of this study is to develop a two-phase method based on improved Clarke and Wright savings algorithm for three-echelon and four-echelon LRPs. Computational experiments show that compared with other methods, the proposed method can obtain the solution for two LRPs in a shorter time. Moreover, computational experiments show this method can solve three and four location-routing problems in reasonable time. The study also provides managerial insights on the proposed models and method. Finally, the limitations on models and method as well as future research directions are given.

AB - The multi-echelon location-routing problems (LRPs) arise from transportation applications such as distribution systems of supply chains in city logistics. The literature review shows that most of the previous studies on location-routing in supply chains involve two-echelon LRPs. The main objective of this study is to develop a two-phase method based on improved Clarke and Wright savings algorithm for three-echelon and four-echelon LRPs. Computational experiments show that compared with other methods, the proposed method can obtain the solution for two LRPs in a shorter time. Moreover, computational experiments show this method can solve three and four location-routing problems in reasonable time. The study also provides managerial insights on the proposed models and method. Finally, the limitations on models and method as well as future research directions are given.

UR - http://www.scopus.com/inward/record.url?scp=85052964367&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85052964367&partnerID=8YFLogxK

U2 - 10.1016/j.eswa.2018.06.050

DO - 10.1016/j.eswa.2018.06.050

M3 - Article

VL - 115

SP - 618

EP - 634

JO - Expert Systems with Applications

T2 - Expert Systems with Applications

JF - Expert Systems with Applications

SN - 0957-4174

ER -