{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:13:25Z","timestamp":1743038005192,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030856717"},{"type":"electronic","value":"9783030856724"}],"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-85672-4_16","type":"book-chapter","created":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T21:02:30Z","timestamp":1629147750000},"page":"216-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Formulation of a Layout-Agnostic Order Batching Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6608-9621","authenticated-orcid":false,"given":"Johan","family":"Oxenstierna","sequence":"first","affiliation":[]},{"given":"Louis Janse","family":"van Rensburg","sequence":"additional","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,8,17]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.ejor.2006.07.009","volume":"182","author":"R de Koster","year":"2007","unstructured":"de Koster, R., 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). https:\/\/doi.org\/10.1016\/j.ejor.2006.07.009","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR2","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. Proc. Comput. Sci. 126, 1985\u20131993 (2018). https:\/\/doi.org\/10.1016\/j.procs.2018.07.254","journal-title":"Proc. Comput. Sci."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0377-2217(92)90235-2","volume":"58","author":"GP Sharp","year":"1992","unstructured":"Sharp, G.P., Gibson, D.R.: Order batching procedures. Eur. J. Oper. Res. 58, 57\u201367 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"16_CR4","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.: Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Trans. 37(1), 63\u201375 (2005). https:\/\/doi.org\/10.1080\/07408170590516917","journal-title":"IIE Trans."},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1016\/j.ejor.2020.01.022","volume":"284","author":"CA Valle","year":"2019","unstructured":"Valle, C.A., Beasley, B.A.: Order batching using an approximation for the distance travelled by pickers. Eur. J. Oper. Res. 284(2), 460\u2013484 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR6","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":"16_CR7","unstructured":"Cordeau, J.-F., Laporte, G., Savelsbergh, M., Vigo, D.: Vehicle routing. In: Transportation, Handbooks in Operations Research and Management Science, vol. 14, pp. 195\u2013224 (2007)"},{"issue":"7","key":"16_CR8","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). https:\/\/doi.org\/10.1080\/00207540600920850","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"16_CR9","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). https:\/\/doi.org\/10.1016\/j.ejor.2020.01.059","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"16_CR10","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). https:\/\/doi.org\/10.1007\/s10696-011-9101-8","journal-title":"Flex. Serv. Manuf. J."},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"107564","DOI":"10.1016\/j.ijpe.2019.107564","volume":"224","author":"M Masae","year":"2020","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). https:\/\/doi.org\/10.1016\/j.ijpe.2019.107564","journal-title":"Int. J. Prod. Econ."},{"issue":"19","key":"16_CR12","doi-asserted-by":"publisher","first-page":"4211","DOI":"10.1080\/00207540410001711863","volume":"42","author":"P-Y Chang","year":"2004","unstructured":"Chang, P.-Y., Damodaran, P., Melouk, S.: Minimizing makespan on parallel batch processing machines. Int. J. Prod. Res. 42(19), 4211\u20134220 (2004). https:\/\/doi.org\/10.1080\/00207540410001711863","journal-title":"Int. J. Prod. Res."},{"key":"16_CR13","unstructured":"van Rensburg, L.J.: Artificial intelligence for warehouse picking optimization - an NP-hard problem. M.Sc., Uppsala University (2019)"},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.ejor.2017.03.069","volume":"262","author":"CA Valle","year":"2017","unstructured":"Valle, C.A., 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). https:\/\/doi.org\/10.1016\/j.ejor.2017.03.069","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1080\/00207543.2016.1187313","volume":"55","author":"J Li","year":"2017","unstructured":"Li, J., Huang, R., Dai, J.B.: Joint optimisation of order batching and picker routing in the online retailer\u2019s warehouse in China. Int. J. Prod. Res. 55(2), 447\u2013461 (2017). https:\/\/doi.org\/10.1080\/00207543.2016.1187313","journal-title":"Int. J. Prod. Res."},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/net.21628","volume":"67","author":"H Psaraftis","year":"2015","unstructured":"Psaraftis, H., Wen, M., Kontovas, C.: Dynamic vehicle routing problems: three decades and counting. Networks 67, 3\u201331 (2015). https:\/\/doi.org\/10.1002\/net.21628","journal-title":"Networks"},{"key":"16_CR17","series-title":"ASS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-25842-9_1","volume-title":"A View of Operations Research Applications in Italy","author":"M Bu\u00e9","year":"2019","unstructured":"Bu\u00e9, M., Cattaruzza, D., Ogier, M., Semet, F.: A two-phase approach for an integrated order batching and picker routing problem. In: Dell\u2019Amico, M., Gaudioso, M., Stecca, G. (eds.) A View of Operations Research Applications in Italy. ASS, vol. 2, pp. 3\u201318. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25842-9_1"},{"issue":"9","key":"16_CR18","doi-asserted-by":"publisher","first-page":"2521","DOI":"10.1007\/s00170-018-2833-9","volume":"100","author":"M Bortolini","year":"2019","unstructured":"Bortolini, M., Faccio, M., Ferrari, E., Gamberi, M., Pilati, F.: Design of diagonal cross-aisle warehouses with class-based storage assignment strategy. Int. J. Adv. Manuf. Technol. 100(9), 2521\u20132536 (2019). https:\/\/doi.org\/10.1007\/s00170-018-2833-9","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.5772\/56803","volume":"5","author":"A Fumi","year":"2013","unstructured":"Fumi, A., Scarabotti, L., Schiraldi, M.: The effect of slot-code optimization in warehouse order picking. Int. J. Bus. Manag. 5, 5\u201320 (2013). https:\/\/doi.org\/10.5772\/56803","journal-title":"Int. J. Bus. Manag."},{"issue":"3","key":"16_CR20","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). https:\/\/doi.org\/10.1080\/07408170802112726","journal-title":"IIE Trans."},{"issue":"11","key":"16_CR21","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 on-line order batching in an order picking warehouse. Comput. Oper. Res. 39(11), 2549\u20132563 (2012). https:\/\/doi.org\/10.1016\/j.cor.2011.12.019","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"16_CR22","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.omega.2004.05.003","volume":"33","author":"M-C 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). https:\/\/doi.org\/10.1016\/j.omega.2004.05.003","journal-title":"Omega"},{"issue":"3","key":"16_CR23","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., W\u00e4scher, G.: Tabu search heuristics for the order batching problem in manual order picking systems. Eur. J. Oper. Res. 222(3), 484\u2013494 (2012). https:\/\/doi.org\/10.1016\/j.ejor.2012.05.049","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR24","doi-asserted-by":"publisher","unstructured":"Cergibozan, \u00c7., 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":"16_CR25","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., Nieuwenhuyse, I.V.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016). https:\/\/doi.org\/10.1016\/j.cie.2015.12.007","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"16_CR26","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., Gu\u00e9ret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1\u201311 (2013). https:\/\/doi.org\/10.1016\/j.ejor.2012.08.015","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR27","doi-asserted-by":"publisher","unstructured":"Mansouri, M., Lagriffoul, F., Pecora, F.: Multi vehicle routing with nonholonomic constraints and dense dynamic obstacles (2017). https:\/\/doi.org\/10.1109\/IROS.2017.8206195","DOI":"10.1109\/IROS.2017.8206195"},{"issue":"4","key":"16_CR28","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.biosystemseng.2009.09.003","volume":"104","author":"DD Bochtis","year":"2009","unstructured":"Bochtis, D.D., S\u00f8rensen, C.G.: The vehicle routing problem in field logistics part I. Biosyst. Eng. 104(4), 447\u2013457 (2009). https:\/\/doi.org\/10.1016\/j.biosystemseng.2009.09.003","journal-title":"Biosyst. Eng."},{"issue":"1","key":"16_CR29","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ejor.2017.11.017","volume":"267","author":"RD Santis","year":"2018","unstructured":"Santis, R.D., Montanari, R., Vignali, G., Bottani, E.: An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses. Eur. J. Oper. Res. 267(1), 120\u2013137 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.11.017","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"16_CR30","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.ejor.2017.03.061","volume":"262","author":"F Furini","year":"2017","unstructured":"Furini, F., Ljubi\u0107, I., Sinnl, M.: An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. Eur. J. Oper. Res. 262(2), 438\u2013448 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2017.03.061","journal-title":"Eur. J. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Optimization and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85672-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T21:06:29Z","timestamp":1629147989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85672-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030856717","9783030856724"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85672-4_16","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Catania","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ola2021a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ola2021.sciencesconf.org\/","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":"sciencesconf.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"27","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":"44% - 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":"3","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held in a virtual mode.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}