An integrated algorithm for solving multi-customer joint replenishment problem with districting consideration

Ming Jong Yao, Jen Yen Lin*, Yu Liang Lin, Shu Cherng Fang

*Corresponding author for this work

研究成果: Article同行評審

1 引文 斯高帕斯(Scopus)

摘要

This paper studies a multi-customer joint replenishment problem with districting consideration (MJRPDC) which is of particular importance to a company that outsources its transportation and delivery operations to a third-party logistics (3PL) service provider. To solve the problem, we first propose an innovative search algorithm for solving the traditional multi-customer joint replenishment problem in a given zone. Then we design a GA-based framework to handle the corresponding districting problem based on the performance of each district evaluated by using the proposed search algorithm. The proposed methodologies are demonstrated by using an example of solving MJRPDC for a bank.

原文English
文章編號101896
期刊Transportation Research Part E: Logistics and Transportation Review
138
DOIs
出版狀態Published - 六月 2020

指紋 深入研究「An integrated algorithm for solving multi-customer joint replenishment problem with districting consideration」主題。共同形成了獨特的指紋。

引用此