{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T01:50:12Z","timestamp":1777513812810,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,7,26]],"date-time":"2015-07-26T00:00:00Z","timestamp":1437868800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10100-015-0410-y","type":"journal-article","created":{"date-parts":[[2015,7,25]],"date-time":"2015-07-25T06:00:03Z","timestamp":1437804003000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":45,"title":["A multi-heuristic approach for solving the pre-marshalling problem"],"prefix":"10.1007","volume":"25","author":[{"given":"Raka","family":"Jovanovic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milan","family":"Tuba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,26]]},"reference":[{"issue":"3","key":"410_CR1","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/j.ejor.2011.10.005","volume":"217","author":"A Bortfeldt","year":"2012","unstructured":"Bortfeldt A, Forster F (2012) A tree search procedure for the container pre-marshalling problem. Eur J Oper Res 217(3):531\u2013540","journal-title":"Eur J Oper Res"},{"key":"410_CR2","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1007\/978-3-642-01129-0_89","volume":"5484","author":"M Caserta","year":"2009","unstructured":"Caserta M, Vo\u00df S (2009) A corridor method-based algorithm for the pre-marshalling problem. Lect Notes Comput Sci 5484:788\u2013797","journal-title":"Lect Notes Comput Sci"},{"key":"410_CR3","first-page":"247","volume-title":"Handbook of terminal planning, operations research\/computer science interfaces series","author":"M Caserta","year":"2011","unstructured":"Caserta M, Schwarze S, Vo\u00df S (2011a) Container rehandling at maritime container terminals. In: B\u00f6se J (ed) Handbook of terminal planning, operations research\/computer science interfaces series, vol 49. Springer, New York, pp 247\u2013269"},{"key":"410_CR4","doi-asserted-by":"crossref","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 (2011b) Applying the corridor method to a blocks relocation problem. OR Spectrum 33:915\u2013929","journal-title":"OR Spectrum"},{"issue":"9","key":"410_CR5","doi-asserted-by":"crossref","first-page":"8337","DOI":"10.1016\/j.eswa.2012.01.187","volume":"39","author":"C Exp\u00f3sito-Izquierdo","year":"2012","unstructured":"Exp\u00f3sito-Izquierdo C, Meli\u00e1n-Batista B, Moreno-Vega M (2012) Pre-marshalling problem: heuristic solution method and instances generator. Expert Syst Appl 39(9):8337\u20138349","journal-title":"Expert Syst Appl"},{"issue":"23","key":"410_CR6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0004-3702(92)90028-V","volume":"56","author":"N Gupta","year":"1992","unstructured":"Gupta N, Nau D (1992) On the complexity of blocks-world planning. Artif Intell 56(23):223\u2013254","journal-title":"Artif Intell"},{"issue":"1","key":"410_CR7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.cie.2011.08.010","volume":"62","author":"SH Huang","year":"2012","unstructured":"Huang SH, Lin TH (2012) Heuristic algorithms for container pre-marshalling problems. Comput Ind Eng 62(1):13\u201320","journal-title":"Comput Ind Eng"},{"issue":"1","key":"410_CR8","doi-asserted-by":"crossref","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. Comput Ind Eng 75(1):79\u201386","journal-title":"Comput Ind Eng"},{"issue":"4","key":"410_CR9","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1016\/j.cor.2004.08.005","volume":"33","author":"K Kim","year":"2006","unstructured":"Kim K, Hong GP (2006) A heuristic rule for relocating blocks. Comput Oper Res 33(4):940\u2013954","journal-title":"Comput Oper Res"},{"key":"410_CR10","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/S0360-8352(97)00024-7","volume":"32","author":"KH Kim","year":"1997","unstructured":"Kim KH (1997) Evaluation of the number of rehandles in container yards. Comput Ind Eng 32:701\u2013711","journal-title":"Comput Ind Eng"},{"issue":"2","key":"410_CR11","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/j.ejor.2008.03.011","volume":"196","author":"Y Lee","year":"2009","unstructured":"Lee Y, Chao SL (2009) A neighborhood search heuristic for pre-marshalling export containers. Eur J Oper Res 196(2):468\u2013475","journal-title":"Eur J Oper Res"},{"issue":"6","key":"410_CR12","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1016\/j.cor.2009.10.005","volume":"37","author":"Y Lee","year":"2010","unstructured":"Lee Y, Lee YJ (2010) A heuristic for retrieving containers from a yard. Comput Oper Res 37(6):1139\u20131147","journal-title":"Comput Oper Res"},{"issue":"2","key":"410_CR13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.ejor.2014.03.011","volume":"239","author":"J Lehnfeld","year":"2014","unstructured":"Lehnfeld J, Knust S (2014) Loading, unloading and premarshalling of stacks in storage areas: survey and classification. Eur J Oper Res 239(2):297\u2013312","journal-title":"Eur J Oper Res"},{"issue":"1","key":"410_CR14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/inte.1040.0120","volume":"35","author":"K Murty","year":"2005","unstructured":"Murty K, Wan YW, Liu J, Tseng M, Leung E, Lai KK, Chiu H (2005) Hongkong international terminals gains elastic capacity using a data-intensive decision support system. Interfaces 35(1):61\u201375","journal-title":"Interfaces"},{"key":"410_CR15","unstructured":"Rendl A, Prandtstetter M (2013) Constraint models for the container pre-marshaling problem. In: Katsirelos G, Quimper CG (eds) ModRef 2013: 12th international workshop on constraint modelling and reformulation, pp 44\u201356"},{"key":"410_CR16","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF00127358","volume":"2","author":"A Scholl","year":"1996","unstructured":"Scholl A, Vo\u00df S (1996) Simple assembly line balancing\u2014heuristic approaches. J Heuristics 2:217\u2013244","journal-title":"J Heuristics"},{"issue":"1","key":"410_CR17","doi-asserted-by":"crossref","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 (2004) Container terminal operations and operations research\u2014a classification and literature review. OR Spectrum 26(1):3\u201349","journal-title":"OR Spectrum"},{"key":"410_CR18","unstructured":"Tierney K, Pacino D, Vo\u00df S (2013) Solving the pre-marshalling problem to optimality with A* and IDA*. Tech. Rep. Technical University of Denmark"},{"issue":"3","key":"410_CR19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s11066-014-9088-x","volume":"15","author":"NK Tran","year":"2014","unstructured":"Tran NK, Haasis H-D (2014) Empirical analysis of the container liner shipping network on the East-West corridor (1995\u20132011). Netnomics 15(3):121\u2013153","journal-title":"Netnomics"},{"issue":"4","key":"410_CR20","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1002\/atr.1193","volume":"46","author":"T \u00dcnl\u00fcyurt","year":"2012","unstructured":"\u00dcnl\u00fcyurt T, Aydin C (2012) Improved rehandling strategies for the container retrieval process. J Adv Transp 46(4):378\u2013393","journal-title":"J Adv Transp"},{"key":"410_CR21","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-642-33587-7_6","volume":"7555","author":"S Vo\u00df","year":"2012","unstructured":"Vo\u00df S (2012) Extended mis-overlay calculation for pre-marshalling containers. Lect Notes Comput Sci 7555:86\u201391","journal-title":"Lect Notes Comput Sci"},{"key":"410_CR22","unstructured":"Wu KC, Ting CJ (2010) A beam search algorithm for minimizing reshuffle operations at container yards. In: Proceedings of the 2010 international conference on logistics and maritime systems. Busan, Korea"},{"key":"410_CR23","unstructured":"Zhang C (2000) Resource planning in container storage yard. PhD thesis, Department of Industrial Engineering, The Hong Kong University of Science and Technology"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-015-0410-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-015-0410-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-015-0410-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-015-0410-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:33Z","timestamp":1559108973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-015-0410-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,26]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["410"],"URL":"https:\/\/doi.org\/10.1007\/s10100-015-0410-y","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,26]]}}}