{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T11:16:29Z","timestamp":1775128589973,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642011283","type":"print"},{"value":"9783642011290","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-01129-0_89","type":"book-chapter","created":{"date-parts":[[2009,4,10]],"date-time":"2009-04-10T05:05:44Z","timestamp":1239339944000},"page":"788-797","source":"Crossref","is-referenced-by-count":44,"title":["A Corridor Method-Based Algorithm for the Pre-marshalling Problem"],"prefix":"10.1007","author":[{"given":"Marco","family":"Caserta","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"89_CR1","first-page":"551","volume":"35","author":"M. Sniedovich","year":"2006","unstructured":"Sniedovich, M., Vo\u00df, S.: The Corridor Method: a Dynamic Programming Inspired Metaheuristic. Control and Cybernetics\u00a035(3), 551\u2013578 (2006)","journal-title":"Control and Cybernetics"},{"key":"89_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.disopt.2005.10.002","volume":"3","author":"\u00d6. Ergun","year":"2006","unstructured":"Ergun, \u00d6., Orlin, J.B.: A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem. Discrete Optimization\u00a03, 78\u201385 (2006)","journal-title":"Discrete Optimization"},{"key":"89_CR3","unstructured":"Potts, C., van de Velde, S.: Dynasearch - iterative local improvement by dynamic programming. Technical report, University of Twente (1995)"},{"key":"89_CR4","doi-asserted-by":"publisher","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.: Container terminal operations and operations research\u00a0\u2013\u00a0a classification and literature review. OR Spectrum\u00a026, 3\u201349 (2004)","journal-title":"OR Spectrum"},{"key":"89_CR5","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\u00a030, 1\u201352 (2008)","journal-title":"OR Spectrum"},{"key":"89_CR6","doi-asserted-by":"crossref","unstructured":"Lee, Y., Chao, S.-L.: A Neighborhood Search Heuristic for Pre-marshalling Export Containers. European Journal of Operational Research (2008), doi:10.1016\/j.ejor.2008.03.011","DOI":"10.1016\/j.ejor.2008.03.011"},{"key":"89_CR7","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. Computers & Operations Research\u00a034, 3295\u20133313 (2007)","journal-title":"Computers & Operations Research"},{"key":"89_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"J.P. Hart","year":"1987","unstructured":"Hart, J.P., Shogan, A.W.: Semi-greedy heuristics: An empirical study. Operations Research Letters\u00a06, 107\u2013114 (1987)","journal-title":"Operations Research Letters"},{"key":"89_CR9","unstructured":"Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP. Technical report, AT&T Labs Research (2004)"},{"key":"89_CR10","first-page":"58","volume-title":"Essays and surveys in metaheuristics","author":"S. Binato","year":"2002","unstructured":"Binato, S., Hery, W.J., Loewenstern, D., Resende, M.G.C.: A greedy randomized adaptive search procedure for job shop scheduling. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and surveys in metaheuristics, pp. 58\u201379. Kluwer Academic Publishers, Boston (2002)"},{"key":"89_CR11","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M. Prais","year":"2000","unstructured":"Prais, M., Ribeiro, C.C.: Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing\u00a012, 164\u2013176 (2000)","journal-title":"INFORMS Journal on Computing"},{"key":"89_CR12","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"89_CR13","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.cor.2004.08.005","volume":"33","author":"K.H. Kim","year":"2006","unstructured":"Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Computers & Operations Research\u00a033, 940\u2013954 (2006)","journal-title":"Computers & Operations Research"},{"key":"89_CR14","unstructured":"Caserta, M., Vo\u00df, S., Sniedovich, M.: An algorithm for the blocks relocation problem. Working Paper, Institute of Information Systems, University of Hamburg (2008)"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01129-0_89","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T08:17:30Z","timestamp":1551946650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01129-0_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642011283","9783642011290"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01129-0_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}