Skip to main content

Advertisement

Log in

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

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Data Availability

The datasets generated during and/or analyzed during the current study are available from the corresponding author on reasonable request.

References

  1. Abualigah L, Diabat A, Mirjalili S et al (2021) The arithmetic optimization algorithm. Comput Methods Appl Mech Eng 376:113609

    Article  MathSciNet  MATH  Google Scholar 

  2. Ai X-Y, Zhang J-L, Wang L (2017) Optimal joint replenishment policy for multiple non-instantaneous deteriorating items. Int J Prod Res 55(16):4625–4642

    Article  Google Scholar 

  3. Akbilek N (2021) Safety-integrated single-row machine layout problem optimization using GA and TS with a novel heuristic rule support. Soft Comput. https://doi.org/10.1007/s00500-021-06031-6

    Article  Google Scholar 

  4. Baller AC, Dabia S, Dullaert WEH et al (2019) The dynamic-demand joint replenishment problem with approximated transportation costs. Eur J Oper Res 276(3):1013–1033

    Article  MathSciNet  MATH  Google Scholar 

  5. Carvajal J, Castaño F, Sarache W et al (2020) Heuristic approaches for a two-echelon constrained joint replenishment and delivery problem. Int J Prod Econ 220:107420

    Article  Google Scholar 

  6. Cha BC, Moon IK, Park JH (2008) The joint replenishment and delivery scheduling of the one-warehouse, n-retailer system. Transp Res Part E Logist Transp Rev 44(5):720–730

    Article  Google Scholar 

  7. Chen Y, Yang L, Jiang Y et al (2019) Joint replenishment decision considering shortages, partial demand substitution, and defective items. Comput Ind Eng 127:420–435

    Article  Google Scholar 

  8. Cui L, Deng J, Liu R et al (2020) A stochastic multi-item replenishment and delivery problem with lead-time reduction initiatives and the solving methodologies. Appl Math Comput 374:125055

    MathSciNet  MATH  Google Scholar 

  9. Cui L, Deng J, Zhang Y et al (2020) The bare-bones differential evolutionary for stochastic joint replenishment with random number of imperfect items. Knowl Based Syst 193:105416

    Article  Google Scholar 

  10. Cui L, Wang L, Deng J et al (2015) Intelligent algorithms for a new joint replenishment and synthetical delivery problem in a warehouse centralized supply chain. Knowl Based Syst 90:185–198

    Article  Google Scholar 

  11. Deng S, Fu K, Xu J et al (2021) The supply chain effects of trade credit under uncertain demands. Omega 98:102113

    Article  Google Scholar 

  12. Khatir S, Tiachacht S, Thanh CL et al (2021) An improved artificial neural network using arithmetic optimization algorithm for damage assessment in FGM composite plates. Compos Struct 273:114287

    Article  Google Scholar 

  13. Leon M, Xiong N (2020) Adaptive differential evolution with a new joint parameter adaptation method. Soft Comput 24:12801–12819

    Article  Google Scholar 

  14. Liu R, Liu S, Zeng Y-R et al (2017) Optimization model for the new coordinated replenishment and delivery problem with multi-warehouse. Int J Logist Manag 28(2):290–310

    Article  Google Scholar 

  15. Liu R, Zeng Y-R, Qu H et al (2018) Optimizing the new coordinated replenishment and delivery model considering quantity discount and resource constraints. Comput Ind Eng 116:82–96

    Article  Google Scholar 

  16. Lv SX, Wang L (2023) Multivariate wind speed forecasting based on multi-objective feature selection approach and hybrid deep learning model. Energy 263:126100. https://doi.org/10.1016/j.energy.2022.126100

    Article  Google Scholar 

  17. Lv SX, Zeng YR, Wang L (2018) An effective fruit fly optimization algorithm with hybrid information exchange and its applications. Int J Mach Learn Cybern 9(10):1623–1648. https://doi.org/10.1007/s13042-017-0669-5

    Article  Google Scholar 

  18. Moon IK, Cha BC, Lee CU (2011) The joint replenishment and freight consolidation of a warehouse in a supply chain. Int J Prod Econ 133(1):344–350

    Article  Google Scholar 

  19. Mortazavi A, Moloodpoor M (2021) Differential evolution method integrated with a fuzzy decision-making mechanism and virtual mutant agent: theory and application. Appl Soft Comput 112:107808

    Article  Google Scholar 

  20. Ongkunaruk P, Wahab MIM, Chen Y (2016) A genetic algorithm for a joint replenishment problem with resource and shipment constraints and defective items. Int J Prod Econ 175:142–152

    Article  Google Scholar 

  21. Pakhira N, Maiti MK (2021) A multi-item supply chain with multi-leve l trade credit policy under in flation: a mixed mode ABC approach. Comput Ind Eng 159:107412

    Article  Google Scholar 

  22. Peng L, Sun C, Wu W (2022) Effective arithmetic optimization algorithm with probabilistic search strategy for function optimization problems. Data Sci Manage 5(4):163–174. https://doi.org/10.1016/j.dsm.2022.08.002

    Article  Google Scholar 

  23. Qu H, Ai XY, Wang L (2020) Optimizing an integrated inventory-routing system for multi-item joint replenishment and coordinated outbound delivery using differential evolution algorithm. Appl Soft Comput 86:105863

    Article  Google Scholar 

  24. Qu H, Wang L, Zeng Y-R (2013) Modeling and optimization for the joint replenishment and delivery problem with heterogeneous items. Knowl Based Syst 54:207–215

    Article  Google Scholar 

  25. Saidat S, Junoh AK, Wan Muhamad WZA et al (2021) Modified job shop scheduling via Taguchi method and genetic algorithm. Neural Comput Appl. https://doi.org/10.1007/s00521-021-06504-7

    Article  Google Scholar 

  26. Saleh R, Akay R (2021) Artificial bee colony algorithm with directed scout. Soft Comput. https://doi.org/10.1007/s00500-021-06062-z

    Article  Google Scholar 

  27. Shou Y, Shao J, Wang W et al (2020) The impact of corporate social responsibility on trade credit: evidence from Chinese small and medium-sized manufacturing enterprises. Int J Prod Econ 230:107809

    Article  Google Scholar 

  28. Tanha M, Hosseini Shirvani M, Rahmani AM (2021) A hybrid meta-heuristic task scheduling algorithm based on genetic and thermodynamic simulated annealing algorithms in cloud computing environments. Neural Comput Appl. https://doi.org/10.1007/s00521-021-06289-9

    Article  Google Scholar 

  29. Turgut MS, Turgut OE, Abualigah L (2022) Chaotic quasi-oppositional arithmetic optimization algorithm for thermo-economic design of a shell and tube condenser running with different refrigerant mixture pairs. Neural Comput Appl. https://doi.org/10.1007/s00521-022-06899-x

    Article  Google Scholar 

  30. Wang L, Liu R, Liu S (2018) Variable neighborhood search incorporating a new bounding procedure for joint replenishment and delivery problem. J Oper Res Soc 69(2):201–209

    Article  MathSciNet  Google Scholar 

  31. Wang L, Peng L, Wang S et al (2020) Advanced backtracking search optimization algorithm for a new joint replenishment problem under trade credit with grouping constraint. Appl Soft Comput 86:105953

    Article  Google Scholar 

  32. Wang S, Wang L, Pi Y (2022) A hybrid differential evolution algorithm for a stochastic location-inventory-delivery problem with joint replenishment. Data Sci Manage 5(3):124–136. https://doi.org/10.1016/j.dsm.2022.07.003

    Article  Google Scholar 

  33. Yao M-J, Lin J-Y, Lin Y-L et al (2020) An integrated algorithm for solving multi-customer joint replenishment problem with districting consideration. Transp Res Part E Logist Transp Rev 138:101896

    Article  Google Scholar 

  34. Zeng YR, Peng L, Zhang J et al (2016) An effective hybrid differential evolution algorithm incorporating simulated annealing for joint replenishment and delivery problem with trade credit. Int J Comput Intell Syst 9(6):1001–1015

    Article  Google Scholar 

  35. Zheng T, Liu J, Liu Y et al (2021) Hybridizing multi-objective, clustering and particle swarm optimization for multimodal optimization. Neural Comput Appl. https://doi.org/10.1007/s00521-021-06355-2

    Article  Google Scholar 

Download references

Funding

This research is partially supported by National Social Science Foundation of China (No. 20&ZD126), National Natural Science Foundation of China (No.72172112; 71810107003), and Fundamental Research Funds for the Central Universities (WUT: 2022IVA067).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sirui Wang.

Ethics declarations

Conflicts of interests

The authors have no conflicts of interest to declare that are relevant to the content of this article.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Peng, L., Wang, L. & Wang, S. Hybrid arithmetic optimization algorithm for a new multi-warehouse joint replenishment and delivery problem under trade credit. Neural Comput & Applic 35, 7561–7580 (2023). https://doi.org/10.1007/s00521-022-08052-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-022-08052-0

Keywords

Navigation