{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T22:19:02Z","timestamp":1778537942478,"version":"3.51.4"},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T00:00:00Z","timestamp":1762214400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["555303283"],"award-info":[{"award-number":["555303283"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["IR 122\/13-1"],"award-info":[{"award-number":["IR 122\/13-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ejor.2025.11.002","type":"journal-article","created":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T23:40:28Z","timestamp":1762645228000},"page":"132-143","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["A linear-size model for the single picker routing problem with scattered storage"],"prefix":"10.1016","volume":"332","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3532-510X","authenticated-orcid":false,"given":"Laura","family":"L\u00fcke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-3221-7904","authenticated-orcid":false,"given":"Andr\u00e9","family":"Hessenius","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9383-4546","authenticated-orcid":false,"given":"Stefan","family":"Irnich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2025.11.002_bib0001","unstructured":"Applegate, D. L., Bixby, R. E., Chvatal, V., & Cook, W. J. (2003). Concorde-03.12.19. Website. https:\/\/www.math.uwaterloo.ca\/tsp\/concorde\/index.html."},{"key":"10.1016\/j.ejor.2025.11.002_sbref0001","series-title":"Warehouse & distribution science","author":"BartholdiIII","year":"2019"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.002_bib0003","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/j.ejor.2018.08.023","article-title":"Warehousing in the e-commerce era: A survey","volume":"277","author":"Boysen","year":"2019","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.002_bib0004","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1080\/0740817X.2013.768871","article-title":"Order picking under random and turnover-based storage policies in fishbone aisle warehouses","volume":"46","author":"\u00c7elk","year":"2014","journal-title":"IIE Transactions"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.002_bib0005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(97)00043-X","article-title":"A model for warehouse order picking","volume":"105","author":"Daniels","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.11.002_bib0006","series-title":"The traveling salesman problem and its variations","first-page":"609","article-title":"The generalized traveling salesman and orienteering problems","volume":"vol. 12","author":"Fischetti","year":"2002"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.002_bib0007","first-page":"436","article-title":"Modeling single-picker routing problems in classical and modern warehouses","volume":"33","author":"Goeke","year":"2021","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.002_bib0008","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1080\/07408179308964306","article-title":"Distance approximations for routing manual pickers in a warehouse","volume":"25","author":"Hall","year":"1993","journal-title":"IIE Transactions"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.002_bib0009","doi-asserted-by":"crossref","first-page":"1304","DOI":"10.1080\/00207543.2024.2374845","article-title":"The picker routing problem in mixed-shelves, multi-block warehouses","volume":"63","author":"Haouassi","year":"2025","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.002_bib0010","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","article-title":"An effective implementation of the Lin-Kernighan traveling salesman heuristic","volume":"126","author":"Helsgaun","year":"2000","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.002_bib0011","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.orl.2022.01.014","article-title":"A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing","volume":"50","author":"He\u00dfler","year":"2022","journal-title":"Operations Research Letters"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.002_bib0012","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1287\/ijoc.2023.0075","article-title":"Exact solution of the single picker routing problem with scattered storage","volume":"36","author":"He\u00dfler","year":"2024","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2025.11.002_bib0013","series-title":"Column generation","first-page":"33","article-title":"Shortest path problems with resource constraints","author":"Irnich","year":"2005"},{"key":"10.1016\/j.ejor.2025.11.002_bib0014","unstructured":"Khan, I., Maurer, O., P\u00e4tzold, J., Pszona, P., & Salchow, J.-D. (2024). Joint order selection, allocation, batching and picking for large scale warehouses. https:\/\/arxiv.org\/abs\/2401.04563."},{"key":"10.1016\/j.ejor.2025.11.002_bib0015","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1007\/s00291-024-00760-4","article-title":"The single picker routing problem with scattered storage: Modeling and evaluation of routing and storage policies","volume":"46","author":"L\u00fcke","year":"2024","journal-title":"OR Spectrum"},{"key":"10.1016\/j.ejor.2025.11.002_bib0016","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijpe.2019.107564","article-title":"Order picker routing in warehouses: A systematic literature review","volume":"224","author":"Masae","year":"2020","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.ejor.2025.11.002_bib0017","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulations and traveling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"Journal of Association for Computing Machinery"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.002_bib0018","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1080\/0740817X.2011.636793","article-title":"Optimal unit-load warehouse designs for single-command operations","volume":"44","author":"\u00d6zt\u00fcrko\u011flu","year":"2012","journal-title":"IIE Transactions"},{"key":"10.1016\/j.ejor.2025.11.002_bib0019","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.cor.2018.07.002","article-title":"Exact algorithms for the order picking problem","volume":"100","author":"Pansart","year":"2018","journal-title":"Computers & Operations Research"},{"issue":"11","key":"10.1016\/j.ejor.2025.11.002_bib0020","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1108\/01443579710177860","article-title":"An evaluation of order picking routeing policies","volume":"17","author":"Petersen","year":"1997","journal-title":"International Journal of Operations & Production Management"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.002_bib0021","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/trsc.1120.0418","article-title":"A reference point approach for the resource constrained shortest path problems","volume":"47","author":"Pugliese","year":"2013","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.002_bib0022","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1287\/opre.31.3.507","article-title":"Order-picking in a rectangular warehouse: A solvable case of the traveling salesman problem","volume":"31","author":"Ratliff","year":"1983","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.11.002_bib0023","doi-asserted-by":"crossref","DOI":"10.1016\/j.orl.2025.107325","article-title":"A note about a transition of Ratliff and Rosenthal\u2019s order picking algorithm for rectangular warehouses","volume":"62","author":"Revenant","year":"2025","journal-title":"Operations Research Letters"},{"issue":"9","key":"10.1016\/j.ejor.2025.11.002_bib0024","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.ejor.2025.11.002_bib0025","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":"3","key":"10.1016\/j.ejor.2025.11.002_bib0026","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0377-2217(96)00313-X","article-title":"A branch and bound algorithm for the traveling purchaser problem","volume":"97","author":"Singh","year":"1997","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.002_bib0027","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.ejor.2022.05.045","article-title":"An extensible multi-block layout warehouse routing optimization model","volume":"305","author":"Su","year":"2023","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.11.002_bib0028","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.cor.2018.03.012","article-title":"Picker routing in rectangular mixed shelves warehouses","volume":"95","author":"Weidinger","year":"2018","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.002_bib0029","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/j.ejor.2018.10.021","article-title":"Picker routing in the mixed-shelves warehouses of e-commerce retailers","volume":"274","author":"Weidinger","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.11.002_bib0030","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s00291-024-00780-0","article-title":"Picker routing in scattered storage warehouses: an evaluation of solution methods based on TSP transformations","volume":"47","author":"Wildt","year":"2025","journal-title":"OR Spectrum"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725008963?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725008963?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T22:04:45Z","timestamp":1778537085000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725008963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["S0377221725008963"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.11.002","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A linear-size model for the single picker routing problem with scattered storage","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.11.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}