{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T16:19:43Z","timestamp":1768148383341,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031417733","type":"print"},{"value":"9783031417740","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-41774-0_43","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T03:25:20Z","timestamp":1695266720000},"page":"546-559","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Generalized Objective Function to Ensure Robust Evaluation for Evolutionary Storage Location Assignment Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8067-4432","authenticated-orcid":false,"given":"Polina","family":"G\u00f6rbe","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1255-8031","authenticated-orcid":false,"given":"Tam\u00e1s","family":"B\u00f3dis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,22]]},"reference":[{"issue":"2","key":"43_CR1","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.ejor.2006.07.009","volume":"182","author":"RBM de Koster","year":"2007","unstructured":"de Koster, R.B.M., 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":"January","key":"43_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tre.2019.02.010","volume":"125","author":"T van Gils","year":"2019","unstructured":"van Gils, T., Caris, A., Ramaekers, K., Braekers, K., de Koster, R.B.M.: Designing efficient order picking systems: the effect of real-life features on the relationship among planning problems. Transp. Res. Part E: Logist. Transp. Rev. 125(January), 47\u201373 (2019)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"1","key":"43_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2017.09.002","volume":"267","author":"T van Gils","year":"2018","unstructured":"van Gils, T., Ramaekers, K., Caris, A., de Koster, R.B.M.: Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review. Eur. J. Oper. Res. 267(1), 1\u201315 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"43_CR4","first-page":"396","volume":"129","author":"RBM de Koster","year":"2019","unstructured":"de Koster, R.B.M., Le-Duc, T., Roodbergen, K.J.: Design and control of warehouse order picking: a literature review. Comput. Ind. Eng. 129(2), 396\u2013411 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"G\u00f6rbe, P., B\u00f3dis, T., Botzheim, J.: A conceptual framework for adaptive storage location assignment considering order characteristics. Eur. J. Sci. Technol. (April), 610\u2013614 (2020)","DOI":"10.31590\/ejosat.araconf74"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"G\u00f6rbe, P., B\u00f3dis, T., F\u00f6ldesi, P.: Trade-offs in warehousing storage location reassignment. Int. J. Logist. Syst. Manag. (1742\u20137967 1742\u20137975): 1(1), 1 (2023)","DOI":"10.1504\/IJLSM.2023.10054150"},{"key":"43_CR7","unstructured":"Frazelle, E.H.: Stock location assignment and order picking productivity. Doctoral Dissertation, Georgia Institute of Technology (1989)"},{"key":"43_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106645","volume":"147","author":"P K\u00fcbler","year":"2020","unstructured":"K\u00fcbler, P., Glock, C.H., 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":"2","key":"43_CR9","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ifacol.2016.03.006","volume":"49","author":"Y Zhang","year":"2016","unstructured":"Zhang, Y.: Correlated storage assignment strategy to reduce travel distance in order picking. IFAC-PapersOnLine 49(2), 30\u201335 (2016)","journal-title":"IFAC-PapersOnLine"},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.cie.2019.01.027","volume":"129","author":"RQ Zhang","year":"2019","unstructured":"Zhang, R.Q., Wang, M., Pan, X.: New model of the storage location assignment problem considering demand correlation pattern. Comput. Ind. Eng. 129, 210\u2013219 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Silva, A., Coelho, L.C., Darvish, M., Renaud, J.: Integrating storage location and order picking problems in warehouse planning. Transp. Res. Part E: Logist. Transp. Rev. 140(July), 102003 (2020)","DOI":"10.1016\/j.tre.2020.102003"},{"issue":"4","key":"43_CR12","first-page":"1","volume":"11","author":"Y Li","year":"2021","unstructured":"Li, Y., M\u00e9ndez-Mediavilla, F.A., Temponi, C., Kim, J., Jimenez, J.A.: A heuristic storage location assignment based on frequent itemset classes to improve order picking operations. Appl. Sci. (Switzerland) MDPI AG 11(4), 1\u201315 (2021)","journal-title":"Appl. Sci. (Switzerland) MDPI AG"},{"issue":"3","key":"43_CR13","first-page":"34","volume":"7","author":"MAM Trindade","year":"2021","unstructured":"Trindade, M.A.M., Sousa, P.S.A., Moreira, M.R.A.: Improving order-picking operations with precedence constraints through efficient storage location assignment: evidence from a retail company, U Porto. J. Eng. 7(3), 34\u201352 (2021)","journal-title":"J. Eng."},{"issue":"1","key":"43_CR14","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.tre.2009.07.004","volume":"46","author":"C Park","year":"2010","unstructured":"Park, C., Seo, J.: Comparing heuristic algorithms of the planar storage location assignment problem. Transp. Res. Part E: Logist. Transp. Rev. 46(1), 171\u2013185 (2010)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"43_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2014.12.010","volume":"81","author":"JCH Pan","year":"2015","unstructured":"Pan, J.C.H., Shih, P.H., Wu, M.H., Lin, J.H.: A storage assignment heuristic method based on genetic algorithm for a pick-and-pass warehousing system. Comput. Ind. Eng. 81, 1\u201313 (2015)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"43_CR16","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."},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"Wang, M., Zhang, R.Q., Fan, K.: Improving order-picking operation through efficient storage location assignment: a new approach. Comput. Ind. Eng. 139(October 2019), 106186 (2020)","DOI":"10.1016\/j.cie.2019.106186"},{"issue":"9\u201312","key":"43_CR18","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\u2014a case study. Int. J. Adv. Manufact. Technol. 84(9\u201312), 2179\u20132194 (2016)","journal-title":"Int. J. Adv. Manufact. Technol."},{"key":"43_CR19","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tre.2017.04.003","volume":"102","author":"AS Dijkstra","year":"2017","unstructured":"Dijkstra, A.S., Roodbergen, K.J.: Exact route-length formulas and a storage location assignment heuristic for picker-to-parts warehouses. Transp. Res. Part E: Logist. Transp. Rev. 102, 38\u201359 (2017)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."}],"container-title":["Communications in Computer and Information Science","Advances in Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41774-0_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T06:35:18Z","timestamp":1695278118000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41774-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031417733","9783031417740"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41774-0_43","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Budapest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","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":"27 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2023\/","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":"218","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":"59","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":"27% - 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.01","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":"1.86","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)"}}]}}