{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:24:49Z","timestamp":1774373089626,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319448954","type":"print"},{"value":"9783319448961","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44896-1_9","type":"book-chapter","created":{"date-parts":[[2016,8,13]],"date-time":"2016-08-13T14:26:46Z","timestamp":1471098406000},"page":"131-145","source":"Crossref","is-referenced-by-count":11,"title":["Solving the Robust Container Pre-Marshalling Problem"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Tierney","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,14]]},"reference":[{"issue":"3","key":"9_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.: A tree search procedure for the container pre-marshalling problem. Eur. J. Oper. Res. 217(3), 531\u2013540 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR2","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-1-4419-8408-1_13","volume-title":"Handbook of Terminal Planning","author":"M Caserta","year":"2011","unstructured":"Caserta, M., Schwarze, S., Vo\u00df, S.: Container rehandling at maritime container terminals. In: B\u00f6se, J.W. (ed.) Handbook of Terminal Planning. Operations Research\/Computer Science Interfaces Series, vol. 49, pp. 247\u2013269. Springer, New York (2011)"},{"issue":"1","key":"9_CR3","doi-asserted-by":"crossref","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":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1007\/978-3-642-01129-0_89","volume-title":"Applications of Evolutionary Computing","author":"M Caserta","year":"2009","unstructured":"Caserta, M., Vo\u00df, S.: A corridor method-based algorithm for the pre-marshalling problem. In: Giacobini, M., et al. (eds.) EvoWorkshops 2009. LNCS, vol. 5484, pp. 788\u2013797. Springer, Heidelberg (2009)"},{"issue":"9","key":"9_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.: Pre-marshalling problem: heuristic solution method and instances generator. Expert Syst. Appl. 39(9), 8337\u20138349 (2012)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"9_CR6","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s00291-006-0054-3","volume":"28","author":"M Grunow","year":"2006","unstructured":"Grunow, M., G\u00fcnther, H.-O., Lehmann, M.: Strategies for dispatching AGVs at automated seaport container terminals. OR Spectr. 28(4), 587\u2013610 (2006)","journal-title":"OR Spectr."},{"issue":"2\u20133","key":"9_CR7","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.S.: On the complexity of blocks-world planning. Artif. Intell. 56(2\u20133), 223\u2013254 (1992)","journal-title":"Artif. Intell."},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.cor.2016.05.011","volume":"75","author":"A Hottung","year":"2016","unstructured":"Hottung, A., Tierney, K.: A biased random-key genetic algorithm for the container pre-marshalling problem. Comput. Oper. Res. 75, 83\u2013102 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9_CR9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.cie.2011.08.010","volume":"62","author":"S-H Huang","year":"2012","unstructured":"Huang, S.-H., Lin, T.-H.: Heuristic algorithms for container pre-marshalling problems. Comput. Indus. Eng. 62(1), 13\u201320 (2012)","journal-title":"Comput. Indus. Eng."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Jovanovic, R., Tuba, M., Vo\u00df, S.: A multi-heuristic approach for solving the pre-marshalling problem. Cent. Eur. J. Oper. Res. (2015)","DOI":"10.1007\/s10100-015-0410-y"},{"issue":"3","key":"9_CR11","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1016\/j.ejor.2016.01.055","volume":"252","author":"D Ku","year":"2016","unstructured":"Ku, D., Arthanari, T.S.: Container relocation problem with time windows for container departure. Eur. J. Oper. Res. 252(3), 1031\u20131039 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9_CR12","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, S.L.: A neighborhood search heuristic for pre-marshalling export containers. Eur. J. Oper. Res. 196(2), 468\u2013475 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"9_CR13","doi-asserted-by":"crossref","first-page":"3295","DOI":"10.1016\/j.cor.2005.12.006","volume":"34","author":"Y Lee","year":"2007","unstructured":"Lee, Y., Hsu, N.Y.: An optimization model for the container pre-marshalling problem. Comput. Oper. Res. 34(11), 3295\u20133313 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9_CR14","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.: Loading, unloading and premarshalling of stacks in storage areas: survey and classification. Eur. J. Oper. Res. 239(2), 297\u2013312 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.R.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007)"},{"key":"9_CR16","unstructured":"Prud\u2019homme, C., Fages, J., Lorca, X.: Choco Documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S (2015)"},{"key":"9_CR17","unstructured":"Rendl, A., Prandtstetter, M.: Constraint models for the container pre-marshaling problem. In: Katsirelos, G., Quimper, C.-G. (eds.) ModRef 2013: 12th International Workshop on Constraint Modelling and Reformulation, pp. 44\u201356 (2013)"},{"key":"9_CR18","volume-title":"Artificial Intelligence: A Modern Approach","author":"SJ Russell","year":"2010","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall, Upper Saddle River (2010)"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-319-19084-6_2","volume-title":"Learning and Intelligent Optimization","author":"K Tierney","year":"2015","unstructured":"Tierney, K., Malitsky, Y.: An algorithm selection benchmark of the container pre-marshalling problem. In: Jourdan, L., Dhaenens, C., Marmion, M.-E. (eds.) LION 9 2015. LNCS, vol. 8994, pp. 17\u201322. Springer, Heidelberg (2015)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Tierney, K., Pacino, D., Vo\u00df, S.: Solving the pre-marshalling problem to optimality with A* and IDA*. Flexible Services and Manufacturing (2016, in Press)","DOI":"10.1007\/s10696-016-9246-6"},{"issue":"2","key":"9_CR21","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.ejor.2013.07.007","volume":"235","author":"K Tierney","year":"2014","unstructured":"Tierney, K., Vo\u00df, S., Stahlbock, R.: A mathematical model of inter-terminal transportation. Eur. J. Oper. Res. 235(2), 448\u2013460 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-319-19084-6_17","volume-title":"Learning and Intelligent Optimization","author":"A Tus","year":"2015","unstructured":"Tus, A., Rendl, A., Raidl, G.R.: Metaheuristics for the two-dimensional container pre-marshalling problem. In: Jourdan, L., Dhaenens, C., Marmion, M.-E. (eds.) LION 9 2015. LNCS, vol. 8994, pp. 186\u2013201. Springer, Heidelberg (2015)"},{"key":"9_CR23","unstructured":"UNCTAD: United Nations Conference on Trade and Development (UNCTAD), Review of maritime transport (2015)"},{"issue":"3","key":"9_CR24","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1057\/palgrave.mel.9100182","volume":"9","author":"B Vernimmen","year":"2007","unstructured":"Vernimmen, B., Dullaert, W., Engelen, S.: Schedule unreliability in liner shipping: origins and consequences for the hinterland supply chain. Marit. Econ. Logistics 9(3), 193\u2013213 (2007)","journal-title":"Marit. Econ. Logistics"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-642-33587-7_6","volume-title":"Computational Logistics","author":"S Vo\u00df","year":"2012","unstructured":"Vo\u00df, S.: Extended mis-overlay calculation for pre-marshalling containers. In: Hu, H., Shi, X., Stahlbock, R., Vo\u00df, S. (eds.) ICCL 2012. LNCS, vol. 7555, pp. 86\u201391. Springer, Heidelberg (2012)"},{"key":"9_CR26","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.omega.2014.12.002","volume":"53","author":"N Wang","year":"2015","unstructured":"Wang, N., Jin, B., Lim, A.: Target-guided algorithms for the container pre-marshalling problem. Omega 53, 67\u201377 (2015)","journal-title":"Omega"},{"issue":"5","key":"9_CR27","first-page":"509","volume":"22","author":"R Zhang","year":"2015","unstructured":"Zhang, R., Jiang, Z., Yun, W.: Stack pre-marshalling problem: a heuristic-guided branch-and bound algorithm. Int. J. Ind. Eng. Theor. Appl. Pract. 22(5), 509\u2013523 (2015)","journal-title":"Int. J. Ind. Eng. Theor. Appl. Pract."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44896-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T20:41:06Z","timestamp":1498336866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44896-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319448954","9783319448961"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44896-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}