{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T11:16:36Z","timestamp":1775128596067,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T00:00:00Z","timestamp":1651622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T00:00:00Z","timestamp":1651622400000},"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":["Soft Comput"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00500-022-07070-3","type":"journal-article","created":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T13:05:56Z","timestamp":1651669556000},"page":"4223-4233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["The realization-independent reallocation heuristic for the stochastic container relocation problem"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7365-6516","authenticated-orcid":false,"given":"Tiziano","family":"Bacci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sara","family":"Mattia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Ventura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,4]]},"reference":[{"key":"7070_CR1","volume-title":"A new lower bound for the block relocation problem. computational logistics","author":"T Bacci","year":"2018","unstructured":"Bacci T, Ventura Mattia P (2018) A new lower bound for the block relocation problem. computational logistics. Springer International Publishing, Cham"},{"key":"7070_CR2","volume-title":"Some complexity results for the minimum blocking items problem. optimization and decision science: methodologies and applications","author":"T Bacci","year":"2017","unstructured":"Bacci T, Mattia S, Ventura P (2017) Some complexity results for the minimum blocking items problem. optimization and decision science: methodologies and applications. Springer International Publishing, Cham"},{"key":"7070_CR3","first-page":"41","volume-title":"A new software system for optimizing the operations at a container terminal","author":"T Bacci","year":"2019","unstructured":"Bacci T, Conte S, Matera D, Mattia S, Ventura Paolo P (2019) A new software system for optimizing the operations at a container terminal. Springer International Publishing, Cham, pp 41\u201350"},{"key":"7070_CR4","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.cor.2018.11.008","volume":"103","author":"T Bacci","year":"2019","unstructured":"Bacci T, Mattia S, Ventura P (2019) The bounded beam search algorithm for the block relocation problem. Computers Op Res 103:252\u2013264","journal-title":"Computers Op Res"},{"issue":"2","key":"7070_CR5","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.ejor.2020.05.029","volume":"287","author":"T Bacci","year":"2020","unstructured":"Bacci T, Mattia S, Ventura P (2020) A branch-and-cut algorithm for the restricted block relocation problem. Eur J Op Res 287(2):452\u2013459","journal-title":"Eur J Op Res"},{"key":"7070_CR6","unstructured":"Bacci T. http:\/\/www.iasi.cnr.it\/~tbacci\/"},{"issue":"45","key":"7070_CR7","doi-asserted-by":"publisher","first-page":"6261","DOI":"10.1016\/j.tcs.2011.07.012","volume":"412","author":"F Bonomo","year":"2011","unstructured":"Bonomo F, Mattia S, Oriolo G (2011) Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. Theoretical Computer Sci 412(45):6261\u20136268","journal-title":"Theoretical Computer Sci"},{"issue":"1","key":"7070_CR8","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 (2012) A mathematical formulation and complexity considerations for the blocks relocation problem. Eur J Op Res 219(1):96\u2013104","journal-title":"Eur J Op Res"},{"key":"7070_CR9","doi-asserted-by":"crossref","unstructured":"Feng Y, Song D-P, Li D, Zeng Q (2020) The stochastic container relocation problem with flexible service policies. Transp Res Part B: Methodol 141:116\u2013163","DOI":"10.1016\/j.trb.2020.09.006"},{"issue":"5","key":"7070_CR10","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1287\/trsc.2018.0828","volume":"52","author":"V Galle","year":"2018","unstructured":"Galle V, Manshadi V, Borjian Boroujeni S, Barnhart C, Jaillet P (2018) The stochastic container relocation problem. Transp Sci 52(5):1035\u20131058","journal-title":"Transp Sci"},{"issue":"17","key":"7070_CR11","doi-asserted-by":"publisher","first-page":"6408","DOI":"10.1016\/j.eswa.2015.04.021","volume":"42","author":"CE Izquierdo","year":"2015","unstructured":"Izquierdo CE, Batista BM, Vega JMM (2015) An exact approach for the blocks relocation problem. Expert Syst Appl 42(17):6408\u20136422","journal-title":"Expert Syst Appl"},{"issue":"2","key":"7070_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0890-5401(02)00028-7","volume":"180","author":"K Jansen","year":"2003","unstructured":"Jansen K (2003) The mutual exclusion scheduling problem for permutation and comparability graphs. Inf Comput 180(2):71\u201381","journal-title":"Inf Comput"},{"key":"7070_CR13","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 (2014) A chain heuristic for the blocks relocation problem. Computers Indus Eng 75:79\u201386","journal-title":"Computers Indus Eng"},{"issue":"1","key":"7070_CR14","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ejor.2018.09.038","volume":"274","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic R, Tuba M, Vo\u00df S (2019) An efficient ant colony optimization algorithm for the blocks relocation problem. Eur J Op Res 274(1):78\u201390","journal-title":"Eur J Op Res"},{"issue":"4","key":"7070_CR15","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.cor.2004.08.005","volume":"33","author":"K Kim","year":"2006","unstructured":"Kim K, Hong G (2006) A heuristic rule for relocating blocks. Computers Op Res 33(4):940\u2013954","journal-title":"Computers Op Res"},{"issue":"3","key":"7070_CR16","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.ejor.2016.01.055","volume":"252","author":"D Ku","year":"2016","unstructured":"Ku D, Arthanari T (2016) Container relocation problem with time windows for container departure. Eur J Op Res 252(3):1031\u20131039","journal-title":"Eur J Op Res"},{"issue":"3","key":"7070_CR17","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s10589-012-9500-0","volume":"54","author":"S Mattia","year":"2013","unstructured":"Mattia S (2013) The robust network loading problem with dynamic routing. Comput Optim Appl 54(3):619\u2013643","journal-title":"Comput Optim Appl"},{"key":"7070_CR18","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/s10589-017-9956-z","volume":"69","author":"S Mattia","year":"2018","unstructured":"Mattia S, Poss M (2018) A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation. Comput Optim Appl 69:753\u2013800","journal-title":"Comput Optim Appl"},{"key":"7070_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.omega.2016.11.001","volume":"72","author":"S Mattia","year":"2017","unstructured":"Mattia S, Rossi F, Servilio M, Smriglio S (2017) Staffing and scheduling flexible call centers by two-stage robust optimization. Omega 72:25\u201337","journal-title":"Omega"},{"key":"7070_CR20","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.cor.2018.06.021","volume":"99","author":"KEY Quispe","year":"2018","unstructured":"Quispe KEY, Lintzmayer CN, Xavier EC (2018) An exact algorithm for the blocks relocation problem with new lower bounds. Computers Op Res 99:206\u2013217","journal-title":"Computers Op Res"},{"key":"7070_CR21","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2018.02.019","volume":"95","author":"S Tanaka","year":"2018","unstructured":"Tanaka S, Mizuno F (2018) An exact algorithm for the unrestricted block relocation problem. Computers Op Res 95:12\u201331","journal-title":"Computers Op Res"},{"issue":"1","key":"7070_CR22","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TASE.2015.2434417","volume":"13","author":"S Tanaka","year":"2016","unstructured":"Tanaka S, Takii K (2016) A faster branch-and-bound algorithm for the block relocation problem. IEEE Trans Autom Sci Eng 13(1):181\u2013190","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"7070_CR23","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.ejor.2021.03.062","volume":"296","author":"S Tanaka","year":"2021","unstructured":"Tanaka S, Vo\u00df S (2021) An exact approach to the restricted block relocation problem based on a new integer programming formulation. Eur J Op Res 296:485","journal-title":"Eur J Op Res"},{"key":"7070_CR24","doi-asserted-by":"crossref","unstructured":"\u00dcnl\u00fcyurt T, Ayd\u0131n C (2012) Improved rehandling strategies for the container retrieval process. J Adv Transp 46(4):378\u2013393","DOI":"10.1002\/atr.1193"},{"key":"7070_CR25","unstructured":"Virgile Galle. https:\/\/github.com\/vgalle\/StochasticCRP"},{"issue":"1","key":"7070_CR26","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.ejor.2016.09.011","volume":"259","author":"E Zehendner","year":"2017","unstructured":"Zehendner E, Feillet D, Jaillet P (2017) An algorithm with performance guarantee for the online container relocation problem. Eur J Op Res 259(1):48\u201362","journal-title":"Eur J Op Res"},{"key":"7070_CR27","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.trb.2020.05.017","volume":"139","author":"C Zhang","year":"2020","unstructured":"Zhang C, Guan H, Yuan Y, Chen W, Wu T (2020) Machine learning-driven algorithms for the container relocation problem. Transp Res Part B: Methodol 139:102\u2013131","journal-title":"Transp Res Part B: Methodol"},{"issue":"3","key":"7070_CR28","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.tre.2009.11.007","volume":"46","author":"W Zhao","year":"2010","unstructured":"Zhao W, Goodchild AV (2010) The impact of truck arrival information on container terminal rehandling. Transp Res Part E: Logist Transp Rev 46(3):327\u2013343","journal-title":"Transp Res Part E: Logist Transp Rev"},{"issue":"4","key":"7070_CR29","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/TASE.2012.2198642","volume":"9","author":"W Zhu","year":"2012","unstructured":"Zhu W, Qin H, Lim A, Zhang H (2012) Iterative deepening $$A^*$$ algorithms for the container relocation problem. IEEE Trans Autom Sci Eng 9(4):710\u2013722","journal-title":"IEEE Trans Autom Sci Eng"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07070-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07070-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07070-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,14]],"date-time":"2023-03-14T10:15:42Z","timestamp":1678788942000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07070-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,4]]},"references-count":29,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["7070"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07070-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,4]]},"assertion":[{"value":"23 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}