Hybrid arithmetic optimization algorithm for a new multi-warehouse joint replenishment and delivery problem under trade credit

被引：4
作者：
Peng, Lu [1 ]
Wang, Lin [2 ]
Wang, Sirui [2 ]
机构：
[1] Wuhan Univ Technol, Sch Management, Wuhan 430070, Hubei, Peoples R China
[2] Huazhong Univ Sci & Technol, Sch Management, Wuhan 430074, Hubei, Peoples R China
来源：
NEURAL COMPUTING & APPLICATIONS | 2023年 / 35卷 / 10期
关键词：
Joint replenishment and delivery problem; Trade credit; Arithmetic optimization algorithm; Differential evolution algorithm; Genetic algorithm; UNSUPERVISED BAND SELECTION; HYPERSPECTRAL IMAGE; CLASSIFICATION; RESOURCE;
D O I：
10.1007/s00521-022-08052-0
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Trade credit is a significant form of short-term financing in the real business situation. This study proposes a practical multi-warehouse joint replenishment and delivery (MJRD) problem under trade credit in accordance with the realistic situation. The goal of the MJRD is to find the reasonable basic replenishment cycle time, the joint replenishment frequency, the delivery frequency, and the assignment information of suppliers to minimize the total cost. Five intelligent algorithms, which include a differential evolution algorithm, genetic algorithm, adaptive hybrid differential evolution algorithm, arithmetic optimization algorithm (AOA), and hybrid arithmetic optimization algorithm (HAOA), are designed to find a solution to this MJRD problem under trade credit. The results of several experiments show that HAOA is effective in solving the proposed MJRD. Compared with AOA, the best improvement is 46.66%. HAOA is a satisfactory algorithm for the proposed MJRD under trade credit.
引用
收藏
页码：7561 / 7580
页数：20
相关论文
共 35 条
[1]   The Arithmetic Optimization Algorithm [J].
Abualigah, Laith ;
Diabat, Ali ;
Mirjalili, Seyedali ;
Elaziz, Mohamed Abd ;
Gandomi, Amir H. .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2021, 376
[2]   Optimal joint replenishment policy for multiple non-instantaneous deteriorating items [J].
Ai, Xue-Yi ;
Zhang, Jin-Long ;
Wang, Lin .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (16) :4625-4642
[3]   Safety-integrated single-row machine layout problem optimization using GA and TS with a novel heuristic rule support [J].
Akbilek, Nevra .
SOFT COMPUTING, 2021, 25 (21) :13533-13547
[4]   The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs [J].
Baller, Annelieke C. ;
Dabia, Said ;
Dullaert, Wout E. H. ;
Vigo, Daniele .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 276 (03) :1013-1033
[5]   Heuristic approaches for a two-echelon constrained joint replenishment and delivery problem [J].
Carvajal, Jimmy ;
Castano, Fabian ;
Sarache, William ;
Costa, Yasel .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2020, 220
[6]   The joint replenishment and delivery scheduling of the one-warehouse, n-retailer system [J].
Cha, B. C. ;
Moon, I. K. ;
Park, J. H. .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2008, 44 (05) :720-730
[7]   Joint replenishment decision considering shortages, partial demand substitution, and defective items [J].
Chen, Yanru ;
Yang, Lu ;
Jiang, Yangsheng ;
Wahab, M. I. M. ;
Yang, Jie .
COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 127 :420-435
[8]   The bare-bones differential evolutionary for stochastic joint replenishment with random number of imperfect items [J].
Cui, Ligang ;
Deng, Jie ;
Zhang, Yajun ;
Zhang, Zijian ;
Xu, Maozeng .
KNOWLEDGE-BASED SYSTEMS, 2020, 193
[9]   A stochastic multi-item replenishment and delivery problem with lead-time reduction initiatives and the solving methodologies [J].
Cui, Ligang ;
Deng, Jie ;
Liu, Rui ;
Xu, Dongyang ;
Zhang, Yajun ;
Xu, Maozeng .
APPLIED MATHEMATICS AND COMPUTATION, 2020, 374
[10]   Intelligent algorithms for a new joint replenishment and synthetical delivery problem in a warehouse centralized supply chain [J].
Cui, Ligang ;
Wang, Lin ;
Deng, Jie ;
Zhang, Jinlong .
KNOWLEDGE-BASED SYSTEMS, 2015, 90 :185-198
1234