{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:51:03Z","timestamp":1777956663068,"version":"3.51.4"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.cie.2026.111951","type":"journal-article","created":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T00:42:38Z","timestamp":1772671358000},"page":"111951","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Joint order batching and picker routing problem with sturdiness levels"],"prefix":"10.1016","volume":"216","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9934-676X","authenticated-orcid":false,"given":"Wael","family":"Zayat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3356-0162","authenticated-orcid":false,"given":"Huseyin Selcuk","family":"Kilic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4815-4389","authenticated-orcid":false,"given":"Serol","family":"Bulkan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.cie.2026.111951_b0005","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/j.ejor.2020.01.059","article-title":"An efficient and general approach for the joint order batching and picker routing problem","volume":"285","author":"Briant","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.111951_b0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106221","article-title":"Variable Neighborhood Search: The power of change and simplicity","volume":"155","author":"Brimberg","year":"2023","journal-title":"Computers & Operations Research"},{"issue":"7","key":"10.1016\/j.cie.2026.111951_b0015","doi-asserted-by":"crossref","first-page":"711","DOI":"10.3390\/axioms12070711","article-title":"Solving Location Assignment and Order Picker-Routing Problems in Warehouse Management","volume":"12","author":"Bola\u00f1os-Zu\u00f1iga","year":"2023","journal-title":"Axioms"},{"issue":"2","key":"10.1016\/j.cie.2026.111951_b0020","first-page":"402","article-title":"The order batching problem: A state-of-the-art review","volume":"40","author":"Boz","year":"2022","journal-title":"Sigma Journal of Engineering and Natural Sciences"},{"issue":"21","key":"10.1016\/j.cie.2026.111951_b0025","doi-asserted-by":"crossref","first-page":"6361","DOI":"10.1080\/00207543.2016.1251625","article-title":"Order picking problems under weight, fragility and category constraints","volume":"55","author":"Chabot","year":"2017","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.cie.2026.111951_b0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.114215","article-title":"A reduced vns based approach for the dynamic continuous berth allocation problem in bulk terminals with tidal constraints","volume":"168","author":"Cheimanoff","year":"2021","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.cie.2026.111951_b0035","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1016\/j.ijpe.2015.03.021","article-title":"Using a hybrid approach based on the particle swarm optimization and ant colony optimization to solve a joint order batching and picker routing problem","volume":"170","author":"Cheng","year":"2015","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.cie.2026.111951_b0040","doi-asserted-by":"crossref","unstructured":"Chou, X., Pietri, N. O., Loske, D., Klumpp, M., & Montemanni, R. (2021). Optimization strategies for in-store order picking in omnichannel retailing. In Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems: IFIP WG 5.7 International Conference, APMS 2021, Nantes, France, September 5\u20139, 2021, Proceedings, Part II (pp. 603-611). Springer International Publishing.","DOI":"10.1007\/978-3-030-85902-2_64"},{"issue":"4","key":"10.1016\/j.cie.2026.111951_b0045","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Operations research"},{"issue":"7","key":"10.1016\/j.cie.2026.111951_b0050","doi-asserted-by":"crossref","DOI":"10.1080\/00207548908942610","article-title":"Order batching algorithms and travel-time estimation for automated storage\/retrieval systems","volume":"27","author":"Elsayed","year":"1989","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.cie.2026.111951_b0055","unstructured":"Falkenauer, E. (1998). Genetic algorithms and grouping problems. John Wiley & Sons, Inc."},{"issue":"2","key":"10.1016\/j.cie.2026.111951_b0060","first-page":"65","article-title":"A simulated annealing approach for the joint order batching and order picker routing problem with weight restrictions","volume":"20","author":"Grosse","year":"2014","journal-title":"International Journal of Operations and Quantitative Management"},{"key":"10.1016\/j.cie.2026.111951_b0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2020.102087","article-title":"Robot scheduling for pod retrieval in a robotic mobile fulfillment system","volume":"142","author":"Gharehgozli","year":"2020","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.cie.2026.111951_b0070","series-title":"Variable neighborhood search","first-page":"57","author":"Hansen","year":"2019"},{"key":"10.1016\/j.cie.2026.111951_b0075","series-title":"May). A Reduced Variable Neighbourhood Search Algorithm for Grid Bandwidth Minimization Problem","first-page":"795","author":"Khandelwal","year":"2023"},{"issue":"2","key":"10.1016\/j.cie.2026.111951_b0080","doi-asserted-by":"crossref","first-page":"152","DOI":"10.15807\/jorsj.34.152","article-title":"The precedence constrained traveling salesman problem","volume":"34","author":"Kubo","year":"1991","journal-title":"Journal of the Operations Research Society of Japan"},{"issue":"3","key":"10.1016\/j.cie.2026.111951_b0095","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1016\/j.ejor.2013.06.001","article-title":"A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse","volume":"236","author":"Matusiak","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.cie.2026.111951_b0100","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulation of traveling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"Journal of the ACM (JACM)"},{"issue":"11","key":"10.1016\/j.cie.2026.111951_b0105","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Computers & operations research"},{"key":"10.1016\/j.cie.2026.111951_b0110","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.omega.2015.05.004","article-title":"Order batching in a pick-and-pass warehousing system with group genetic algorithm","volume":"57","author":"Pan","year":"2015","journal-title":"Omega"},{"issue":"1","key":"10.1016\/j.cie.2026.111951_b0115","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2023.02.019","article-title":"Order batching problems: Taxonomy and literature review","volume":"313","author":"Pardo","year":"2024","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.111951_b0120","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s11740-019-00904-4","article-title":"An approach for the solution to order batching and sequencing in picking systems","volume":"13","author":"Pinto","year":"2019","journal-title":"Production Engineering"},{"key":"10.1016\/j.cie.2026.111951_bib191","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jmsy.2022.08.006","article-title":"A comprehensive review of batching problems in low-level picker-to-parts systems with order due dates: Main gaps, trade-offs, and prospects for future research","volume":"65","author":"Pinto","year":"2022","journal-title":"Journal of Manufacturing Systems"},{"key":"10.1016\/j.cie.2026.111951_b0125","doi-asserted-by":"crossref","DOI":"10.1016\/j.matdes.2023.111958","article-title":"Evaluation of combinatorial algorithms for optimizing highly nonlinear structural problems","volume":"230","author":"Rettl","year":"2023","journal-title":"Materials & Design"},{"issue":"9","key":"10.1016\/j.cie.2026.111951_b0130","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1080\/00207540110028128","article-title":"Routing methods for warehouses with multiple cross aisles","volume":"39","author":"Roodbergen","year":"2001","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.cie.2026.111951_b0135","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S0377-2217(00)00177-6","article-title":"Routing order pickers in a warehouse with a middle aisle","volume":"133","author":"Roodbergen","year":"2001","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.cie.2026.111951_b0140","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10100-017-0467-x","article-title":"Order Batching and Picker Routing in manual order picking systems: The benefits of integrated routing","volume":"25","author":"Scholz","year":"2017","journal-title":"Central European journal of operations research"},{"key":"10.1016\/j.cie.2026.111951_b0150","article-title":"A Three-Stage model for Clustering, Storage, and joint online order batching and picker routing Problems: Heuristic algorithms","volume":"179","author":"Tabrizi","year":"2023","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.cie.2026.111951_b0155","doi-asserted-by":"crossref","first-page":"34","DOI":"10.24840\/2183-6493_007.003_0004","article-title":"Improving order-picking operations with precedence constraints through efficient storage location assignment: Evidence from a retail company","volume":"7","author":"Trindade","year":"2021","journal-title":"U. Porto Journal of Engineering"},{"issue":"2","key":"10.1016\/j.cie.2026.111951_b0145","doi-asserted-by":"crossref","first-page":"147","DOI":"10.37190\/ord210207","article-title":"Defining a storage-assignment strategy for precedence-constrained order picking","volume":"31","author":"Trindade","year":"2021","journal-title":"Operations Research and Decisions"},{"issue":"3","key":"10.1016\/j.cie.2026.111951_b0160","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/j.ejor.2017.03.069","article-title":"Optimally solving the joint order batching and picker routing problem","volume":"262","author":"Valle","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.111951_b0165","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.ijpe.2017.11.021","article-title":"Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions","volume":"197","author":"Van Gils","year":"2018","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.cie.2026.111951_b0170","article-title":"A reduced variable neighborhood search-based hyperheuristic for the shelf space allocation problem","volume":"143","author":"Vincent","year":"2020","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"10.1016\/j.cie.2026.111951_b0175","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.ejor.2022.03.056","article-title":"A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices","volume":"304","author":"Wagner","year":"2023","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.111951_b0180","article-title":"Variable neighborhood search-based algorithms for the parallel machine capacitated lot-sizing and scheduling probleM","volume":"100145","author":"Yildiz","year":"2023","journal-title":"Journal of Engineering Research"},{"issue":"5","key":"10.1016\/j.cie.2026.111951_b0185","doi-asserted-by":"crossref","first-page":"2440","DOI":"10.1111\/itor.12926","article-title":"The study of joint order batching and picker routing problem with food and nonfood category constraint in online\u2010to\u2010offline grocery store","volume":"28","author":"Zhang","year":"2021","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"10.1016\/j.cie.2026.111951_b0190","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.ejor.2017.06.056","article-title":"A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem","volume":"264","author":"\u017dulj","year":"2018","journal-title":"European Journal of Operational Research"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S036083522600152X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S036083522600152X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T03:26:57Z","timestamp":1777951617000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S036083522600152X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":37,"alternative-id":["S036083522600152X"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2026.111951","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Joint order batching and picker routing problem with sturdiness levels","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cie.2026.111951","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"111951"}}