{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T23:09:31Z","timestamp":1769728171761,"version":"3.49.0"},"reference-count":93,"publisher":"Springer Science and Business Media LLC","issue":"21-22","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100010688","name":"Instituto Nacional de Ci\u00eancia e Tecnologia da Criosfera","doi-asserted-by":"publisher","award":["306"],"award-info":[{"award-number":["306"]}],"id":[{"id":"10.13039\/501100010688","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010688","name":"Instituto Nacional de Ci\u00eancia e Tecnologia da Criosfera","doi-asserted-by":"publisher","award":["075\/2017-2"],"award-info":[{"award-number":["075\/2017-2"]}],"id":[{"id":"10.13039\/501100010688","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["430"],"award-info":[{"award-number":["430"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["137\/2018-4"],"award-info":[{"award-number":["137\/2018-4"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018908","name":"Funda\u00e7\u00e3o Nacional de Desenvolvimento do Ensino Superior Particular","doi-asserted-by":"publisher","award":["2700441"],"award-info":[{"award-number":["2700441"]}],"id":[{"id":"10.13039\/501100018908","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s00500-024-10363-4","type":"journal-article","created":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T05:35:17Z","timestamp":1732599317000},"page":"12763-12786","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing logistics efficiency: an integrated approach to joint zone picking, order batching, and vehicle routing with time windows"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1522-1768","authenticated-orcid":false,"given":"Esra","family":"Boz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1069-2314","authenticated-orcid":false,"given":"Anderson Rog\u00e9rio Faia","family":"Pinto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0239-1725","authenticated-orcid":false,"given":"Marcelo Seido","family":"Nagano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,26]]},"reference":[{"key":"10363_CR1","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.asoc.2018.11.019","volume":"75","author":"E Ardjmand","year":"2019","unstructured":"Ardjmand E, Bajgiran OS, Youssef E (2019) Using list-based simulated annealing and genetic algorithm for order batching and picker routing in put wall based picking systems. Appl Soft Comput 75:106\u2013119. https:\/\/doi.org\/10.1016\/j.asoc.2018.11.019","journal-title":"Appl Soft Comput"},{"key":"10363_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113566","volume":"159","author":"E Ardjmand","year":"2020","unstructured":"Ardjmand E et al (2020) A hybrid artificial neural network, genetic algorithm and column generation heuristic for minimizing makespan in manual order picking operations. Expert Syst Appl 159:113566. https:\/\/doi.org\/10.1016\/j.eswa.2020.113566","journal-title":"Expert Syst Appl"},{"issue":"8","key":"10363_CR94","doi-asserted-by":"publisher","first-page":"711","DOI":"10.2307\/3009313","volume":"30","author":"RD Armstrong","year":"1979","unstructured":"Armstrong RD, Cook WD, Saipe AL (1979) Optimal batching in a semi-automated order picking system. J Oper Res Soc 30(8):711\u2013720. https:\/\/doi.org\/10.2307\/3009313","journal-title":"J Oper Res Soc"},{"issue":"1","key":"10363_CR92","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2013\/246578","volume":"2013","author":"AH Azadnia","year":"2013","unstructured":"Azadnia AH, Taheri S, Ghadimi P, Mat Saman MZ, Wong KY (2013) Order batching in warehouses by minimizing total tardiness: a hybrid approach of weighted association rule mining and genetic algorithms. Sci World J 2013(1):1\u201313. https:\/\/doi.org\/10.1155\/2013\/246578","journal-title":"Sci World J"},{"issue":"1","key":"10363_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1993.1.1.1","volume":"1","author":"T B\u00e4ck","year":"1993","unstructured":"B\u00e4ck T, Schwefel HP (1993) An Overview of evolutionary algorithms for parameter optimization. Evol Comput 1(1):1\u201328. https:\/\/doi.org\/10.1162\/evco.1993.1.1.1","journal-title":"Evol Comput"},{"key":"10363_CR5","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.asoc.2015.08.052","volume":"37","author":"A Baykaso\u011flu","year":"2015","unstructured":"Baykaso\u011flu A, Akpinar \u015e (2015) Weighted superposition attraction (WSA): a swarm intelligence algorithm for optimization problems\u2014part 2: constrained optimization. Appl Soft Comput 37:396\u2013415. https:\/\/doi.org\/10.1016\/j.asoc.2015.08.052","journal-title":"Appl Soft Comput"},{"key":"10363_CR6","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1016\/j.asoc.2015.10.036","volume":"56","author":"A Baykaso\u011flu","year":"2017","unstructured":"Baykaso\u011flu A, Akpinar \u015e (2017) Weighted superposition attraction (WSA): a swarm intelligence algorithm for optimization problems\u2014part 1: unconstrained optimization. Appl Soft Comput 56:520\u2013540. https:\/\/doi.org\/10.1016\/j.asoc.2015.10.036","journal-title":"Appl Soft Comput"},{"key":"10363_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.eswa.2017.11.048","volume":"96","author":"A Baykaso\u011flu","year":"2018","unstructured":"Baykaso\u011flu A, Ozsoydan FB (2018) Dynamic optimization in binary search spaces via weighted superposition attraction. Expert Syst Appl 96:157\u2013174. https:\/\/doi.org\/10.1016\/j.eswa.2017.11.048","journal-title":"Expert Syst Appl"},{"key":"10363_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/J.ESWA.2019.07.009","volume":"138","author":"A Baykaso\u011flu","year":"2019","unstructured":"Baykaso\u011flu A, \u015eenol ME (2019) Weighted superposition attraction for combinatorial optimization. Expert Syst Appl 138:112792. https:\/\/doi.org\/10.1016\/J.ESWA.2019.07.009","journal-title":"Expert Syst Appl"},{"issue":"4","key":"10363_CR9","doi-asserted-by":"publisher","first-page":"2555","DOI":"10.1007\/s12351-018-0427-9","volume":"20","author":"A Baykaso\u011flu","year":"2020","unstructured":"Baykaso\u011flu A, Ozsoydan FB, Senol ME (2020) Weighted superposition attraction for binary optimization problems. Oper Res Int Journal 20(4):2555\u20132581. https:\/\/doi.org\/10.1007\/s12351-018-0427-9","journal-title":"Oper Res Int Journal"},{"issue":"2","key":"10363_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1108\/01443570210414338","volume":"22","author":"JWM Bertrand","year":"2002","unstructured":"Bertrand JWM, Fransoo JC (2002) Modelling and simulation: operations management research methodologies using quantitative modeling. Int J Oper Prod Manag 22(2):241\u2013264. https:\/\/doi.org\/10.1108\/01443570210414338","journal-title":"Int J Oper Prod Manag"},{"issue":"8","key":"10363_CR11","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1016\/j.compchemeng.2003.11.003","volume":"28","author":"LT Biegler","year":"2004","unstructured":"Biegler LT, Grossmann IE (2004) Retrospective on optimization. Comput Chem Eng 28(8):1169\u20131192. https:\/\/doi.org\/10.1016\/j.compchemeng.2003.11.003","journal-title":"Comput Chem Eng"},{"key":"10363_CR12","doi-asserted-by":"publisher","unstructured":"Boz E, Aras N (2024) B\u00fct\u00fcnle\u015fik sipari\u015f gruplama ve zaman pencereli ara\u00e7 rotalama problemi. Gazi \u00dcniversitesi M\u00fchendislik Mimarl\u0131k Fak\u00fcltesi Dergisi 39(4):2223\u20132238. https:\/\/doi.org\/10.17341\/gazimmfd.1144003","DOI":"10.17341\/gazimmfd.1144003"},{"issue":"1","key":"10363_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy O, Gendreau M (2005) Vehicle routing problem with time windows. Part II: metaheuristics. Transp Sci 39(1):119\u2013139. https:\/\/doi.org\/10.1287\/trsc.1030.0057","journal-title":"Transp Sci"},{"issue":"2","key":"10363_CR16","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.ejor.2020.01.059","volume":"285","author":"O Briant","year":"2020","unstructured":"Briant O, Cambazard H, Cattaruzza D, Catusse N, Ladier AL, Ogier M (2020) An efficient and general approach for the joint order batching and picker routing problem. Eur J Oper Res 285(2):497\u2013512. https:\/\/doi.org\/10.1016\/j.ejor.2020.01.059","journal-title":"Eur J Oper Res"},{"key":"10363_CR90","doi-asserted-by":"publisher","unstructured":"Bustillo M, Men\u00e9ndez B, Pardo EG, Duarte A (2015) An algorithm for batching, sequencing and picking operations in a warehouse. In: IEEE Xplore (eds) International Conference on Industrial Engineering and Systems Management (IESM) 2015. Seville, Spain, p 842\u2013849. https:\/\/doi.org\/10.1109\/IESM.2015.7380254. Accessed 10 Jun 2021","DOI":"10.1109\/IESM.2015.7380254"},{"issue":"3","key":"10363_CR17","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1080\/17509653.2021.1991852","volume":"17","author":"JA Cano","year":"2021","unstructured":"Cano JA, Cort\u00e9s P, Campo EA, Correa-Espinal AA (2021) Multi-objective grouping genetic algorithm for the joint order batching, batch assignment and sequencing problem. Int J Manage Sci Eng Manage 17(3):188\u2013204. https:\/\/doi.org\/10.1080\/17509653.2021.1991852","journal-title":"Int J Manage Sci Eng Manage"},{"key":"10363_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106310","author":"B \u00c7atay","year":"2023","unstructured":"\u00c7atay B, Sadati \u0130 (2023) An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging\/battery swapping. Comput Operat Res. https:\/\/doi.org\/10.1016\/j.cor.2023.106310","journal-title":"Comput Operat Res"},{"issue":"1","key":"10363_CR19","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10845-016-1248-4","volume":"30","author":"\u00c7 Cergibozan","year":"2019","unstructured":"Cergibozan \u00c7, Tasan A (2019) Order batching operations: an overview of classification, solution techniques, and future research. J Intell Manuf 30(1):335\u2013349. https:\/\/doi.org\/10.1007\/s10845-016-1248-4","journal-title":"J Intell Manuf"},{"key":"10363_CR89","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.ijpe.2014.09.029","volume":"159","author":"TL Chen","year":"2015","unstructured":"Chen TL, Cheng CY, Chen YY, Chan LK (2015) An efficient hybrid algorithm for integrated order batching, sequencing and routing problem. Int J Prod Econ 159:158\u2013167. https:\/\/doi.org\/10.1016\/j.ijpe.2014.09.029","journal-title":"Int J Prod Econ"},{"key":"10363_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107823","volume":"163","author":"W Chen","year":"2022","unstructured":"Chen W, Zhang Y, Zhou Y (2022) Integrated scheduling of zone picking and vehicle routing problem with time windows in the front warehouse mode. Comput Ind Eng 163:107823. https:\/\/doi.org\/10.1016\/j.cie.2021.107823","journal-title":"Comput Ind Eng"},{"issue":"4","key":"10363_CR96","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"GU Clarke","year":"1964","unstructured":"Clarke GU, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581. https:\/\/doi.org\/10.1287\/opre.12.4.568","journal-title":"Oper Res"},{"issue":"2\u20138","key":"10363_CR21","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF00113894","volume":"8","author":"K De Jong","year":"1988","unstructured":"De Jong K (1988) Learning with genetic algorithms: an overview. Mach Learn 8(2\u20138):121\u2013188. https:\/\/doi.org\/10.1007\/BF00113894","journal-title":"Mach Learn"},{"issue":"17","key":"10363_CR22","doi-asserted-by":"publisher","first-page":"5332","DOI":"10.1080\/00207543.2021.1955995","volume":"60","author":"EN Duman","year":"2022","unstructured":"Duman EN, Ta\u015f D, \u00c7atay B (2022) Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows. Int J Prod Res 60(17):5332\u20135353. https:\/\/doi.org\/10.1080\/00207543.2021.1955995","journal-title":"Int J Prod Res"},{"issue":"3","key":"10363_CR23","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.jksus.2010.03.002","volume":"22","author":"NA El-Sherbeny","year":"2010","unstructured":"El-Sherbeny NA (2010) Vehicle routing with time windows: an overview of exact, heuristic and metaheuristic methods. J King Saud Univ Sci 22(3):123\u2013131. https:\/\/doi.org\/10.1016\/j.jksus.2010.03.002","journal-title":"J King Saud Univ Sci"},{"issue":"1","key":"10363_CR24","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/07408170590516917","volume":"37","author":"N Gademann","year":"2005","unstructured":"Gademann N, Van de Velde S (2005) Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Trans 37(1):63\u201375. https:\/\/doi.org\/10.1080\/07408170590516917","journal-title":"IIE Trans"},{"key":"10363_CR25","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/104279","author":"X Gan","year":"2012","unstructured":"Gan X, Wang Y, Li S, Niu Ben (2012) Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on MCPSO. Math Probl Eng. https:\/\/doi.org\/10.1155\/2012\/104279","journal-title":"Math Probl Eng"},{"key":"10363_CR26","volume-title":"Genetic algorithms and engineering optimization","author":"M Gen","year":"2000","unstructured":"Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, New York"},{"key":"10363_CR27","volume-title":"Network models and optimization: multiobjective genetic algorithms approach","author":"M Gen","year":"2008","unstructured":"Gen M, Cheng R, Lin L (2008) Network models and optimization: multiobjective genetic algorithms approach. Springer, London"},{"issue":"1","key":"10363_CR98","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0377-2217(92)90235-2","volume":"58","author":"DR Gibson","year":"1992","unstructured":"Gibson DR, Sharp GP (1992) Order batching procedures. Eur J Oper 58(1):57\u201367. https:\/\/doi.org\/10.1016\/0377-2217(92)90235-2","journal-title":"Eur J Oper"},{"key":"10363_CR28","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning, 2nd edn. Addison-Wesley Co., Massachusetts","edition":"2"},{"key":"10363_CR29","unstructured":"Goldberg DE, Lingle R (1985) Alleles, loci, and the traveling salesman problem. In: Jonh J (ed) ICGA proceedings of the first international conference on genetic algorithms and their applications, Pittsburgh, USA, paper no. 15, ICGA, Pittsburgh, pp. 154\u2013159"},{"issue":"3","key":"10363_CR30","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.techfore.2012.10.002","volume":"80","author":"K Haegeman","year":"2013","unstructured":"Haegeman K, Marinelli E, Scapolo F, Ricci A, Sokolov A (2013) Quantitative and qualitative approaches in future-oriented technology analysis (FTA): from combination to integration? Technol Forecast Soc Chang 80(3):386\u2013397. https:\/\/doi.org\/10.1016\/j.techfore.2012.10.002","journal-title":"Technol Forecast Soc Chang"},{"key":"10363_CR31","volume-title":"Practical genetic algorithms","author":"RL Haupt","year":"2004","unstructured":"Haupt RL, Haupt SE (2004) Practical genetic algorithms, 2nd edn. John Wiley & Sons Inc., New York","edition":"2"},{"issue":"2","key":"10363_CR91","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.cie.2013.07.003","volume":"66","author":"S Henn","year":"2013","unstructured":"Henn S, Schmid V (2013) Metaheuristics for order batching and sequencing in manual order picking systems. Comput Ind Eng 66(2):338\u2013351. https:\/\/doi.org\/10.1016\/j.cie.2013.07.003","journal-title":"Comput Ind Eng"},{"issue":"1","key":"10363_CR88","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s10696-012-9164-1","volume":"27","author":"S Henn","year":"2015","unstructured":"Henn S (2015) Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses. Flex Serv Manuf J 27(1):86\u2013114. https:\/\/doi.org\/10.1007\/s10696-012-9164-1","journal-title":"Flex Serv Manuf J"},{"key":"10363_CR32","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.cie.2017.09.014","volume":"113","author":"YC Ho","year":"2017","unstructured":"Ho YC, Lin JW (2017) Improving order-picking performance by converting a sequential zone-picking line into a zone-picking network. Comput Ind Eng 113:241\u2013255. https:\/\/doi.org\/10.1016\/j.cie.2017.09.014","journal-title":"Comput Ind Eng"},{"key":"10363_CR33","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor"},{"issue":"2","key":"10363_CR97","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.compind.2004.06.001","volume":"56","author":"CM Hsu","year":"2005","unstructured":"Hsu CM, Chen KY, Chen MC (2005) Batching orders in warehouses by minimizing travel distance with genetic algorithms. Comput Ind 56(2):169\u2013178. https:\/\/doi.org\/10.1016\/j.compind.2004.06.001","journal-title":"Comput Ind"},{"issue":"115943","key":"10363_CR34","doi-asserted-by":"publisher","first-page":"2327","DOI":"10.1016\/j.eswa.2021.115943","volume":"187","author":"X Jiang","year":"2022","unstructured":"Jiang X, Sun L, Zhang Y, Hu X (2022) Order batching and sequencing for minimising the total order completion time in pick-and-sort warehouses. Expert Syst Appl 187(115943):2327\u20132336. https:\/\/doi.org\/10.1016\/j.eswa.2021.115943","journal-title":"Expert Syst Appl"},{"issue":"24","key":"10363_CR35","doi-asserted-by":"publisher","first-page":"10247","DOI":"10.3390\/su122410247","volume":"12","author":"J Koch","year":"2020","unstructured":"Koch J, Frommeyer B, Schewe G (2020) Online shopping motives during the COVID-19 pandemic\u2013lessons from the crisis. Sustainability 12(24):10247. https:\/\/doi.org\/10.3390\/su122410247","journal-title":"Sustainability"},{"issue":"2020","key":"10363_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2020.106645","volume":"137","author":"P K\u00fcbler","year":"2020","unstructured":"K\u00fcbler P, Glock CH, Bauernhansl T (2020) A new iterative method for solving the joint dynamic storage location assignment, order batching and picker routing problem in manual picker-to-parts warehouses. Comput Indus Eng 137(2020):1\u201320. https:\/\/doi.org\/10.1016\/j.cie.2020.106645","journal-title":"Comput Indus Eng"},{"key":"10363_CR37","volume-title":"Optimal order batching for automated warehouse picking (master\u2019s thesis)","author":"Z Kucuksari","year":"2023","unstructured":"Kucuksari Z (2023) Optimal order batching for automated warehouse picking (master\u2019s thesis). University of Waterloo, Waterloo"},{"issue":"3","key":"10363_CR38","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1016\/j.ejor.2020.03.075","volume":"294","author":"H Kuhn","year":"2021","unstructured":"Kuhn H, Schubert D, Holzapfel A (2021) Integrated order batching and vehicle routing operations in grocery retail\u2014a general adaptive large neighborhood search algorithm. Eur J Oper Res 294(3):1003\u20131021. https:\/\/doi.org\/10.1016\/j.ejor.2020.03.075","journal-title":"Eur J Oper Res"},{"key":"10363_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116264","volume":"191","author":"RJ Kuo","year":"2022","unstructured":"Kuo RJ, Lu SH, Lai PY, Mara STW (2022) Vehicle routing problem with drones considering time windows. Expert Syst Appl 191:116264. https:\/\/doi.org\/10.1016\/j.eswa.2021.116264","journal-title":"Expert Syst Appl"},{"issue":"3","key":"10363_CR40","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1080\/00207543.2010.543941","volume":"50","author":"T Le-Duc","year":"2012","unstructured":"Le-Duc T, De Koster M (2012) Determining number of zones in a pick-and-pack order picking system. Int J Prod Res 50(3):757\u2013771. https:\/\/doi.org\/10.1080\/00207543.2010.543941","journal-title":"Int J Prod Res"},{"issue":"7\u20138","key":"10363_CR41","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1080\/02642069.2022.2047941","volume":"42","author":"WM Lim","year":"2022","unstructured":"Lim WM, Kumar S, Ali F (2022) Advancing knowledge through literature reviews: \u2018what\u2019, \u2018why\u2019, and \u2018how to contribute.\u2019 Serv Ind J 42(7\u20138):481\u2013513. https:\/\/doi.org\/10.1080\/02642069.2022.2047941","journal-title":"Serv Ind J"},{"issue":"2","key":"10363_CR42","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00500-008-0303-2","volume":"13","author":"L Lin","year":"2009","unstructured":"Lin L, Gen M (2009) Auto-tuning strategy for evolutionary algorithms: balancing between exploration and exploitation. Soft Comput 13(2):157\u2013168. https:\/\/doi.org\/10.1007\/s00500-008-0303-2","journal-title":"Soft Comput"},{"issue":"1","key":"10363_CR43","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.cam.2004.07.034","volume":"184","author":"J McCall","year":"2005","unstructured":"McCall J (2005) Genetic algorithms for modelling and optimisation. J Comput Appl Math 184(1):205\u2013222. https:\/\/doi.org\/10.1016\/j.cam.2004.07.034","journal-title":"J Comput Appl Math"},{"issue":"1","key":"10363_CR44","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ejor.2017.05.001","volume":"263","author":"B Men\u00e9ndez","year":"2017","unstructured":"Men\u00e9ndez B, Bustillo M, Pardo EG, Duarte A (2017) General variable neighborhood search for the order batching and sequencing problem. Eur J Oper Res 263(1):82\u201393. https:\/\/doi.org\/10.1016\/j.ejor.2017.05.001","journal-title":"Eur J Oper Res"},{"issue":"1","key":"10363_CR87","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z, Schoenauer M (1996) Evolutionary algorithms for constrained parameter optimization problems. Evol Comput 4(1):1\u201332","journal-title":"Evol Comput"},{"key":"10363_CR45","doi-asserted-by":"publisher","unstructured":"Mishra A, Shukla A (2017) Analysis of the effect of elite count on the behavior of genetic algorithms: a perspective. In: 2017 IEEE 7th international advance computing conference (IACC). IEEE. pp. 835\u2013840. https:\/\/doi.org\/10.1109\/IACC.2017.0172.","DOI":"10.1109\/IACC.2017.0172"},{"key":"10363_CR46","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An introduction to genetic algorithms","author":"M Mitchell","year":"1996","unstructured":"Mitchell M (1996) An introduction to genetic algorithms. MIT Press, Cambridge"},{"key":"10363_CR47","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1146\/annurev.ecolsys.30.1.593","volume":"80","author":"M Mitchell","year":"1999","unstructured":"Mitchell M, Taylor CE (1999) Evolutionary computation: an overview. Annu Rev Ecol Syst 80:598\u2013616. https:\/\/doi.org\/10.1146\/annurev.ecolsys.30.1.593","journal-title":"Annu Rev Ecol Syst"},{"issue":"4","key":"10363_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asej.2021.11.003","volume":"13","author":"AH Mohamad","year":"2022","unstructured":"Mohamad AH, Hassan GF, Abd Elrahman AS (2022) Impacts of e-commerce on planning and designing commercial activities centers: a developed approach. Ain Shams Eng J 13(4):1\u201310. https:\/\/doi.org\/10.1016\/j.asej.2021.11.003","journal-title":"Ain Shams Eng J"},{"issue":"4","key":"10363_CR49","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s10696-017-9287-5","volume":"30","author":"S Moons","year":"2018","unstructured":"Moons S, Ramaekers K, Caris A, Arda Y (2018) Integration of order picking and vehicle routing in a B2C e-commerce context. Flex Serv Manuf J 30(4):813\u2013843. https:\/\/doi.org\/10.1007\/s10696-017-9287-5","journal-title":"Flex Serv Manuf J"},{"issue":"20","key":"10363_CR50","doi-asserted-by":"publisher","first-page":"6405","DOI":"10.1080\/00207543.2019.1566668","volume":"57","author":"S Moons","year":"2019","unstructured":"Moons S, Braekers K, Ramaekers K, Caris A, Arda Y (2019) The value of integrating order picking and vehicle routing decisions in a B2C e-commerce environment. Int J Prod Res 57(20):6405\u20136423. https:\/\/doi.org\/10.1080\/00207543.2019.1566668","journal-title":"Int J Prod Res"},{"issue":"1","key":"10363_CR51","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.ejor.2014.11.025","volume":"243","author":"T \u00d6ncan","year":"2015","unstructured":"\u00d6ncan T (2015) MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem. Eur J Oper Res 243(1):142\u2013155. https:\/\/doi.org\/10.1016\/j.ejor.2014.11.025","journal-title":"Eur J Oper Res"},{"key":"10363_CR52","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-021-00664-7","author":"M Ostermeier","year":"2020","unstructured":"Ostermeier M, Holzapfel A, Kuhn H, Schubert D (2020) Integrated zone picking and vehicle routing operations with restricted intermediate storage. OR Spectrum. https:\/\/doi.org\/10.1007\/s00291-021-00664-7","journal-title":"OR Spectrum"},{"key":"10363_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2022.102783","volume":"164","author":"A Pahwa","year":"2022","unstructured":"Pahwa A, Jaller M (2022) A cost-based comparative analysis of different last-mile strategies for e-commerce delivery. Transp Res E Logist Transp Rev 164:102783. https:\/\/doi.org\/10.1016\/j.tre.2022.102783","journal-title":"Transp Res E Logist Transp Rev"},{"issue":"5","key":"10363_CR54","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1016\/j.tre.2007.03.002","volume":"44","author":"PJ Parikh","year":"2008","unstructured":"Parikh PJ, Meller RD (2008) Selecting between batch and zone order picking strategies in a distribution center. Transp Res E Logist Transp Rev 44(5):696\u2013719. https:\/\/doi.org\/10.1016\/j.tre.2007.03.002","journal-title":"Transp Res E Logist Transp Rev"},{"key":"10363_CR55","unstructured":"Park J, Fibrianto HY, Hong S (2022) Order batching and sequencing in a sequential zone order picking system with consideration of workload balance. In:\u00a0IIE annual conference. Proceedings. Institute of Industrial and Systems Engineers (IISE). pp. 1\u20136"},{"issue":"3\u20134","key":"10363_CR56","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s11740-019-00904-4","volume":"13","author":"ARF Pinto","year":"2019","unstructured":"Pinto ARF, Nagano MS (2019) An approach for the solution to order batching and sequencing in picking systems. Prod Eng Res Dev 13(3\u20134):325\u2013341. https:\/\/doi.org\/10.1007\/s11740-019-00904-4","journal-title":"Prod Eng Res Dev"},{"issue":"3","key":"10363_CR57","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10845-019-01470-3","volume":"31","author":"ARF Pinto","year":"2020","unstructured":"Pinto ARF, Nagano MS (2020) Genetic algorithms applied to integration and optimization of billing and picking processes. J Intell Manuf 31(3):641\u2013659. https:\/\/doi.org\/10.1007\/s10845-019-01470-3","journal-title":"J Intell Manuf"},{"issue":"2","key":"10363_CR58","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10845-015-1116-7","volume":"29","author":"ARF Pinto","year":"2018","unstructured":"Pinto ARF, Crepaldi AF, Nagano MS (2018) A Genetic algorithm applied to pick sequencing for billing. J Intell Manuf 29(2):405\u2013422. https:\/\/doi.org\/10.1007\/s10845-015-1116-7","journal-title":"J Intell Manuf"},{"key":"10363_CR59","doi-asserted-by":"publisher","DOI":"10.1016\/j.rico.2023.100281","volume":"12","author":"ARF Pinto","year":"2023","unstructured":"Pinto ARF, Nagano MS, Boz E (2023) A classification approach to order picking systems and policies: integrating automation and optimization for future research. Results Control Optim 12:100281. https:\/\/doi.org\/10.1016\/j.rico.2023.100281","journal-title":"Results Control Optim"},{"key":"10363_CR60","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.eswa.2016.04.005","volume":"60","author":"Z Qiongbing","year":"2016","unstructured":"Qiongbing Z, Lixin D (2016) A new crossover mechanism for genetic algorithms with variable-length chromosomes for path optimization problems. Expert Syst Appl 60:183\u2013189. https:\/\/doi.org\/10.1016\/j.eswa.2016.04.005","journal-title":"Expert Syst Appl"},{"issue":"56","key":"10363_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12544-018-0333-5","volume":"10","author":"K Ramaekers","year":"2018","unstructured":"Ramaekers K, Caris A, Moons S, van Gils T (2018) Using an integrated order picking-vehicle routing problem to study the impact of delivery time windows in e-commerce. Eur Transp Res Rev 10(56):1\u201311. https:\/\/doi.org\/10.1186\/s12544-018-0333-5","journal-title":"Eur Transp Res Rev"},{"key":"10363_CR62","volume-title":"Warehouse management: a complete guide to improving efficiency and minimizing costs in the modern warehouse","author":"G Richards","year":"2011","unstructured":"Richards G (2011) Warehouse management: a complete guide to improving efficiency and minimizing costs in the modern warehouse. Kogan Page Publishers, London"},{"key":"10363_CR63","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.cor.2018.08.004","volume":"101","author":"PG Saghand","year":"2019","unstructured":"Saghand PG, Charkhgard H, Kwon C (2019) A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach. Comput Oper Res 101:263\u2013274. https:\/\/doi.org\/10.1016\/j.cor.2018.08.004","journal-title":"Comput Oper Res"},{"issue":"7","key":"10363_CR64","doi-asserted-by":"publisher","first-page":"2086","DOI":"10.1080\/00207543.2022.2058433","volume":"61","author":"S Saylam","year":"2023","unstructured":"Saylam S, \u00c7elik M, S\u00fcral H (2023) The min\u2013max order picking problem in synchronised dynamic zone-picking systems. Int J Prod Res 61(7):2086\u20132104. https:\/\/doi.org\/10.1080\/00207543.2022.2058433","journal-title":"Int J Prod Res"},{"issue":"3","key":"10363_CR65","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ejor.2012.08.014","volume":"224","author":"V Schmid","year":"2013","unstructured":"Schmid V, Doerner KF, Laporte G (2013) Rich routing problems arising in supply chain management. Eur J Oper Res 224(3):435\u2013448. https:\/\/doi.org\/10.1016\/j.ejor.2012.08.014","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10363_CR66","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.ejor.2017.04.038","volume":"263","author":"A Scholz","year":"2017","unstructured":"Scholz A, Schubert D, W\u00e4scher G (2017) Order picking with multiple pickers and due dates\u2014simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems. Eur J Oper Res 263(2):461\u2013478. https:\/\/doi.org\/10.1016\/j.ejor.2017.04.038","journal-title":"Eur J Oper Res"},{"issue":"4","key":"10363_CR67","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1007\/s00291-018-0517-3","volume":"40","author":"D Schubert","year":"2018","unstructured":"Schubert D, Scholz A, W\u00e4scher G (2018) Integrated order picking and vehicle routing with due dates. OR Spectrum 40(4):1109\u20131139. https:\/\/doi.org\/10.1007\/s00291-018-0517-3","journal-title":"OR Spectrum"},{"key":"10363_CR68","doi-asserted-by":"publisher","unstructured":"Schubert D, Kuhn H, Holzapfel A (2020) Same-day deliveries in omnichannel retail: integrated order picking and vehicle routing with vehicle-site dependencies. Nav Res Logist 1\u201324. https:\/\/doi.org\/10.1002\/nav.21954. Accessed Nov 2019","DOI":"10.1002\/nav.21954"},{"key":"10363_CR69","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1023\/A:1018948011707","volume":"86","author":"J Schulze","year":"1999","unstructured":"Schulze J, Fahle T (1999) A parallel algorithm for the vehicle routing problem with time window constraints. Ann Oper Res 86:585\u2013607. https:\/\/doi.org\/10.1023\/A:1018948011707","journal-title":"Ann Oper Res"},{"key":"10363_CR70","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2020.103435","volume":"126","author":"F Semiz","year":"2020","unstructured":"Semiz F, Polat F (2020) Solving the area coverage problem with UAVs: a vehicle routing with time windows variation. Robot Auton Syst 126:103435. https:\/\/doi.org\/10.1016\/j.robot.2020.103435","journal-title":"Robot Auton Syst"},{"issue":"2","key":"10363_CR71","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265. https:\/\/doi.org\/10.1287\/opre.35.2.254","journal-title":"Oper Res"},{"key":"10363_CR72","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2022.108634","volume":"254","author":"S Srinivas","year":"2022","unstructured":"Srinivas S, Yu S (2022) Collaborative order picking with multiple pickers and robots: integrated approach for order batching, sequencing and picker-robot routing. Int J Prod Econ 254:108634. https:\/\/doi.org\/10.1016\/j.ijpe.2022.108634","journal-title":"Int J Prod Econ"},{"issue":"3","key":"10363_CR74","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/S0377-2217(98)00086-1","volume":"113","author":"P Toth","year":"1999","unstructured":"Toth P, Vigo D (1999) A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. Eur J Oper Res 113(3):528\u2013543. https:\/\/doi.org\/10.1016\/S0377-2217(98)00086-1","journal-title":"Eur J Oper Res"},{"issue":"22","key":"10363_CR93","doi-asserted-by":"publisher","first-page":"6533","DOI":"10.1080\/00207540701441947","volume":"46","author":"CY Tsai","year":"2008","unstructured":"Tsai CY, Liou JJ, Huang TM (2008) Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time. Int J Prod Res 46(22):6533\u20136555. https:\/\/doi.org\/10.1080\/00207540701441947","journal-title":"Int J Prod Res"},{"issue":"8","key":"10363_CR75","doi-asserted-by":"publisher","first-page":"3097","DOI":"10.1007\/s00500-016-2195-x","volume":"20","author":"CJ Uzor","year":"2016","unstructured":"Uzor CJ, Gongora M, Coupland S, Passow BN (2016) Adaptive-mutation compact genetic algorithm for dynamic environments. Soft Comput 20(8):3097\u20133115. https:\/\/doi.org\/10.1007\/s00500-016-2195-x","journal-title":"Soft Comput"},{"issue":"326","key":"10363_CR95","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1080\/01621459.1969.10500990","volume":"64","author":"HD Vinod","year":"1969","unstructured":"Vinod HD (1969) Integer programming and the theory of grouping. J AM STAT ASSOC 64(326):506\u2013519","journal-title":"J AM STAT ASSOC"},{"issue":"2","key":"10363_CR76","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.ejor.2022.03.056","volume":"304","author":"S Wagner","year":"2023","unstructured":"Wagner S, M\u00f6nch L (2023) A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices. Eur J Oper Res 304(2):461\u2013475. https:\/\/doi.org\/10.1016\/j.ejor.2022.03.056","journal-title":"Eur J Oper Res"},{"key":"10363_CR77","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.119654","volume":"219","author":"Y Wang","year":"2023","unstructured":"Wang Y, Zhou J, Sun Y, Fan J, Wang Z, Wang H (2023) Collaborative multidepot electric vehicle routing problem with time windows and shared charging stations. Expert Syst Appl 219:119654. https:\/\/doi.org\/10.1016\/j.eswa.2023.119654","journal-title":"Expert Syst Appl"},{"issue":"2","key":"10363_CR78","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00175354","volume":"4","author":"D Whitley","year":"1994","unstructured":"Whitley D (1994) A genetic algorithm tutorial. Stat Comput 4(2):65\u201385. https:\/\/doi.org\/10.1007\/BF00175354","journal-title":"Stat Comput"},{"key":"10363_CR79","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-540-92910-9_21","volume-title":"Handbook of natural computing","author":"D Whitley","year":"2012","unstructured":"Whitley D, Sutton AM (2012) Genetic algorithms\u2014a survey of models and methods. Handbook of natural computing, vol 2\u20134. Springer, Berlin Heidelberg, pp 637\u2013671"},{"issue":"2","key":"10363_CR80","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1016\/j.ejor.2022.08.047","volume":"307","author":"L Xie","year":"2023","unstructured":"Xie L, Li H, Luttmann L (2023) Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses. Eur J Oper Res 307(2):713\u2013730. https:\/\/doi.org\/10.1016\/j.ejor.2022.08.047","journal-title":"Eur J Oper Res"},{"key":"10363_CR81","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2021.2017054","volume":"142","author":"E Ya\u011fmur","year":"2020","unstructured":"Ya\u011fmur E, Kesen SE (2020) A memetic algorithm for joint production and distribution scheduling with due dates. Comput Ind Eng 142:106342. https:\/\/doi.org\/10.1080\/00207543.2021.2017054","journal-title":"Comput Ind Eng"},{"issue":"1","key":"10363_CR83","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/s11460-012-0192-0","volume":"7","author":"J Zhang","year":"2012","unstructured":"Zhang J, Chen W-N, Zhan Z-H, Yu W-J, Li Y-L, Chen N, Zhou Q (2012) A survey on algorithm adaptation in evolutionary computation. Front Electr Electron Eng 7(1):16\u201331. https:\/\/doi.org\/10.1007\/s11460-012-0192-0","journal-title":"Front Electr Electron Eng"},{"issue":"1","key":"10363_CR84","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.ejor.2023.01.020","volume":"309","author":"Y Zhou","year":"2023","unstructured":"Zhou Y, Zhang Y, Goh M (2023a) Platform responses to entry in a local market with mobile providers. Eur J Oper Res 309(1):236\u2013251. https:\/\/doi.org\/10.1016\/j.ejor.2023.01.020","journal-title":"Eur J Oper Res"},{"key":"10363_CR85","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2023.103151","volume":"175","author":"Y Zhou","year":"2023","unstructured":"Zhou Y, Zhang Y, Wahab MIM, Goh M (2023b) Channel leadership and performance for a closed-loop supply chain considering competition. Transp Res E Logist Transp Rev 175:103151. https:\/\/doi.org\/10.1016\/j.tre.2023.103151","journal-title":"Transp Res E Logist Transp Rev"},{"issue":"1","key":"10363_CR86","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.ejor.2021.05.033","volume":"298","author":"I \u017dulj","year":"2022","unstructured":"\u017dulj I, Salewski H, Goeke D, Schneider M (2022) Order batching and batch sequencing in an AMR-assisted picker-to-parts system. Eur J Oper Res 298(1):182\u2013201.  https:\/\/doi.org\/10.1016\/j.ejor.2021.05.033","journal-title":"Eur J Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-10363-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-024-10363-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-10363-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T07:36:36Z","timestamp":1733902596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-024-10363-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":93,"journal-issue":{"issue":"21-22","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["10363"],"URL":"https:\/\/doi.org\/10.1007\/s00500-024-10363-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11]]},"assertion":[{"value":"31 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The authors declare that the submitted manuscript is original and has not been submitted simultaneously in another journal.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}