{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:49:23Z","timestamp":1743058163013,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030876715"},{"type":"electronic","value":"9783030876722"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87672-2_8","type":"book-chapter","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:02:46Z","timestamp":1632258166000},"page":"115-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Layout-Agnostic Order-Batching Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6608-9621","authenticated-orcid":false,"given":"Johan","family":"Oxenstierna","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2121-1937","authenticated-orcid":false,"given":"Jacek","family":"Malec","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8836-8816","authenticated-orcid":false,"given":"Volker","family":"Krueger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,22]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1287\/ijoc.14.2.132.118","volume":"14","author":"D Applegate","year":"2002","unstructured":"Applegate, D., Cook, W., Dash, S., Rohe, A.: Solution of a min-max vehicle routing problem. INFORMS J. Comput. 14, 132\u2013143 (2002)","journal-title":"INFORMS J. Comput."},{"key":"8_CR2","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Azadnia, A., Taheri, S., Ghadimi, P., Samanm, M., Wong, K.: Order batching in warehouses by minimizing total tardiness: a hybrid approach of weighted association rule mining and genetic algorithms. Sci. World J. 2013 (2013). Article ID 246578 . https:\/\/doi.org\/10.1155\/2013\/246578","DOI":"10.1155\/2013\/246578"},{"key":"8_CR4","unstructured":"Bartholdi, J., Hackman, S.: Warehouse and distribution science Release 0.98 (2019)"},{"issue":"7","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1887","DOI":"10.1080\/00207540600920850","volume":"46","author":"YA Bozer","year":"2008","unstructured":"Bozer, Y.A., Kile, J.W.: Order batching in walk-and-pick order picking systems. Int. J. Prod. Res. 46(7), 1887\u20131909 (2008)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"8_CR6","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, A.L., Ogier, M.: An efficient and general approach for the joint order batching and picker routing problem. Eur. J. Oper. Res. 285(2), 497\u2013512 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Bu, M., Cattaruzza, D., Ogier, M., Semet, F.: A Two-Phase Approach for an Integrated Order Batching and Picker Routing Problem, pp. 3\u201318 (2019)","DOI":"10.1007\/978-3-030-25842-9_1"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Cergibozan, C., Tasan, A.: Genetic algorithm based approaches to solve the order batching problem and a case study in a distribution center. J. Intell. Manuf. 1\u201313 (2020). https:\/\/doi.org\/10.1007\/s10845-020-01653-3","DOI":"10.1007\/s10845-020-01653-3"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Charris, E., Rojas-Reyes, J., Montoya-Torres, J.: The storage location assignment problem: a literature review. Int. J. Ind. Eng. Comput. 10, 199\u2013224 (2018)","DOI":"10.5267\/j.ijiec.2018.8.001"},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.omega.2004.05.003","volume":"33","author":"MC Chen","year":"2005","unstructured":"Chen, M.C., Wu, H.P.: An association-based clustering approach to order batching considering customer demand patterns. Omega 33(4), 333\u2013343 (2005)","journal-title":"Omega"},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/S0377-2217(97)00416-5","volume":"112","author":"EP Chew","year":"1999","unstructured":"Chew, E.P., Tang, L.C.: Travel time analysis for general item location assignment in a rectangular warehouse. Eur. J. Oper. Res. 112(3), 582\u2013597 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR12","unstructured":"Cook, W.: Concorde TSP Solver (2020). http:\/\/www.math.uwaterloo.ca\/tsp\/concorde\/index.html"},{"key":"8_CR13","first-page":"195","volume":"14","author":"JF Cordeau","year":"2007","unstructured":"Cordeau, J.F., Laporte, G., Savelsbergh, M., Vigo, D.: Vehicle routing. Transp. Handb. Oper. Res. Manage. Sci. 14, 195\u2013224 (2007)","journal-title":"Transp. Handb. Oper. Res. Manage. Sci."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Fumi, A., Scarabotti, L., Schiraldi, M.: The effect of slot-code optimization in warehouse order picking. Int. J. Bus. Manage. 5, 5\u201320 (2013)","DOI":"10.5772\/56803"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Gademann, N., Velde, V.D.S.: Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Trans. 37(1), 63\u201375 (2005)","DOI":"10.1080\/07408170590516917"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1080\/07408170802112726","volume":"41","author":"KR Gue","year":"2009","unstructured":"Gue, K.R., Meller, R.D.: Aisle configurations for unit-load warehouses. IIE Trans. 41(3), 171\u2013182 (2009)","journal-title":"IIE Trans."},{"key":"8_CR17","first-page":"1","volume":"2","author":"M Hahsler","year":"2007","unstructured":"Hahsler, M., Kurt, H.: TSP - infrastructure for the traveling salesperson problem. J. Stat. Softw. 2, 1\u201321 (2007)","journal-title":"J. Stat. Softw."},{"issue":"11","key":"8_CR18","doi-asserted-by":"publisher","first-page":"2549","DOI":"10.1016\/j.cor.2011.12.019","volume":"39","author":"S Henn","year":"2012","unstructured":"Henn, S.: Algorithms for online order batching in an order picking warehouse. Comput. Oper. Res. 39(11), 2549\u20132563 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.ejor.2012.05.049","volume":"222","author":"S Henn","year":"2012","unstructured":"Henn, S., Wscher, G.: Tabu search heuristics for the order batching problem in manual order picking systems. Eur. J. Oper. Res. 222(3), 484\u2013494 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"8_CR20","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.cie.2007.12.018","volume":"55","author":"YC Ho","year":"2008","unstructured":"Ho, Y.C., Su, T.S., Shi, Z.B.: Order-batching methods for an order-picking warehouse with two cross aisles. Comput. Ind. Eng. 55(2), 321\u2013347 (2008)","journal-title":"Comput. Ind. Eng."},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/j.procs.2018.07.254","volume":"126","author":"X Jiang","year":"2018","unstructured":"Jiang, X., Zhou, Y., Zhang, Y., Sun, L., Hu, X.: Order batching and sequencing problem under the pick-and-sort strategy in online supermarkets. Procedia Comput. Sci. 126, 1985\u20131993 (2018)","journal-title":"Procedia Comput. Sci."},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Koster, M.B.M.D., Poort, E.S.V.d., Wolters, M.: Efficient orderbatching methods in warehouses. Int. J. Prod. Res. 37(7), 1479\u20131504 (1999)","DOI":"10.1080\/002075499191094"},{"issue":"2","key":"8_CR23","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.ejor.2006.07.009","volume":"182","author":"RD Koster","year":"2007","unstructured":"Koster, R.D., Le-Duc, T., Roodbergen, K.J.: Design and control of warehouse order picking: a literature review. Eur. J. Oper. Res. 182(2), 481\u2013501 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/s10696-011-9101-8","volume":"24","author":"O Kulak","year":"2012","unstructured":"Kulak, O., Sahin, Y., Taner, M.E.: Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms. Flex. Serv. Manuf. J. 24(1), 52\u201380 (2012)","journal-title":"Flex. Serv. Manuf. J."},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Le-Duc, T., Koster, R.M.B.M.D.: Travel time estimation and order batching in a 2-block warehouse. Eur. J. Ope. Res. 176(1), 374\u2013388 (2007)","DOI":"10.1016\/j.ejor.2005.03.052"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Li, J., Huang, R., Dai, J.B.: Joint optimisation of order batching and picker routing in the online retailers warehouse in China. Int. J. Prod. Res. 55(2), 447\u2013461 (2017)","DOI":"10.1080\/00207543.2016.1187313"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Ma\u0144dziuk, J., \u015awiechowski, M.: UCT in capacitated vehicle routing problem with traffic jams. Inf. Sci. 406\u2013407, 42\u201356 (2017)","DOI":"10.1016\/j.ins.2017.04.020"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Masae, M., Glock, C.H., Grosse, E.H.: Order picker routing in warehouses: a systematic literature review. Int. J. Prod. Econ. 224, 107564 (2020)","DOI":"10.1016\/j.ijpe.2019.107564"},{"key":"8_CR29","unstructured":"Nieuwenhuyse, I., De Koster, R., Colpaert, J.: Order batching in multi-server pick-and-sort warehouses. Katholieke Universiteit Leuven, Open Access publications from Katholieke Universiteit Leuven (2007)"},{"key":"8_CR30","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1016\/j.asoc.2017.04.070","volume":"58","author":"M Okulewicz","year":"2017","unstructured":"Okulewicz, M., Ma\u0144dziuk, J.: The impact of particular components of the PSO-based algorithm solving the dynamic vehicle routing problem. Appl. Soft Comput. 58, 586\u2013604 (2017)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"8_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac, V., Gendreau, M., Guret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1\u201311 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Psaraftis, H., Wen, M., Kontovas, C.: Dynamic vehicle routing problems: three decades and counting. Networks 67, 3\u201331 (2015)","DOI":"10.1002\/net.21628"},{"key":"8_CR33","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1287\/opre.31.3.507","volume":"31","author":"H Ratliff","year":"1983","unstructured":"Ratliff, H., Rosenthal, A.: Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper. Res. 31, 507\u2013521 (1983)","journal-title":"Oper. Res."},{"key":"8_CR34","unstructured":"Rensburg, L.J.V.: Artificial intelligence for warehouse picking optimization - an NP-hard problem. Master\u2019s thesis, Uppsala University (2019)"},{"issue":"9","key":"8_CR35","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1080\/00207540110028128","volume":"39","author":"KJ Roodbergen","year":"2001","unstructured":"Roodbergen, K.J., Koster, R.: Routing methods for warehouses with multiple cross aisles. Int. J. Prod. Res. 39(9), 1865\u20131883 (2001)","journal-title":"Int. J. Prod. Res."},{"key":"8_CR36","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1080\/00207549608904926","volume":"34","author":"MB Rosenwein","year":"1996","unstructured":"Rosenwein, M.B.: A comparison of heuristics for the problem of batching orders for warehouse selection. Int. J. Prod. Res. 34, 657\u2013664 (1996)","journal-title":"Int. J. Prod. Res."},{"key":"8_CR37","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0377-2217(92)90235-2","volume":"58","author":"G Sharp","year":"1992","unstructured":"Sharp, G., Gibson, D.: Order batching procedures. Eur. J. Oper. Res. 58, 57\u201367 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR38","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1016\/j.ejor.2020.01.022","volume":"284","author":"C Valle","year":"2019","unstructured":"Valle, C., Beasley, B.: Order batching using an approximation for the distance travelled by pickers. Eur. J. Oper. Res. 284, 460\u2013484 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"8_CR39","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.ejor.2017.03.069","volume":"262","author":"C Valle","year":"2017","unstructured":"Valle, C., Beasley, J.E., da Cunha, A.S.: Optimally solving the joint order batching and picker routing problem. Eur. J. Oper. Res. 262(3), 817\u2013834 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"8_CR40","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1016\/j.ejor.2008.09.011","volume":"198","author":"M Yu","year":"2009","unstructured":"Yu, M., Koster, R.BMd.: The impact of order batching and picking area zoning on order picking system performance. Eur. J. Oper. Res. 198(2), 480\u2013490 (2009)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87672-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:07:07Z","timestamp":1632258427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87672-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030876715","9783030876722"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87672-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2021.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"111","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}