{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:33:29Z","timestamp":1725669209643},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031700545","type":"print"},{"value":"9783031700552","type":"electronic"}],"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-70055-2_12","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:54Z","timestamp":1725663774000},"page":"184-200","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving the\u00a0Performance of\u00a0Relocation Rules for\u00a0the\u00a0Container Relocation Problem with\u00a0the\u00a0Rollout Algorithm"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-8732-4769","authenticated-orcid":false,"given":"Marko","family":"\u0110urasevi\u0107","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-8980-6315","authenticated-orcid":false,"given":"Mateja","family":"\u0110umi\u0107","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0606-7009","authenticated-orcid":false,"given":"Francisco Javier","family":"Gil-Gala","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2592-8206","authenticated-orcid":false,"given":"Nikolina","family":"Frid","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9201-2994","authenticated-orcid":false,"given":"Domagoj","family":"Jakobovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00291-003-0157-z","volume":"26","author":"D Steenken","year":"2004","unstructured":"Steenken, D., Vo\u00df, S., Stahlbock, R.: Container terminal operation and operations research - a classification and literature review. OR Spectrum 26(1), 3\u201349 (2004)","journal-title":"OR Spectrum"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Guli\u0107, M., Magli\u0107, L., Krljan, T., Magli\u0107, L.: Solving the container relocation problem by using a metaheuristic genetic algorithm. Appl. Sci. 12(15) (2022)","DOI":"10.3390\/app12157397"},{"key":"12_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2023.121378","volume":"347","author":"H Xiao","year":"2023","unstructured":"Xiao, H., Lijun, F., Shang, C., Bao, X., Xinghua, X., Guo, W.: Ship energy scheduling with dqn-ce algorithm combining bi-directional lstm and attention mechanism. Appl. Energy 347, 121378 (2023)","journal-title":"Appl. Energy"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ejor.2011.12.039","volume":"219","author":"M Caserta","year":"2012","unstructured":"Caserta, M., Schwarze, S., Vo\u00df, S.: A mathematical formulation and complexity considerations for the blocks relocation problem. Eur. J. Oper. Res. 219(1), 96\u2013104 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"12_CR5","unstructured":"Wu, K.-C., Ting, C.-J.: A beam search algorithm for minimizing reshuffle operations at container yards (2010)"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.cor.2004.08.005","volume":"33","author":"Kap Hwan Kim and Gyu Pyo Hong","year":"2006","unstructured":"Kap Hwan Kim and Gyu Pyo Hong: A heuristic rule for relocating blocks. Comput. Oper. Res. 33(4), 940\u2013954 (2006)","journal-title":"Comput. Oper. Res."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"D\u00edaz, C., Cristina Riff, M.: New bounds for large container relocation instances using grasp. In: Proceedings - 2016 IEEE 28th International Conference on Tools with Artificial Intelligence, ICTAI 2016, pp. 343\u2013349 (2017)","DOI":"10.1109\/ICTAI.2016.0059"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"\u0110urasevi\u0107, M., \u0110umi\u0107, M.: Automated design of heuristics for the container relocation problem using genetic programming. Applied Soft Computing (2022)","DOI":"10.1016\/j.asoc.2022.109696"},{"key":"12_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.111104","volume":"150","author":"M \u0110urasevi\u0107","year":"2024","unstructured":"\u0110urasevi\u0107, M., \u0110umi\u0107, M.: Designing relocation rules with genetic programming for the container relocation problem with multiple bays and container groups. Appl. Soft Comput. 150, 111104 (2024)","journal-title":"Appl. Soft Comput."},{"key":"12_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121624","volume":"237","author":"M \u0110urasevi\u0107","year":"2024","unstructured":"\u0110urasevi\u0107, M., \u0110umi\u0107, M., \u010cori\u0107, R., Gil-Gala, F.J.: Automated design of relocation rules for minimising energy consumption in the container relocation problem. Expert Syst. Appl. 237, 121624 (2024)","journal-title":"Expert Syst. Appl."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"2989","DOI":"10.1007\/978-1-4419-7997-1_8","volume-title":"Handbook of Combinatorial Optimization","author":"DP Bertsekas","year":"2013","unstructured":"Bertsekas, D.P.: Rollout algorithms for discrete optimization: a survey. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 2989\u20133013. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4419-7997-1_8"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Durasevic, M., Jakobovic, D.: Automatic design of dispatching rules for static scheduling conditions. Neural Computing and Applications (2020)","DOI":"10.1007\/s00521-020-05292-w"},{"key":"12_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108239","volume":"169","author":"M \u0110umi\u0107","year":"2022","unstructured":"\u0110umi\u0107, M., Jakobovi\u0107, D.: Using priority rules for resource-constrained project scheduling problem in static environment. Comput. Ind. Eng. 169, 108239 (2022)","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"12_CR14","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/0305-0483(88)90032-1","volume":"16","author":"D Sculli","year":"1988","unstructured":"Sculli, D., Hui, C.F.: Three dimensional stacking of containers. Omega 16(6), 585\u2013594 (1988)","journal-title":"Omega"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Lu, C., Zeng, B., Liu, S.: A study on the block relocation problem: lower bound derivations and strong formulations. IEEE Trans. Autom. Sci. Eng., 1\u201325 (2020)","DOI":"10.1109\/TASE.2020.2979868"},{"issue":"6","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1016\/j.cor.2009.10.005","volume":"37","author":"Yusin Lee and Yen Ju Lee","year":"2010","unstructured":"Yusin Lee and Yen Ju Lee: A heuristic for retrieving containers from a yard. Comput. Oper. Res. 37(6), 1139\u20131147 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/s00291-009-0176-5","volume":"33","author":"M Caserta","year":"2011","unstructured":"Caserta, M., Vo\u00df, S., Sniedovich, M.: Applying the corridor method to a blocks relocation problem. OR Spectrum 33(4), 915\u2013929 (2011)","journal-title":"OR Spectrum"},{"issue":"4","key":"12_CR18","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/TASE.2012.2198642","volume":"9","author":"H Wenbin Zhu","year":"2012","unstructured":"Wenbin Zhu, H., Qin, A.L., Zhang, H.: Iterative deepening A* algorithms for the container relocation problem. IEEE Trans. Autom. Sci. Eng. 9(4), 710\u2013722 (2012)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cie.2014.06.010","volume":"75","author":"R Jovanovic","year":"2014","unstructured":"Jovanovic, R., Vo\u00df, S.: A chain heuristic for the blocks relocation problem. Comput. Ind. Eng. 75(1), 79\u201386 (2014)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1007\/s10696-018-9320-3","volume":"31","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic, R., Tanaka, S., Nishi, T., Vo\u00df, S.: A GRASP approach for solving the blocks relocation problem with stowage plan. Flex. Serv. Manuf. J. 31(3), 702\u2013729 (2019)","journal-title":"Flex. Serv. Manuf. J."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"de\u00a0Melo\u00a0da Silva, M., Toulouse, S., Calvo, R.W.: A new effective unified model for solving the Pre-marshalling and Block Relocation Problems. Europ. J. Oper. Res. 271(1), 40\u201356 (2018)","DOI":"10.1016\/j.ejor.2018.05.004"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"D\u00edaz Cifuentes, C., Cristina Riff, M.: G-CREM: a GRASP approach to solve the container relocation problem for multibays. Appl. Soft Comput. J. (xxxx), 106721 (2020)","DOI":"10.1016\/j.asoc.2020.106721"},{"key":"12_CR23","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-319-42902-1_22","volume-title":"Operations Research Proceedings 2015","author":"O Karpuzo\u011flu","year":"2017","unstructured":"Karpuzo\u011flu, O., Aky\u00fcz, M.H., \u00d6ncan, T.: A Tabu search based heuristic approach for the dynamic container relocation problem. In: Doerner, K.F., Ljubic, I., Pflug, G., Tragler, G. (eds.) Operations Research Proceedings 2015. ORP, pp. 165\u2013171. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-42902-1_22"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Kimms, A., Wilschewski, F.: A new modeling approach for the unrestricted block relocation problem, August 2023","DOI":"10.1007\/s00291-023-00728-w"},{"issue":"2","key":"12_CR25","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/j.ejor.2022.04.006","volume":"304","author":"B Jin","year":"2023","unstructured":"Jin, B., Tanaka, S.: An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules. Eur. J. Oper. Res. 304(2), 494\u2013514 (2023)","journal-title":"Eur. J. Oper. Res."},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Raeesi, R., Sahebjamnia, N., Afshin Mansouri, S.: The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions. Europ. J. Oper. Res. 310(3), 943\u2013973 (2023)","DOI":"10.1016\/j.ejor.2022.11.054"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"4223","DOI":"10.1007\/s00500-022-07070-3","volume":"27","author":"T Bacci","year":"2023","unstructured":"Bacci, T., Mattia, S., Ventura, P.: The realization-independent reallocation heuristic for the stochastic container relocation problem. Soft. Comput. 27, 4223\u20134233 (2023)","journal-title":"Soft. Comput."},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00291-022-00703-x","volume":"45","author":"S Boge","year":"2023","unstructured":"Boge, S., Knust, S.: The blocks relocation problem with item families minimizing the number of reshuffles. OR Spectrum 45, 395\u2013435 (2023)","journal-title":"OR Spectrum"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Bertsekas, D.P., Castanon, D.A.: Rollout algorithms for stochastic scheduling problems. In: Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171), vol. 2, pp. 2143\u20132148, December 1998","DOI":"10.1109\/CDC.1998.758655"},{"issue":"1","key":"12_CR30","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/A:1009634810396","volume":"5","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P., Castanon, D.A.: Rollout algorithms for stochastic scheduling problems. J. Heuristics 5(1), 89\u2013108 (1999)","journal-title":"J. Heuristics"},{"key":"12_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.07.002","volume":"50","author":"S Chand","year":"2019","unstructured":"Chand, S., Singh, H., Ray, T.: Evolving rollout-justification based heuristics for resource constrained project scheduling problems. Swarm Evol. Comput. 50, 100556 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Branke, J., Hildebrandt, T., Scholz-Reiter, B.: Hyper-heuristic evolution of dispatching rules: a comparison of rule representations. Evol. Comput. 23(2), 249\u2013277 (2015)","DOI":"10.1162\/EVCO_a_00131"},{"issue":"6","key":"12_CR33","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10951-005-4781-0","volume":"8","author":"X Li","year":"2005","unstructured":"Li, X., Olafsson, S.: Discovering dispatching rules using data mining. J. Sched. 8(6), 515\u2013527 (2005)","journal-title":"J. Sched."},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"J\u00fcrgen Branke, S., Nguyen, C.W., Pickardt, Zhang, M.: Automated design of production scheduling heuristics: a review. IEEE Trans. Evol. Comput. 20(1), 110\u2013124 (2016)","DOI":"10.1109\/TEVC.2015.2429314"},{"issue":"1","key":"12_CR35","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s40747-017-0036-x","volume":"3","author":"S Nguyen","year":"2017","unstructured":"Nguyen, S., Mei, Y., Zhang, M.: Genetic programming for production scheduling: a survey with a unified framework. Complex Intell. Syst. 3(1), 41\u201366 (2017)","journal-title":"Complex Intell. Syst."},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, F., Mei, Y., Nguyen, S., Zhang, M.: Survey on genetic programming and machine learning techniques for heuristic design in job shop scheduling. IEEE Trans. Evol. Comput., 1 (2023)","DOI":"10.1109\/TEVC.2023.3255246"},{"issue":"6","key":"12_CR37","doi-asserted-by":"publisher","first-page":"285","DOI":"10.3390\/a16060285","volume":"16","author":"D Jakobovi\u0107","year":"2023","unstructured":"Jakobovi\u0107, D., \u0110urasevi\u0107, M., Brki\u0107, K., Fosin, J., Cari\u0107, T., Davidovi\u0107, D.: Evolving dispatching rules for dynamic vehicle routing with genetic programming. Algorithms 16(6), 285 (2023)","journal-title":"Algorithms"},{"key":"12_CR38","doi-asserted-by":"crossref","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming (2008)","DOI":"10.1145\/1274000.1274124"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70055-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:18Z","timestamp":1725663858000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70055-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700545","9783031700552"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70055-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","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":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}