An integrated algorithm for solving multi-customer joint replenishment problem with districting consideration
Simple item page Statistics| Field | Value | Language |
|---|---|---|
dc.citation.epage |
0 | en_US |
dc.citation.spage |
0 | en_US |
dc.citation.volume |
138 | en_US |
dc.citation.woscount |
0 | en_US |
dc.contributor.author |
Yao, Ming-Jong | en_US |
dc.contributor.author |
Lin, Jen-Yen | en_US |
dc.contributor.author |
Lin, Yu-Liang | en_US |
dc.contributor.author |
Fang, Shu-Cherng | en_US |
dc.contributor.department |
運輸與物流管理系 註:原交通所+運管所 | zh_TW |
dc.contributor.department |
Department of Transportation and Logistics Management | en_US |
dc.date.accessioned |
2020-07-01T05:22:11Z | |
dc.date.available |
2020-07-01T05:22:11Z | |
dc.date.issued |
2020-06-01 | en_US |
dc.description.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. | en_US |
dc.identifier.doi |
10.1016/j.tre.2020.101896 | en_US |
dc.identifier.issn |
1366-5545 | en_US |
dc.identifier.journal |
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.tre.2020.101896 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/154607 | |
dc.identifier.wosnumber |
WOS:000536953900005 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
Joint replenishment | en_US |
dc.subject |
Districting problem | en_US |
dc.subject |
Genetic algorithm | en_US |
dc.title |
An integrated algorithm for solving multi-customer joint replenishment problem with districting consideration | en_US |
dc.type |
Article | en_US |
Files
No files are attached to this item.
Collections: Articles
Cite this item
Yao, M.-J., Lin, J.-Y., Lin, Y.-L., & Fang, S.-C. (2020). An integrated algorithm for solving multi-customer joint replenishment problem with districting consideration. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 138, 0. https://doi.org/10.1016/j.tre.2020.101896
Citation generated in APA 7th edition style; please check it before use.
Share
Permanent link: https://ir.lib.nycu.edu.tw/handle/11536/154607