{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T20:42:19Z","timestamp":1779136939117,"version":"3.51.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"24","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"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":["Appl Intell"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10489-023-05055-9","type":"journal-article","created":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T15:02:12Z","timestamp":1700060532000},"page":"30266-30299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["OBRUN algorithm for the capacity-constrained joint replenishment and delivery problem with trade credits"],"prefix":"10.1007","volume":"53","author":[{"given":"Lin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingying","family":"Pi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sirui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0451-2316","authenticated-orcid":false,"given":"Ziqing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,15]]},"reference":[{"issue":"4","key":"5055_CR1","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1287\/mnsc.21.4.436","volume":"21","author":"SK Goyal","year":"1974","unstructured":"Goyal SK (1974) Determination of optimum packaging frequency of items jointly replenished. Manage Sci 21(4):436\u2013443","journal-title":"Manage Sci"},{"key":"5055_CR2","doi-asserted-by":"crossref","unstructured":"Liu R, Zhou ZH, Qin QD, Fan B (2022) Centralized drug procurement operation scheduling with a capacitated joint replenishment and delivery strategy: Evidence from China. Comput Ind Eng 172:108584","DOI":"10.1016\/j.cie.2022.108584"},{"issue":"2","key":"5055_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0167-6377(89)90001-1","volume":"8","author":"E Arkin","year":"1989","unstructured":"Arkin E, Joneja D, Roundy R (1989) Computational complexity of uncapacitated multi-echelon production planning problems. Oper Res Lett 8(2):61\u201366","journal-title":"Oper Res Lett"},{"issue":"4","key":"5055_CR4","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1287\/moor.2017.0904","volume":"43","author":"T Cohen-Hillel","year":"2018","unstructured":"Cohen-Hillel T, Yedidsion L (2018) The periodic joint replenishment problem is strongly NP-hard. Math Oper Res 43(4):1269\u20131289","journal-title":"Math Oper Res"},{"issue":"5","key":"5055_CR5","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 E: Log Transp Rev 44(5):720\u2013730","journal-title":"Transp Res E: Log Transp Rev"},{"key":"5055_CR6","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, Wahab MIM, Yang J (2019) Joint replenishment decision considering shortages, partial demand substitution, and defective items. Comput Ind Eng 127:420\u2013435","journal-title":"Comput Ind Eng"},{"key":"5055_CR7","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, Zhang J (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":"5055_CR8","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 YR (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":"5055_CR9","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.knosys.2016.01.006","volume":"97","author":"L Wang","year":"2016","unstructured":"Wang L, Liu R, Liu S (2016) An effective and efficient fruit fly optimization algorithm with level probability policy and its applications. Knowl-Based Syst 97:158\u2013174","journal-title":"Knowl-Based Syst"},{"issue":"4","key":"5055_CR10","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1080\/00207543.2016.1218564","volume":"55","author":"HY Kang","year":"2017","unstructured":"Kang HY, Lee AHI, Wu CW, Lee CH (2017) An efficient method for dynamic-demand joint replenishment problem with multiple suppliers and multiple vehicles. Int J Prod Res 55(4):1065\u20131084","journal-title":"Int J Prod Res"},{"key":"5055_CR11","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 SR, Liu S (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"},{"key":"5055_CR12","doi-asserted-by":"publisher","first-page":"119873","DOI":"10.1016\/j.jclepro.2019.119873","volume":"254","author":"L Cui","year":"2020","unstructured":"Cui L, Deng J, Zhang Y, Tang G, Xu M (2020) Hybrid differential artificial bee colony algorithm for multi-item replenishment-distribution problem with stochastic lead-time and demands. J Clean Prod 254:119873","journal-title":"J Clean Prod"},{"issue":"1","key":"5055_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382","journal-title":"IEEE Trans Evol Comput"},{"key":"5055_CR14","doi-asserted-by":"crossref","unstructured":"Y\u0131lmaz BG, Y\u0131lmaz \u00d6F (2022) Lot streaming in hybrid flowshop scheduling problem by considering equal and consistent sublots under machine capability and limited waiting time constraint. Comput Ind Eng 173:108745","DOI":"10.1016\/j.cie.2022.108745"},{"key":"5055_CR15","doi-asserted-by":"crossref","unstructured":"Ahmadianfar I, Heidari AA, Gandomi AH, Chu XF, Chen HL (2021) RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method. Expert Syst Applic 181:115079","DOI":"10.1016\/j.eswa.2021.115079"},{"key":"5055_CR16","doi-asserted-by":"publisher","first-page":"115539","DOI":"10.1016\/j.enconman.2022.115539","volume":"258","author":"H Abd El-Sattar","year":"2022","unstructured":"Abd El-Sattar H, Kamel S, Hassan MH, Jurado F (2022) Optimal sizing of an off-grid hybrid photovoltaic\/biomass gasifier\/battery system using a quantum model of Runge Kutta algorithm. Energy Convers Manag 258:115539","journal-title":"Energy Convers Manag"},{"issue":"3","key":"5055_CR17","doi-asserted-by":"publisher","first-page":"4803","DOI":"10.32604\/cmc.2022.020847","volume":"70","author":"DR Manjula","year":"2022","unstructured":"Manjula DR, Premkumar M, Jangir P, Mohamed AE, Rajvikram ME, Nisar KS (2022) IRKO: An improved runge-kutta optimization algorithm for global optimization problems. Comput Mater Continua 70(3):4803\u20134827","journal-title":"Comput Mater Continua"},{"key":"5055_CR18","doi-asserted-by":"crossref","unstructured":"Chen HL, Ahmadianfar I, Liang GX, Bakhsizadeh H, Azad B, Chu XF (2022) A successful candidate strategy with Runge-Kutta optimization for multi-hydropower reservoir optimization. Expert Syst Applic 209:118383","DOI":"10.1016\/j.eswa.2022.118383"},{"key":"5055_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2017.09.010","volume":"39","author":"S Mahdavi","year":"2018","unstructured":"Mahdavi S, Rahnamayan S, Deb K (2018) Opposition based learning: A literature review. Swarm Evol Comput 39:1\u201323","journal-title":"Swarm Evol Comput"},{"key":"5055_CR20","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.eswa.2017.07.043","volume":"90","author":"M Abd Elaziz","year":"2017","unstructured":"Abd Elaziz M, Oliva D, Xiong S (2017) An improved opposition-based sine cosine algorithm for global optimization. Expert Syst Appl 90:484\u2013500","journal-title":"Expert Syst Appl"},{"key":"5055_CR21","doi-asserted-by":"publisher","first-page":"113389","DOI":"10.1016\/j.eswa.2020.113389","volume":"151","author":"S Dhargupta","year":"2020","unstructured":"Dhargupta S, Ghosh M, Mirjalili S, Sarkar R (2020) Selective opposition based grey wolf optimization. Expert Syst Appl 151:113389","journal-title":"Expert Syst Appl"},{"key":"5055_CR22","doi-asserted-by":"publisher","first-page":"13224","DOI":"10.1007\/s10489-022-04201-z","volume":"53","author":"BH Abed-alguni","year":"2023","unstructured":"Abed-alguni BH, Alawad NA, Al-Betar MA, Paul D (2023) Opposition-based sine cosine optimizer utilizing refraction learning and variable neighborhood search for feature selection. Appl Intell 53:13224\u201313260","journal-title":"Appl Intell"},{"key":"5055_CR23","doi-asserted-by":"publisher","first-page":"115481","DOI":"10.1016\/j.eswa.2021.115481","volume":"184","author":"D Oliva","year":"2021","unstructured":"Oliva D, Esquivel-Torres S, Hinojosa S, P\u00e9rez-Cisneros M, Osuna-Enciso V, Ortega-S\u00e1nchez N, Dhiman G, Heidari AA (2021) Opposition-based moth swarm algorithm. Expert Syst Appl 184:115481","journal-title":"Expert Syst Appl"},{"key":"5055_CR24","doi-asserted-by":"publisher","first-page":"116035","DOI":"10.1016\/j.eswa.2021.116035","volume":"189","author":"P Musikawan","year":"2022","unstructured":"Musikawan P, Kongsorot Y, Muneesawang P, So-In C (2022) An enhanced obstacle-aware deployment scheme with an opposition-based competitive swarm optimizer for mobile WSNs. Expert Syst Appl 189:116035","journal-title":"Expert Syst Appl"},{"key":"5055_CR25","doi-asserted-by":"crossref","unstructured":"Khouja M, Goyal S (2008) A review of the joint replenishment problem literature: 1989\u20132005. Eur J Oper Res 186(1):1\u201316","DOI":"10.1016\/j.ejor.2007.03.007"},{"issue":"16","key":"5055_CR26","doi-asserted-by":"publisher","first-page":"4625","DOI":"10.1080\/00207543.2016.1276306","volume":"55","author":"XY Ai","year":"2017","unstructured":"Ai XY, Zhang JL, 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":"5055_CR27","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 YR, Qu H, Wang L (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":"5055_CR28","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, Castano F, Sarache W, Costa Y (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"},{"key":"5055_CR29","doi-asserted-by":"crossref","unstructured":"Khoukhi S, Bojji C, Bensouda Y (2021) Joint optimisation of replenishment policies on a downstream multi-echelon, multi-product pharmaceutical supply chain with lost sales, stochastic demands and storage capacity constraints: Centralised vs. decentralised structure. Int J Logist Syst Manag 39(1):1\u201321","DOI":"10.1504\/IJLSM.2021.115072"},{"key":"5055_CR30","doi-asserted-by":"publisher","first-page":"107051","DOI":"10.1016\/j.cie.2020.107051","volume":"153","author":"R Liu","year":"2021","unstructured":"Liu R, Wang SR, Pi YY, Qin QD (2021) An effective heuristic with evolutionary algorithm for the coordinated capacitated dynamic lot-size and delivery problem. Comput Ind Eng 153:107051","journal-title":"Comput Ind Eng"},{"issue":"4","key":"5055_CR31","doi-asserted-by":"publisher","first-page":"2288","DOI":"10.1111\/itor.12905","volume":"29","author":"S Wang","year":"2022","unstructured":"Wang S, Wang L (2022) Efficient methods for stochastic joint replenishment and delivery problem. Int Trans Oper Res 29(4):2288\u20132315","journal-title":"Int Trans Oper Res"},{"key":"5055_CR32","doi-asserted-by":"crossref","unstructured":"Goyal SK (1985) Economic order quantity under conditions of permissible delay in payments. J Oper Res Soc 36(4):335\u2013338","DOI":"10.1057\/jors.1985.56"},{"key":"5055_CR33","doi-asserted-by":"crossref","unstructured":"Abad PL, Jaggi CK (2003) A joint approach for setting unit price and the length of the credit period for a seller when end demand is price sensitive. Int J Prod Econ 83:115\u2013122","DOI":"10.1016\/S0925-5273(02)00142-1"},{"issue":"4","key":"5055_CR34","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1080\/09537280701322241","volume":"18","author":"S Mohan","year":"2007","unstructured":"Mohan S, Gopalakrishnan M (2007) Analytical framework for the multi-item, economic order quantity model with permissible delay in payments and a budget constraint. A note. Prod Plann Control 18(4):361\u2013363","journal-title":"Prod Plann Control"},{"key":"5055_CR35","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1142\/S0217595908001651","volume":"25","author":"CT Chang","year":"2008","unstructured":"Chang CT, Teng JT, Goyal SK (2008) Inventory lot-size models under trade credits:a review. Asia-Pac J Oper Res 25:89\u2013112","journal-title":"Asia-Pac J Oper Res"},{"issue":"1","key":"5055_CR36","first-page":"63","volume":"24","author":"YC Tsao","year":"2013","unstructured":"Tsao YC, Teng WG (2013) Heuristics for the joint multi-item replenishment problem under trade credits. IMA J Manag Math 24(1):63\u201377","journal-title":"IMA J Manag Math"},{"issue":"6","key":"5055_CR37","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, Wang L (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":"5055_CR38","doi-asserted-by":"publisher","first-page":"7561","DOI":"10.1007\/s00521-022-08052-0","volume":"35","author":"L Peng","year":"2023","unstructured":"Peng L, Wang L, Wang S (2023) Hybrid arithmetic optimization algorithm for a new multi-warehouse joint replenishment and delivery problem under trade credit. Neural Comput Appl 35:7561\u20137580","journal-title":"Neural Comput Appl"},{"key":"5055_CR39","doi-asserted-by":"crossref","unstructured":"Lee FC, Yao MJ (2003) A global optimum search algorithm for the joint replenishment problem under power-of-two policy. Comput Oper Res 30:1319\u20131333","DOI":"10.1016\/S0305-0548(02)00073-4"},{"key":"5055_CR40","doi-asserted-by":"publisher","first-page":"106128","DOI":"10.1016\/j.cor.2022.106128","volume":"151","author":"L Wang","year":"2023","unstructured":"Wang L, Wang S, Gong Y, Peng L (2023) Optimizing a multi-echelon location inventory problem with joint replenishment: A Lipschitz \u03f5-optimal approach using Lagrangian relaxation. Comput Oper Res 151:106128","journal-title":"Comput Oper Res"},{"key":"5055_CR41","doi-asserted-by":"crossref","unstructured":"Tizhoosh H (2005) Opposition-based learning: A new scheme for machine intelligence. International Conference on Computational Intelligence For Modelling, Control And Automation And International Conference On Intelligent Agents, Web Technologies and Internet Commerce, 695\u2013701","DOI":"10.1109\/CIMCA.2005.1631345"},{"issue":"5","key":"5055_CR42","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1109\/TEVC.2009.2014613","volume":"13","author":"J Zhang","year":"2009","unstructured":"Zhang J, Sanderson AC (2009) JADE: Adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13(5):945\u2013958","journal-title":"IEEE Trans Evol Comput"},{"key":"5055_CR43","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) SCA: A sine cosine algorithm for solving optimization problems. Knowl-Based Syst 96:120\u2013133","journal-title":"Knowl-Based Syst"},{"key":"5055_CR44","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.knosys.2012.06.007","volume":"36","author":"L Wang","year":"2012","unstructured":"Wang L, Dun CX, Bi WJ, Zeng YR (2012) An effective and efficient differential evolution algorithm for the integrated stochastic joint replenishment and delivery model. Knowl-Based Syst 36:104\u2013114","journal-title":"Knowl-Based Syst"},{"key":"5055_CR45","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1007\/s10479-020-03902-3","volume":"319","author":"\u00d6F Y\u0131lmaz","year":"2022","unstructured":"Y\u0131lmaz \u00d6F, Yaz\u0131c\u0131 B (2022) Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches. Ann Oper Res 319:1793\u20131843","journal-title":"Ann Oper Res"},{"key":"5055_CR46","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1016\/j.ejor.2019.09.048","volume":"282","author":"\u00d6F Yilmaz","year":"2020","unstructured":"Yilmaz \u00d6F, Ozcelik G, Yeni FB (2020) Lean holistic fuzzy methodologyemploying cross-functional worker teams for new product development projects: Areal case study from high-tech industry. Eur J Oper Res 282:989\u20131010","journal-title":"Eur J Oper Res"},{"key":"5055_CR47","doi-asserted-by":"crossref","unstructured":"Tirkolaee EB, Mahdavi I, Esfahani MMS, Weber GW (2020a) A robust green location-allocation-inventory problem to design an urban waste management system under uncertainty. Waste Manag 102:340\u2013350","DOI":"10.1016\/j.wasman.2019.10.038"},{"key":"5055_CR48","doi-asserted-by":"publisher","first-page":"122927","DOI":"10.1016\/j.jclepro.2020.122927","volume":"276","author":"EB Tirkolaee","year":"2020","unstructured":"Tirkolaee EB, Goli A, Faridnia A, Soltani M, Weber GW (2020) Multi-objective optimization for the reliable pollution-routing problem with cross-dock selection using Pareto-based algorithms. J Clean Prod 276:122927","journal-title":"J Clean Prod"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05055-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-05055-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05055-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T06:19:30Z","timestamp":1703744370000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-05055-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":48,"journal-issue":{"issue":"24","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["5055"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-05055-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"26 September 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interests"}}]}}