{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:28:23Z","timestamp":1742934503001,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496615"},{"type":"electronic","value":"9783031496622"}],"license":[{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"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-49662-2_12","type":"book-chapter","created":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T13:03:00Z","timestamp":1702558980000},"page":"220-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimization of\u00a0the\u00a0Storage Location Assignment Problem Using Nested Annealing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6608-9621","authenticated-orcid":false,"given":"Johan","family":"Oxenstierna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis Janse","family":"van Rensburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2186-0459","authenticated-orcid":false,"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8836-8816","authenticated-orcid":false,"given":"Volker","family":"Krueger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,15]]},"reference":[{"key":"12_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":"12_CR2","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1287\/trsc.2018.0873","volume":"53","author":"K Azadeh","year":"2019","unstructured":"Azadeh, K., De Koster, R., Roy, D.: Robotized and automated warehouse systems: review and recent developments. Transp. Sci. 53, 917\u2013945 (2019)","journal-title":"Transp. Sci."},{"issue":"18","key":"12_CR3","doi-asserted-by":"publisher","first-page":"2862","DOI":"10.1016\/j.dam.2013.07.002","volume":"161","author":"N Boysen","year":"2013","unstructured":"Boysen, N., Stephan, K.: The deterministic product location problem under a pick-by-order policy. Discret. Appl. Math. 161(18), 2862\u20132875 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"12_CR4","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1080\/13675567.2012.743981","volume":"15","author":"LF Cardona","year":"2012","unstructured":"Cardona, L.F., Rivera, L., Mart\u00ednez, H.J.: Analytical study of the fishbone warehouse layout. Int. J. Log. Res. Appl. 15(6), 365\u2013388 (2012)","journal-title":"Int. J. Log. Res. Appl."},{"key":"12_CR5","first-page":"199","volume":"10","author":"E Charris","year":"2018","unstructured":"Charris, E., et al.: The storage location assignment problem: a literature review. Int. J. Ind. Eng. Comput. 10, 199\u2013224 (2018)","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Christen, J.A., Fox, C.: Markov Chain Monte Carlo using an approximation. J. Comput. Graph. Stat. 14(4), 795\u2013810 (2005). https:\/\/www.jstor.org\/stable\/27594150","DOI":"10.1198\/106186005X76983"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00170-011-3593-y","volume":"60","author":"S Ene","year":"2011","unstructured":"Ene, S., \u00d6zt\u00fcrk, N.: Storage location assignment and order picking optimization in the automotive industry. Int. J. Adv. Manuf. Technol. 60, 1\u201311 (2011). https:\/\/doi.org\/10.1007\/s00170-011-3593-y","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"9","key":"12_CR8","doi-asserted-by":"publisher","first-page":"3205","DOI":"10.1007\/s00170-016-9040-3","volume":"88","author":"ME Fontana","year":"2017","unstructured":"Fontana, M.E., Nepomuceno, V.S.: Multi-criteria approach for products classification and their storage location assignment. Int. J. Adv. Manuf. Technol. 88(9), 3205\u20133216 (2017)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"12_CR9","unstructured":"Garfinkel, M.: Minimizing multi-zone orders in the correlated storage assingment problem. PhD Thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology (2005)"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01007975","volume":"39","author":"B Gidas","year":"1985","unstructured":"Gidas, B.: Nonstationary Markov chains and convergence of the annealing algorithm. J. Stat. Phys. 39(1), 73\u2013131 (1985). https:\/\/doi.org\/10.1007\/BF01007975","journal-title":"J. Stat. Phys."},{"key":"12_CR11","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":"3","key":"12_CR12","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."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Kallina, C., Lynn, J.: Application of the cube-per-order index rule for stock location in a distribution warehouse. Interfaces 7(1), 37\u201346 (1976). https:\/\/www.jstor.org\/stable\/25059400","DOI":"10.1287\/inte.7.1.37"},{"key":"12_CR14","series-title":"Topics in Intelligent Engineering and Informatics","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-01436-4_7","volume-title":"Advanced Methods and Applications in Computational Intelligence","author":"M Kofler","year":"2014","unstructured":"Kofler, M., Beham, A., Wagner, S., Affenzeller, M.: Affinity based slotting in warehouses with dynamic order patterns. In: Klempous, R., Nikodem, J., Jacak, W., Chaczko, Z. (eds.) Advanced Methods and Applications in Computational Intelligence. Topics in Intelligent Engineering and Informatics, vol. 6, pp. 123\u2013143. Springer, Heidelberg (2014)"},{"issue":"2","key":"12_CR15","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."},{"key":"12_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-3423-5","volume-title":"Practical Python AI Projects: Mathematical Models of Optimization Problems with Google OR-Tools","author":"S Kruk","year":"2018","unstructured":"Kruk, S.: Practical Python AI Projects: Mathematical Models of Optimization Problems with Google OR-Tools. Apress, New York (2018)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"106645","DOI":"10.1016\/j.cie.2020.106645","volume":"147","author":"P K\u00fcbler","year":"2020","unstructured":"K\u00fcbler, P., Glock, C., Bauernhansl, T.: A new iterative method for solving the joint dynamic storage location assignment, order batching and picker routing problem in manual picker-to-parts warehouses. Comput. Ind. Eng. 147, 106645 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"21","key":"12_CR18","doi-asserted-by":"publisher","first-page":"6407","DOI":"10.1080\/00207543.2016.1165880","volume":"55","author":"JA Larco","year":"2017","unstructured":"Larco, J.A., Koster, R.D., Roodbergen, K.J., Dul, J.: Managing warehouse efficiency and worker discomfort through enhanced storage assignment decisions. Int. J. Prod. Res. 55(21), 6407\u20136422 (2017). https:\/\/doi.org\/10.1080\/00207543.2016.1165880","journal-title":"Int. J. Prod. Res."},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Lee, I.G., Chung, S.H., Yoon, S.W.: Two-stage storage assignment to minimize travel time and congestion for warehouse order picking operations. Comput. Ind. Eng. 139, 106129 (2020) https:\/\/doi.org\/10.1016\/j.cie.2019.106129, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835219305984","DOI":"10.1016\/j.cie.2019.106129"},{"issue":"9","key":"12_CR20","doi-asserted-by":"publisher","first-page":"2179","DOI":"10.1007\/s00170-015-7806-7","volume":"84","author":"J Li","year":"2016","unstructured":"Li, J., Moghaddam, M., Nof, S.Y.: Dynamic storage assignment with product affinity and ABC classification-a case study. Int. J. Adv. Manuf. Technol. 84(9), 2179\u20132194 (2016). https:\/\/doi.org\/10.1007\/s00170-015-7806-7","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Liu, C.M.: Clustering techniques for stock location and order-picking in a distribution center. Comput. Oper. Res. 26(10), 989\u20131002 (1999). https:\/\/doi.org\/10.1016\/S0305-0548(99)00026-X, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S030505489900026X","DOI":"10.1016\/S0305-0548(99)00026-X"},{"key":"12_CR22","series-title":"NATO ASI Series","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-94-011-5014-9_7","volume-title":"Learning in Graphical Models","author":"DJC Mackay","year":"1998","unstructured":"Mackay, D.J.C.: Introduction to Monte Carlo methods. In: Jordan, M.I. (ed.) Learning in Graphical Models. NATO ASI Series, vol. 89, pp. 175\u2013204. Springer, Dordrecht (1998). https:\/\/doi.org\/10.1007\/978-94-011-5014-9_7"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1504\/EJIE.2007.014689","volume":"1","author":"R Mantel","year":"2007","unstructured":"Mantel, R., et al.: Order oriented slotting: a new assignment strategy for warehouses. Eur. J. Ind. Eng. 1, 301\u2013316 (2007)","journal-title":"Eur. J. Ind. Eng."},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Maruyama, K., Yamazaki, T.: Improved efficiency of warehouse picking by co-optimization of order batching and storage location assignment. J. Adv. Mech. Des. Syst. Manuf. 16(5), JAMDSM0052-JAMDSM0052 (2022). https:\/\/doi.org\/10.1299\/jamdsm.2022jamdsm0052","DOI":"10.1299\/jamdsm.2022jamdsm0052"},{"issue":"1","key":"12_CR25","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1111\/exsy.12006","volume":"31","author":"D Ming-Huang Chiang","year":"2014","unstructured":"Ming-Huang Chiang, D., Lin, C.P., Chen, M.C.: Data mining based storage assignment heuristics for travel distance reduction. Expert Syst. 31(1), 81\u201390 (2014)","journal-title":"Expert Syst."},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Oxenstierna, J., Krueger, V., Malec, J.: New benchmarks and optimization model for the storage location assignment problem. In: 3rd International Conference on Innovative Intelligent Industrial Production and Logistics, IN4PL 2022. SciTePress (2022)","DOI":"10.5220\/0011378400003329"},{"key":"12_CR27","doi-asserted-by":"publisher","unstructured":"Oxenstierna, J., Malec, J., Krueger, V.: Analysis of computational efficiency in iterative order batching optimization. In: Proceedings of the 11th International Conference on Operations Research and Enterprise Systems - ICORES, pp. 345\u2013353. SciTePress (2022). https:\/\/doi.org\/10.5220\/0010837700003117","DOI":"10.5220\/0010837700003117"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Oxenstierna, J., Rensburg, L.V., Stuckey, P., Krueger, V.: Storage assignment using nested annealing and hamming distances. In: Proceedings of the 12th International Conference on Operations Research and Enterprise Systems - ICORES, pp. 94\u2013105. SciTePress (2023). https:\/\/doi.org\/10.5220\/0011785100003396. backup Publisher: INSTICC ISSN: 2184-4372","DOI":"10.5220\/0011785100003396"},{"issue":"1","key":"12_CR29","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(92)90177-H","volume":"99","author":"S Rajasekaran","year":"1992","unstructured":"Rajasekaran, S., Reif, J.H.: Nested annealing: a provable improvement to simulated annealing. Theoret. Comput. Sci. 99(1), 157\u2013176 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Rathod, A.B., Gulhane, S.M., Padalwar, S.R.: A comparative study on distance measuring approches for permutation representations. In: 2016 IEEE International Conference on Advances in Electronics, Communication and Computer Technology (ICAECCT), pp. 251\u2013255. IEEE (2016)","DOI":"10.1109\/ICAECCT.2016.7942593"},{"key":"12_CR31","unstructured":"Janse van Rensburg, L.J.V.: Artificial intelligence for warehouse picking optimization - an NP-hard problem. Master\u2019s thesis, Uppsala University (2019)"},{"issue":"9","key":"12_CR32","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":"12_CR33","unstructured":"Schapire, R.: Using Output Codes to Boost Multiclass Learning Problems (2001)"},{"issue":"3","key":"12_CR34","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1080\/10618600.2017.1415911","volume":"27","author":"H Tak","year":"2018","unstructured":"Tak, H., Meng, X.L., Dyk, D.A.V.: A repelling-attracting metropolis algorithm for multimodality. J. Comput. Graph. Stat. 27(3), 479\u2013490 (2018). https:\/\/doi.org\/10.1080\/10618600.2017.1415911","journal-title":"J. Comput. Graph. Stat."},{"key":"12_CR35","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/s10696-021-09423-w","volume":"34","author":"MAM Trindade","year":"2022","unstructured":"Trindade, M.A.M., Sousa, P., Moreira, M.: Ramping up a heuristic procedure for storage location assignment problem with precedence constraints. Flex. Serv. Manuf. J. 34, 646\u2013669 (2022). https:\/\/doi.org\/10.1007\/s10696-021-09423-w","journal-title":"Flex. Serv. Manuf. J."},{"issue":"3","key":"12_CR36","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."},{"key":"12_CR37","doi-asserted-by":"publisher","first-page":"5111","DOI":"10.1021\/jp970984n","volume":"101","author":"DJ Wales","year":"1997","unstructured":"Wales, D.J., Doye, J.P.K.: Global optimization by basin-hopping and the lowest energy structures of Lennard-jones clusters containing up to 110 atoms. J. Phys. Chem. A 101, 5111\u20135116 (1997)","journal-title":"J. Phys. Chem. A"},{"key":"12_CR38","doi-asserted-by":"publisher","unstructured":"Wu, J., Qin, T., Chen, J., Si, H., Lin, K.: Slotting optimization algorithm of the stereo warehouse. In: Proceedings of the 2012 2nd International Conference on Computer and Information Application (ICCIA 2012), pp. 128\u2013132. Atlantis Press (2014). https:\/\/doi.org\/10.2991\/iccia.2012.31","DOI":"10.2991\/iccia.2012.31"},{"key":"12_CR39","doi-asserted-by":"publisher","unstructured":"Wutthisirisart, P., Noble, J.S., Chang, C.A.: A two-phased heuristic for relation-based item location. Comput. Ind. Eng. 82, 94\u2013102 (2015) https:\/\/doi.org\/10.1016\/j.cie.2015.01.020, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S036083521500039X","DOI":"10.1016\/j.cie.2015.01.020"},{"issue":"11","key":"12_CR40","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1080\/0305215X.2017.1419346","volume":"50","author":"X Xiang","year":"2018","unstructured":"Xiang, X., Liu, C., Miao, L.: Storage assignment and order batching problem in Kiva mobile fulfilment system. Eng. Optim. 50(11), 1941\u20131962 (2018). https:\/\/doi.org\/10.1080\/0305215X.2017.1419346","journal-title":"Eng. Optim."},{"issue":"2","key":"12_CR41","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.B.M.D.: 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."},{"key":"12_CR42","doi-asserted-by":"publisher","unstructured":"Yu, V.F., Winarno, Maulidin, A., Redi, A.A.N.P., Lin, S.W., Yang, C.L.: Simulated Annealing with Restart Strategy for the Path Cover Problem with Time Windows. Mathematics 9(14) (2021). https:\/\/doi.org\/10.3390\/math9141625, https:\/\/www.mdpi.com\/2227-7390\/9\/14\/1625","DOI":"10.3390\/math9141625"},{"key":"12_CR43","doi-asserted-by":"publisher","unstructured":"Zhang, R.Q., et al.: New model of the storage location assignment problem considering demand correlation pattern. Comput. Ind. Eng. 129, 210\u2013219 (2019). https:\/\/doi.org\/10.1016\/j.cie.2019.01.027, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835219300294","DOI":"10.1016\/j.cie.2019.01.027"},{"key":"12_CR44","doi-asserted-by":"publisher","unstructured":"\u017dulj, I., Glock, C.H., Grosse, E.H., Schneider, M.: Picker routing and storage-assignment strategies for precedence-constrained order picking. Comput. Ind. Eng. 123, 338\u2013347 (2018). https:\/\/doi.org\/10.1016\/j.cie.2018.06.015, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835218302869","DOI":"10.1016\/j.cie.2018.06.015"}],"container-title":["Communications in Computer and Information Science","Operations Research and Enterprise Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49662-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T13:05:09Z","timestamp":1702559109000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49662-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,15]]},"ISBN":["9783031496615","9783031496622"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49662-2_12","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023,12,15]]},"assertion":[{"value":"15 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICORES","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research and Enterprise Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 February 2023","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":"icores2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icores.scitevents.org\/?y=2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}