{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T11:16:35Z","timestamp":1775128595625,"version":"3.50.1"},"publisher-location":"Cham","reference-count":11,"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_2","type":"book-chapter","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T14:43:01Z","timestamp":1432824181000},"page":"17-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["An Algorithm Selection Benchmark of the Container Pre-marshalling Problem"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Tierney","sequence":"first","affiliation":[]},{"given":"Yuri","family":"Malitsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"issue":"3","key":"2_CR1","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."},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.ejor.2013.10.054","volume":"235","author":"H Carlo","year":"2014","unstructured":"Carlo, H., Vis, I., Roodbergen, K.: Storage yard operations in container terminals: literature overview, trends, and research directions. Eur. J. Oper. Res. 235(2), 412\u2013430 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR3","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)"},{"key":"2_CR4","doi-asserted-by":"crossref","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)","DOI":"10.1016\/j.eswa.2012.01.187"},{"issue":"3","key":"2_CR5","first-page":"48","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Mag. 35(3), 48\u201360 (2014)","journal-title":"AI Mag."},{"issue":"11","key":"2_CR6","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.: 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":"2_CR7","doi-asserted-by":"publisher","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":"2_CR8","unstructured":"Malitsky, Y., O\u2019Sullivan, B.: Latent features for algorithm selection. In: Symposium on Combinatorial Search (2014)"},{"key":"2_CR9","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm portfolios based on cost-sensitive hierarchical clustering. In: IJCAI (2013)"},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-007-0100-9","volume":"30","author":"R Stahlbock","year":"2008","unstructured":"Stahlbock, R., Vo\u00df, S.: Operations research at container terminals: a literature update. OR Spectrum 30(1), 1\u201352 (2008)","journal-title":"OR Spectrum"},{"key":"2_CR11","unstructured":"Tierney, K., Pacino, D., Vo\u00df, S.: Solving the pre-marshalling problem to optimality with A* and IDA*. Technical report WP#1401, DS&OR Lab, University of Paderborn (2014)"}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:17:22Z","timestamp":1676942242000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19084-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319190839","9783319190846"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19084-6_2","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"}}]}}