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

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

Abstract

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.

Original languageEnglish
Article number101896
JournalTransportation Research Part E: Logistics and Transportation Review
Volume138
DOIs
Publication statusPublished - 2020 Jun

All Science Journal Classification (ASJC) codes

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

Fingerprint

Dive into the research topics of 'An integrated algorithm for solving multi-customer joint replenishment problem with districting consideration'. Together they form a unique fingerprint.

Cite this