{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:17:20Z","timestamp":1743031040535,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031629112"},{"type":"electronic","value":"9783031629129"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-62912-9_31","type":"book-chapter","created":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:01:37Z","timestamp":1718550097000},"page":"331-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploring the\u00a0Integration of\u00a0General Variable Neighborhood Search with\u00a0Exact Procedures for\u00a0the\u00a0Optimization of\u00a0the\u00a0Order Batching Problem"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Gil-Borr\u00e1s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo G.","family":"Pardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"issue":"5","key":"31_CR1","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1142\/S0217595909002390","volume":"26","author":"M Albareda-Sambola","year":"2009","unstructured":"Albareda-Sambola, M., Alonso-Ayuso, A., Molina, E., De Blas, C.S.: Variable neighborhood search for order batching in a warehouse. Asia-Pac. J. Oper. Res. 26(5), 655\u2013683 (2009)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"31_CR2","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-58568-5_11","volume-title":"New Trends in Distribution Logistics","author":"RBM De Koster","year":"1999","unstructured":"De Koster, R.B.M., Roodbergen, K.J., Van Voorden, R.: Reduction of walking time in the distribution center of De Bijenkorf. In: Speranza, M.G., St\u00e4hly, P. (eds.) New Trends in Distribution Logistics. LNE, vol. 480, pp. 215\u2013234. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-58568-5_11"},{"issue":"7","key":"31_CR3","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1080\/002075499191094","volume":"37","author":"RBM De Koster","year":"1999","unstructured":"De Koster, R.B.M., Van Der Poort, E.S., Wolters, M.: Efficient order batching methods in warehouses. Int. J. Prod. Res. 37(7), 1479\u20131504 (1999)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"31_CR4","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10898-014-0213-z","volume":"63","author":"A Duarte","year":"2015","unstructured":"Duarte, A., Pantrigo, J.J., Pardo, E.G., Mladenovi\u0107, N.: Multi-objective variable neighborhood search: an application to combinatorial optimization problems. J. Glob. Optim. 63(3), 515\u2013536 (2015)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"31_CR5","first-page":"55","volume":"27","author":"A Duarte","year":"2013","unstructured":"Duarte, A., Pantrigo, J.J., Pardo, E.G., S\u00e1nchez-Oro, J.: Parallel variable neighbourhood search strategies for the cutwidth minimization problem. IMA J. Manag. Math. 27(1), 55\u201373 (2013)","journal-title":"IMA J. Manag. Math."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Duarte, A., Mladenovic, N., S\u00e1nchez-Oro, J., Todosijevi\u0107, R.: Variable neighborhood descent (2018)","DOI":"10.1007\/978-3-319-07124-4_9"},{"issue":"5","key":"31_CR7","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1080\/00207548108956683","volume":"19","author":"EA Elsayed","year":"1981","unstructured":"Elsayed, E.A.: Algorithms for optimal material handling in automatic warehousing systems. Int. J. Prod. Res. 19(5), 525\u2013535 (1981)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0377-2217(92)90235-2","volume":"58","author":"DR Gibson","year":"1992","unstructured":"Gibson, D.R., Sharp, G.P.: Order batching procedures. Eur. J. Oper. Res. 58(1), 57\u201367 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-15843-9_8","volume-title":"Variable Neighborhood Search","author":"S Gil-Borr\u00e1s","year":"2019","unstructured":"Gil-Borr\u00e1s, S., Pardo, E.G., Alonso-Ayuso, A., Duarte, A.: New VNS variants for the online order batching problem. In: Sifaleras, A., Salhi, S., Brimberg, J. (eds.) ICVNS 2018. LNCS, vol. 11328, pp. 89\u2013100. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-15843-9_8"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-030-44932-2_2","volume-title":"Variable Neighborhood Search","author":"S Gil-Borr\u00e1s","year":"2020","unstructured":"Gil-Borr\u00e1s, S., Pardo, E.G., Alonso-Ayuso, A., Duarte, A.: Basic VNS for a variant of the online order batching problem. In: Benmansour, R., Sifaleras, A., Mladenovi\u0107, N. (eds.) ICVNS 2019. LNCS, vol. 12010, pp. 17\u201336. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44932-2_2"},{"issue":"2","key":"31_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10898-020-00910-2","volume":"78","author":"S Gil-Borr\u00e1s","year":"2020","unstructured":"Gil-Borr\u00e1s, S., Pardo, E.G., Alonso-Ayuso, A., Duarte, A.: GRASP with variable neighborhood descent for the online order batching problem. J. Glob. Optim. 78(2), 295\u2013325 (2020)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"31_CR12","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1080\/07408179308964306","volume":"25","author":"RW Hall","year":"1993","unstructured":"Hall, R.W.: Distance approximations for routing manual pickers in a warehouse. IIE Trans. 25(4), 76\u201387 (1993)","journal-title":"IIE Trans."},{"issue":"3","key":"31_CR13","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR14","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-91086-4_3","volume-title":"Handbook of Metaheuristics","author":"P Hansen","year":"2019","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., P\u00e9rez, J.A.M.: Variable neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 57\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_3"},{"issue":"1","key":"31_CR15","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno-P\u00e9rez, J.A.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"issue":"11","key":"31_CR16","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)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"31_CR17","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BF03342717","volume":"3","author":"S Henn","year":"2010","unstructured":"Henn, S., Koch, S., Doerner, K.F., Strauss, C., W\u00e4scher, G.: Metaheuristics for the order batching problem in manual order picking systems. Bus. Res. 3(1), 82\u2013105 (2010)","journal-title":"Bus. Res."},{"issue":"3","key":"31_CR18","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)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"31_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.compind.2004.06.001","volume":"56","author":"CM Hsu","year":"2005","unstructured":"Hsu, C.M., Chen, K.Y., Chen, M.C.: Batching orders in warehouses by minimizing travel distance with genetic algorithms. Comput. Ind. 56(2), 169\u2013178 (2005)","journal-title":"Comput. Ind."},{"issue":"1","key":"31_CR20","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, E.G., Duarte, A.: General variable neighborhood search for the order batching and sequencing problem. Eur. J. Oper. Res. 263(1), 82\u201393 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR21","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.cor.2016.01.020","volume":"78","author":"B Men\u00e9ndez","year":"2017","unstructured":"Men\u00e9ndez, B., Pardo, E.G., Alonso-Ayuso, A., Molina, E., Duarte, A.: Variable neighborhood search strategies for the order batching problem. Comput. Oper. Res. 78, 500\u2013512 (2017)","journal-title":"Comput. Oper. Res."},{"key":"31_CR22","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.endm.2014.11.011","volume":"47","author":"B Men\u00e9ndez","year":"2015","unstructured":"Men\u00e9ndez, B., Pardo, E.G., Duarte, A., Alonso-Ayuso, A., Molina, E.: General variable neighborhood search applied to the picking process in a warehouse. Electron. Notes Discrete Math. 47, 77\u201384 (2015)","journal-title":"Electron. Notes Discrete Math."},{"issue":"3","key":"31_CR23","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1111\/itor.12309","volume":"24","author":"B Men\u00e9ndez","year":"2017","unstructured":"Men\u00e9ndez, B., Pardo, E.G., S\u00e1nchez-Oro, J., Duarte, A.: Parallel variable neighborhood search for the min-max order batching problem. Int. Trans. Oper. Res. 24(3), 635\u2013662 (2017)","journal-title":"Int. Trans. Oper. Res."},{"issue":"11","key":"31_CR24","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"31_CR25","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1080\/0740817X.2014.991478","volume":"47","author":"I Muter","year":"2015","unstructured":"Muter, I., \u00d6ncan, T.: An exact solution approach for the order batching problem. IIE Trans. 47(7), 728\u2013738 (2015)","journal-title":"IIE Trans."},{"issue":"3","key":"31_CR26","doi-asserted-by":"publisher","first-page":"958","DOI":"10.1016\/j.ejor.2017.12.037","volume":"267","author":"L Nicolas","year":"2018","unstructured":"Nicolas, L., Yannick, F., Ramzi, H.: Order batching in an automated warehouse with several vertical lift modules: optimization and experiments with real data. Eur. J. Oper. Res. 267(3), 958\u2013976 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"31_CR27","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.: MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem. Eur. J. Oper. Res. 243(1), 142\u2013155 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"31_CR28","doi-asserted-by":"publisher","first-page":"2242","DOI":"10.1016\/j.asoc.2013.01.016","volume":"13","author":"EG Pardo","year":"2013","unstructured":"Pardo, E.G., Mladenovi\u0107, N., Pantrigo, J.J., Duarte, A.: Variable formulation search for the cutwidth minimization problem. Appl. Soft Comput. 13(5), 2242\u20132252 (2013)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"31_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2023.02.019","volume":"313","author":"EG Pardo","year":"2023","unstructured":"Pardo, E.G., Gil-Borr\u00e1s, S., Alonso-Ayuso, A., Duarte, A.: Order batching problems: taxonomy and literature review. Eur. J. Oper. Res. 313(1), 1\u201324 (2023). https:\/\/doi.org\/10.1016\/j.ejor.2023.02.019","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"31_CR30","first-page":"1614","volume":"31","author":"CG Petersen","year":"1995","unstructured":"Petersen, C.G.: Routeing and storage policy interaction in order picking operations. Decis. Sci. Inst. Proc. 31(3), 1614\u20131616 (1995)","journal-title":"Decis. Sci. Inst. Proc."},{"issue":"11","key":"31_CR31","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1108\/01443579710177860","volume":"17","author":"CG Petersen","year":"1997","unstructured":"Petersen, C.G.: An evaluation of order picking routeing policies. Int. J. Oper. Prod. Manag. 17(11), 1098\u20131111 (1997)","journal-title":"Int. J. Oper. Prod. Manag."},{"issue":"3","key":"31_CR32","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1287\/opre.31.3.507","volume":"31","author":"HD Ratliff","year":"1983","unstructured":"Ratliff, H.D., Rosenthal, A.S.: Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper. Res. 31(3), 507\u2013521 (1983)","journal-title":"Oper. Res."},{"key":"31_CR33","unstructured":"Roodbergen, K.J., Petersen, C.G.: How to improve order picking efficiency with routing and storage policies. In: Progress in Material Handling Practice, vol. 1, pp. 107\u2013124 (1999)"},{"issue":"3","key":"31_CR34","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(3), 657\u2013664 (1996)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"31_CR35","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)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"31_CR36","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0249543","volume":"16","author":"J Yang","year":"2021","unstructured":"Yang, J., Zhou, L., Liu, H.: Hybrid genetic algorithm-based optimisation of the batch order picking in a dense mobile rack warehouse. PLoS ONE 16(4), e0249543 (2021)","journal-title":"PLoS ONE"},{"issue":"2","key":"31_CR37","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2017.06.056","volume":"264","author":"I \u017dulj","year":"2018","unstructured":"\u017dulj, I., Kramer, S., Schneider, M.: A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem. Eur. J. Oper. Res. 264(2), 653\u2013664 (2018)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62912-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:12:07Z","timestamp":1718550727000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62912-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031629112","9783031629129"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62912-9_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lorient","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mic2024.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}