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

被引：9

作者：

Yao, Ming-Jong ^{[1
]}

Lin, Jen-Yen ^{[2
]}

Lin, Yu-Liang ^{[1
,3
]}

Fang, Shu-Cherng ^{[3
]}

机构：

[1] Natl Chiao Tung Univ, Dept Transportat & Logist Management, Hsinchu 30010, Taiwan

[2] Natl Chiayi Univ, Dept Appl Math, Chiayi 60004, Taiwan

[3] North Carolina State Univ, Edward P Fitts Dept Ind & Syst Engn, Raleigh, NC 27695 USA

来源：

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2020年 / 138卷

关键词：

Joint replenishment; Districting problem; Genetic algorithm; DELIVERY; PROBABILITIES; FORMULATION; CROSSOVER; MUTATION;

D O I：

10.1016/j.tre.2020.101896

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

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.

引用

页数：23

共 50 条

[21] A comparison between genetic algorithms and the RAND method for solving the joint replenishment problem
Khouja, M
Michalewicz, Z
Satoskar, SS
PRODUCTION PLANNING & CONTROL, 2000, 11 (06) : 556 - 564
[22] An evolutionary algorithm to solve the joint replenishment problem using direct grouping
Olsen, AL
COMPUTERS & INDUSTRIAL ENGINEERING, 2005, 48 (02) : 223 - 235
[23] An algorithm for determining the best lower bound for the Stochastic joint replenishment problem
Viswanathan, S.
OPERATIONS RESEARCH, 2007, 55 (05) : 992 - 996
[24] Hybrid Genetic Algorithm for Solving Multi-Depot Joint Distribution Routing Problem
Fan H.
Xu Z.
Li Y.
Liu W.
Geng J.
Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2019, 53 (08): : 1000 - 1009
[25] Solving multi-customer FPR model with quality assurance and discontinuous deliveries using a two-phase algebraic approach
Chiu, Yuan-Shyi Peter
Chou, Chung-Li
Chang, Huei-Hsin
Chiu, Singa Wang
SPRINGERPLUS, 2016, 5
[26] Research on Solving a Multi-Channel Integrated Distribution Problem with the Squirrel Search Algorithm
Hu, Biqin
Yang, Bin
Jiang, Wei
Yang, Zhe
BASIC & CLINICAL PHARMACOLOGY & TOXICOLOGY, 2020, 126 : 241 - 242
[27] Model and heuristic algorithm of the joint replenishment problem with complete backordering and correlated demand
Zhang, Renqian
Kaku, Ikou
Xiao, Yiyong
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2012, 139 (01) : 33 - 41
[28] Applying Genetic Algorithm for Can-Order Policies in the Joint Replenishment Problem
Nagasawa, Keisuke
Irohara, Takashi
Matoba, Yosuke
Liu, Shuling
INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS, 2015, 14 (01): : 1 - 10
[29] Differential evolution algorithm for constraint joint replenishment problem with indirect grouping strategy
School of Computer Science and Technology, Harbin University of Science and Technology, Harbin
150080, China
Int. J. Hybrid Inf. Technol., 5 (259-266): : 259 - 266
[30] A genetic algorithm for a joint replenishment problem with resource and shipment constraints and defective items
Ongkunaruk, P.
Wahab, M. I. M.
Chen, Y.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2016, 175 : 142 - 152

← 1 2 3 4 5 →