{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T11:16:31Z","timestamp":1775128591473,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319190839","type":"print"},{"value":"9783319190846","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-19084-6_17","type":"book-chapter","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T14:43:01Z","timestamp":1432824181000},"page":"186-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem"],"prefix":"10.1007","author":[{"given":"Alan","family":"Tus","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Rendl","sequence":"additional","affiliation":[]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"key":"17_CR1","unstructured":"Tus, A.: Heuristic solution approaches for the two dimensional pre-marshalling problem. Master\u2019s thesis, Vienna University of Technology, Vienna, Austria (2014). https:\/\/www.ads.tuwien.ac.at\/publications\/bib\/pdf\/tus_14.pdf"},{"key":"17_CR2","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","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":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.ejor.2013.10.054","volume":"235","author":"HJ Carlo","year":"2014","unstructured":"Carlo, H.J., Vis, I.F., Roodbergen, K.J.: Storage yard operations in container terminals: literature overview, trends, and research directions. Eur. J. Oper. Res. 235(2), 412\u2013430 (2014). Maritime Logistics","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"17_CR4","doi-asserted-by":"publisher","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. Compu. Oper. Res. 34(11), 3295\u20133313 (2007)","journal-title":"Compu. Oper. Res."},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Brabazon, A., Cagnoni, S., Di Caro, G.A., Ek\u00e1rt, A., Esparcia-Alc\u00e1zar, A.I., Farooq, M., Fink, A., Machado, P. (eds.) EvoWorkshops 2009. LNCS, vol. 5484, pp. 788\u2013797. Springer, Heidelberg (2009)"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","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":"9","key":"17_CR7","doi-asserted-by":"publisher","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":"3","key":"17_CR8","doi-asserted-by":"publisher","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":"17_CR9","unstructured":"Prandtstetter, M.: A dynamic programming based branch-and-bound algorithm for the container pre-marshalling problem. Technical report, AIT Austrian Institute of Technology (2013) submitted to European Journal of Operational Research. http:\/\/matthias.prandtstetter.at\/papers\/pre2013.pdf"},{"key":"17_CR10","unstructured":"Rendl, A., Prandtstetter, M.: Constraint models for the container pre-marshalling problem. In: Proceedings of the Twelfth International Workshop on Constraint Modelling and Reformulation. ModRef 2013, PP. 44\u201356 (2013)"},{"key":"17_CR11","unstructured":"Tierney, K., Pacino, D., Vo\u00df, S.: Solving the pre-marshalling problem to optimality with a* and ida*. In: Conference of the International Federation of Operational Research Societies (2014)"},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","volume":"34","author":"C Duin","year":"1999","unstructured":"Duin, C., Vo\u00df, S.: The pilot method: a strategy for heuristic repetition with application to the steiner problem in graphs. Networks 34(3), 181\u2013191 (1999)","journal-title":"Networks"},{"issue":"9","key":"17_CR13","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: Max-min ant system. Future Gener. Comput. Syst. 16(9), 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."},{"key":"17_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. Bradford Company, Scituate (2004)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19084-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:17:18Z","timestamp":1676942238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19084-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319190839","9783319190846"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19084-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"29 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}