{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T01:55:06Z","timestamp":1777168506154,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,12,15]],"date-time":"2022-12-15T00:00:00Z","timestamp":1671062400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,15]],"date-time":"2022-12-15T00:00:00Z","timestamp":1671062400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012456","name":"National Social Science Foundation of China","doi-asserted-by":"crossref","award":["20&ZD126"],"award-info":[{"award-number":["20&ZD126"]}],"id":[{"id":"10.13039\/501100012456","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00521-022-08052-0","type":"journal-article","created":{"date-parts":[[2022,12,15]],"date-time":"2022-12-15T18:11:03Z","timestamp":1671127863000},"page":"7561-7580","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Hybrid arithmetic optimization algorithm for a new multi-warehouse joint replenishment and delivery problem under trade credit"],"prefix":"10.1007","volume":"35","author":[{"given":"Lu","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7849-1490","authenticated-orcid":false,"given":"Sirui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,15]]},"reference":[{"key":"8052_CR1","doi-asserted-by":"publisher","first-page":"113609","DOI":"10.1016\/j.cma.2020.113609","volume":"376","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Diabat A, Mirjalili S et al (2021) The arithmetic optimization algorithm. Comput Methods Appl Mech Eng 376:113609","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"16","key":"8052_CR2","doi-asserted-by":"publisher","first-page":"4625","DOI":"10.1080\/00207543.2016.1276306","volume":"55","author":"X-Y Ai","year":"2017","unstructured":"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\u20134642","journal-title":"Int J Prod Res"},{"key":"8052_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-021-06031-6","author":"N Akbilek","year":"2021","unstructured":"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","journal-title":"Soft Comput"},{"issue":"3","key":"8052_CR4","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1016\/j.ejor.2019.01.070","volume":"276","author":"AC Baller","year":"2019","unstructured":"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\u20131033","journal-title":"Eur J Oper Res"},{"key":"8052_CR5","doi-asserted-by":"publisher","first-page":"107420","DOI":"10.1016\/j.ijpe.2019.06.016","volume":"220","author":"J Carvajal","year":"2020","unstructured":"Carvajal J, Casta\u00f1o F, Sarache W et al (2020) Heuristic approaches for a two-echelon constrained joint replenishment and delivery problem. Int J Prod Econ 220:107420","journal-title":"Int J Prod Econ"},{"issue":"5","key":"8052_CR6","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1016\/j.tre.2007.05.010","volume":"44","author":"BC Cha","year":"2008","unstructured":"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\u2013730","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"8052_CR7","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.cie.2018.10.031","volume":"127","author":"Y Chen","year":"2019","unstructured":"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\u2013435","journal-title":"Comput Ind Eng"},{"key":"8052_CR8","first-page":"125055","volume":"374","author":"L Cui","year":"2020","unstructured":"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","journal-title":"Appl Math Comput"},{"key":"8052_CR9","doi-asserted-by":"publisher","first-page":"105416","DOI":"10.1016\/j.knosys.2019.105416","volume":"193","author":"L Cui","year":"2020","unstructured":"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","journal-title":"Knowl Based Syst"},{"key":"8052_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.knosys.2015.09.019","volume":"90","author":"L Cui","year":"2015","unstructured":"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\u2013198","journal-title":"Knowl Based Syst"},{"key":"8052_CR11","doi-asserted-by":"publisher","first-page":"102113","DOI":"10.1016\/j.omega.2019.102113","volume":"98","author":"S Deng","year":"2021","unstructured":"Deng S, Fu K, Xu J et al (2021) The supply chain effects of trade credit under uncertain demands. Omega 98:102113","journal-title":"Omega"},{"key":"8052_CR12","doi-asserted-by":"publisher","first-page":"114287","DOI":"10.1016\/j.compstruct.2021.114287","volume":"273","author":"S Khatir","year":"2021","unstructured":"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","journal-title":"Compos Struct"},{"key":"8052_CR13","doi-asserted-by":"publisher","first-page":"12801","DOI":"10.1007\/s00500-020-05182-2","volume":"24","author":"M Leon","year":"2020","unstructured":"Leon M, Xiong N (2020) Adaptive differential evolution with a new joint parameter adaptation method. Soft Comput 24:12801\u201312819","journal-title":"Soft Comput"},{"issue":"2","key":"8052_CR14","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1108\/IJLM-11-2015-0217","volume":"28","author":"R Liu","year":"2017","unstructured":"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\u2013310","journal-title":"Int J Logist Manag"},{"key":"8052_CR15","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.cie.2017.12.014","volume":"116","author":"R Liu","year":"2018","unstructured":"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\u201396","journal-title":"Comput Ind Eng"},{"key":"8052_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2022.126100","author":"SX Lv","year":"2023","unstructured":"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","journal-title":"Energy"},{"issue":"10","key":"8052_CR17","doi-asserted-by":"publisher","first-page":"1623","DOI":"10.1007\/s13042-017-0669-5","volume":"9","author":"SX Lv","year":"2018","unstructured":"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\u20131648. https:\/\/doi.org\/10.1007\/s13042-017-0669-5","journal-title":"Int J Mach Learn Cybern"},{"issue":"1","key":"8052_CR18","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ijpe.2009.10.030","volume":"133","author":"IK Moon","year":"2011","unstructured":"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\u2013350","journal-title":"Int J Prod Econ"},{"key":"8052_CR19","doi-asserted-by":"publisher","first-page":"107808","DOI":"10.1016\/j.asoc.2021.107808","volume":"112","author":"A Mortazavi","year":"2021","unstructured":"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","journal-title":"Appl Soft Comput"},{"key":"8052_CR20","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.ijpe.2016.02.012","volume":"175","author":"P Ongkunaruk","year":"2016","unstructured":"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\u2013152","journal-title":"Int J Prod Econ"},{"key":"8052_CR21","doi-asserted-by":"publisher","first-page":"107412","DOI":"10.1016\/j.cie.2021.107412","volume":"159","author":"N Pakhira","year":"2021","unstructured":"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","journal-title":"Comput Ind Eng"},{"issue":"4","key":"8052_CR22","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.dsm.2022.08.002","volume":"5","author":"L Peng","year":"2022","unstructured":"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\u2013174. https:\/\/doi.org\/10.1016\/j.dsm.2022.08.002","journal-title":"Data Sci Manage"},{"key":"8052_CR23","doi-asserted-by":"publisher","first-page":"105863","DOI":"10.1016\/j.asoc.2019.105863","volume":"86","author":"H Qu","year":"2020","unstructured":"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","journal-title":"Appl Soft Comput"},{"key":"8052_CR24","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.knosys.2013.09.013","volume":"54","author":"H Qu","year":"2013","unstructured":"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\u2013215","journal-title":"Knowl Based Syst"},{"key":"8052_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-06504-7","author":"S Saidat","year":"2021","unstructured":"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","journal-title":"Neural Comput Appl"},{"key":"8052_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-021-06062-z","author":"R Saleh","year":"2021","unstructured":"Saleh R, Akay R (2021) Artificial bee colony algorithm with directed scout. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-021-06062-z","journal-title":"Soft Comput"},{"key":"8052_CR27","doi-asserted-by":"publisher","first-page":"107809","DOI":"10.1016\/j.ijpe.2020.107809","volume":"230","author":"Y Shou","year":"2020","unstructured":"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","journal-title":"Int J Prod Econ"},{"key":"8052_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-06289-9","author":"M Tanha","year":"2021","unstructured":"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","journal-title":"Neural Comput Appl"},{"key":"8052_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-022-06899-x","author":"MS Turgut","year":"2022","unstructured":"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","journal-title":"Neural Comput Appl"},{"issue":"2","key":"8052_CR30","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1057\/s41274-017-0188-5","volume":"69","author":"L Wang","year":"2018","unstructured":"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\u2013209","journal-title":"J Oper Res Soc"},{"key":"8052_CR31","doi-asserted-by":"publisher","first-page":"105953","DOI":"10.1016\/j.asoc.2019.105953","volume":"86","author":"L Wang","year":"2020","unstructured":"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","journal-title":"Appl Soft Comput"},{"issue":"3","key":"8052_CR32","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.dsm.2022.07.003","volume":"5","author":"S Wang","year":"2022","unstructured":"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\u2013136. https:\/\/doi.org\/10.1016\/j.dsm.2022.07.003","journal-title":"Data Sci Manage"},{"key":"8052_CR33","doi-asserted-by":"publisher","first-page":"101896","DOI":"10.1016\/j.tre.2020.101896","volume":"138","author":"M-J Yao","year":"2020","unstructured":"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","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"6","key":"8052_CR34","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1080\/18756891.2016.1256567","volume":"9","author":"YR Zeng","year":"2016","unstructured":"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\u20131015","journal-title":"Int J Comput Intell Syst"},{"key":"8052_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-06355-2","author":"T Zheng","year":"2021","unstructured":"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","journal-title":"Neural Comput Appl"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-08052-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-08052-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-08052-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T01:46:03Z","timestamp":1679881563000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-08052-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,15]]},"references-count":35,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["8052"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-08052-0","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,15]]},"assertion":[{"value":"4 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interests"}}]}}