{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T15:05:38Z","timestamp":1774883138129,"version":"3.50.1"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.cor.2026.107434","type":"journal-article","created":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T15:59:32Z","timestamp":1771516772000},"page":"107434","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Optimization of partially ordered container relocation problem with rolled containers"],"prefix":"10.1016","volume":"191","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0095-3755","authenticated-orcid":false,"given":"Ning","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyu","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruobing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingjing","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.cor.2026.107434_b0005","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/j.ejor.2020.05.029","article-title":"A branch-and-cut algorithm for the restricted block relocation problem","volume":"287","author":"Bacci","year":"2020","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107434_b0010","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.ejor.2013.10.054","article-title":"Storage yard operations in container terminals: literature overview, trends, and research directions","volume":"235","author":"Carlo","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107434_b0015","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-642-01009-5_4","article-title":"A new binary description of the blocks relocation problem and benefits in a look ahead heuristic","volume":"5482","author":"Caserta","year":"2009","journal-title":"Evolutionary Computation in Combinatorial Optimization"},{"issue":"1","key":"10.1016\/j.cor.2026.107434_b0020","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.ejor.2011.12.039","article-title":"A mathematical formulation and complexity considerations for the blocks relocation problem","volume":"219","author":"Caserta","year":"2012","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2026.107434_b0025","first-page":"2722","article-title":"Notes on mathematical formulation and complexity considerations for blocks relocation problem","volume":"22","author":"Eskandari","year":"2015","journal-title":"Sci. Iran."},{"issue":"17\u201318","key":"10.1016\/j.cor.2026.107434_b0030","doi-asserted-by":"crossref","first-page":"6408","DOI":"10.1016\/j.eswa.2015.04.021","article-title":"An exact approach for the blocks relocation problem","volume":"42","author":"Exp\u00f3sito-Izquierdo","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107434_b0035","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-319-64286-4_1","article-title":"A review of soft computing techniques in maritime logistics and its related fields","volume":"360","author":"Exp\u00f3sito-Izquierdo","year":"2018","journal-title":"Stud. Fuzziness Soft Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107434_b0040","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.cor.2011.04.004","article-title":"A tree search procedure for the container relocation problem","volume":"39","author":"Forster","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107434_b0045","unstructured":"Flexport Glossary, n.d. Rolled Cargo\u00ae. https:\/\/www.flexport.com\/glossary\/rolled-cargo\/ (accessed 10 September 2025)."},{"issue":"2","key":"10.1016\/j.cor.2026.107434_b0050","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.ejor.2017.11.053","article-title":"A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations","volume":"267","author":"Galle","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107434_b0055","unstructured":"Gupta, S., 2022. Container Rollovers: Understanding the Causes and Ways to Minimize Rollovers. https:\/\/www.portcast.io\/blog\/container-rollovers-understanding-the-causes-and-ways-to-minimize-rollovers (accessed 10 September 2025)."},{"key":"10.1016\/j.cor.2026.107434_b0060","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tre.2015.05.004","article-title":"Optimization of loading sequence and rehandling strategy for multi-quay crane operations in container terminals","volume":"80","author":"Ji","year":"2015","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"issue":"3","key":"10.1016\/j.cor.2026.107434_b0065","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/j.ejor.2014.07.038","article-title":"Solving the container relocation problem by an improved greedy look-ahead heuristic","volume":"240","author":"Jin","year":"2014","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107434_b0070","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1007\/s10696-018-9320-3","article-title":"A GRASP approach for solving the blocks relocation problem with stowage plan","volume":"31","author":"Jovanovic","year":"2019","journal-title":"Flex. Serv. Manuf. J."},{"issue":"1","key":"10.1016\/j.cor.2026.107434_b0075","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.cie.2014.06.010","article-title":"A chain heuristic for the blocks relocation problem","volume":"75","author":"Jovanovic","year":"2014","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"10.1016\/j.cor.2026.107434_b0080","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1016\/j.cor.2004.08.005","article-title":"A heuristic rule for relocating blocks","volume":"33","author":"Kim","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107434_b0085","first-page":"1","article-title":"A new modeling approach for the unrestricted block relocation problem","author":"Kimms","year":"2023","journal-title":"OR Spectr."},{"key":"10.1016\/j.cor.2026.107434_b0090","first-page":"1","article-title":"A general model formulation applicable to premarshalling, block relocation and stack loading problems","author":"Kimms","year":"2025","journal-title":"OR Spectr."},{"issue":"6","key":"10.1016\/j.cor.2026.107434_b0095","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1016\/j.cor.2009.10.005","article-title":"A heuristic for retrieving containers from a yard","volume":"37","author":"Lee","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107434_b0100","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.trc.2015.01.024","article-title":"The container retrieval problem with respect to relocation","volume":"52","author":"Lin","year":"2015","journal-title":"Transp. Res. Part C Emerging Technol."},{"key":"10.1016\/j.cor.2026.107434_b0105","doi-asserted-by":"crossref","first-page":"18822","DOI":"10.1109\/TITS.2022.3151069","article-title":"Valid inequality and variable fixation for unrestricted block relocation problems","volume":"23","author":"Liu","year":"2022","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"10.1016\/j.cor.2026.107434_b0110","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1080\/23307706.2022.2071775","article-title":"An integer programming formulation and iterative scheme algorithm for the block relocation problem","volume":"10","author":"Liu","year":"2023","journal-title":"J. Control Decis."},{"issue":"1","key":"10.1016\/j.cor.2026.107434_b0115","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.ejor.2013.05.037","article-title":"A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem","volume":"231","author":"Petering","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107434_b0120","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.cor.2018.06.021","article-title":"An exact algorithm for the blocks relocation problem with new lower bounds","volume":"99","author":"Quispe","year":"2018","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107434_b0125","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.ejor.2019.06.014","article-title":"An exact algorithm for the block relocation problem with a stowage plan","volume":"279","author":"Tanaka","year":"2019","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107434_b0130","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.ejor.2021.03.062","article-title":"An exact approach to the restricted block relocation problem based on a new integer programming formulation","volume":"296","author":"Tanaka","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107434_b0135","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.tre.2017.04.010","article-title":"Optimizing container relocation operations at container yards with beam search","volume":"103","author":"Ting","year":"2017","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"10.1016\/j.cor.2026.107434_b0140","unstructured":"United Nations Conference on Trade and Development (UNCTAD), 2024. Review of Maritime Transport. https:\/\/unctad.org (accessed 10 September 2025)."},{"issue":"8","key":"10.1016\/j.cor.2026.107434_b0145","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1002\/nav.20373","article-title":"The assignment of storage locations to containers for a container stack","volume":"56","author":"Wan","year":"2009","journal-title":"Nav. Res. Logist."},{"issue":"2","key":"10.1016\/j.cor.2026.107434_b0150","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.ejor.2015.03.032","article-title":"An improved mathematical formulation for the blocks relocation problem","volume":"245","author":"Zehendner","year":"2015","journal-title":"Eur. J. Oper. Res."},{"issue":"24","key":"10.1016\/j.cor.2026.107434_b0155","doi-asserted-by":"crossref","first-page":"7159","DOI":"10.1080\/00207543.2014.965358","article-title":"A branch and price approach for the container relocation problem","volume":"52","author":"Zehendner","year":"2014","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107434_b0160","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/nav.21843","article-title":"Mathematical formulation and heuristic algorithm for the block relocation and loading problem","volume":"66","author":"Zhu","year":"2019","journal-title":"Nav. Res. Logist."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000523?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000523?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T14:31:45Z","timestamp":1774881105000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826000523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":32,"alternative-id":["S0305054826000523"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107434","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimization of partially ordered container relocation problem with rolled containers","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107434","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107434"}}