{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:40:36Z","timestamp":1772808036165,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642291234","type":"print"},{"value":"9783642291241","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29124-1_5","type":"book-chapter","created":{"date-parts":[[2012,3,23]],"date-time":"2012-03-23T13:24:42Z","timestamp":1332509082000},"page":"49-62","source":"Crossref","is-referenced-by-count":11,"title":["Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem"],"prefix":"10.1007","author":[{"given":"Rudinei Martins","family":"de Oliveira","sequence":"first","affiliation":[]},{"given":"Geraldo Regis","family":"Mauri","sequence":"additional","affiliation":[]},{"given":"Luiz Antonio Nogueira","family":"Lorena","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.cie.2010.12.018","volume":"60","author":"V.H. Barros","year":"2011","unstructured":"Barros, V.H., Costa, T.S., Oliveira, A.C.M., Lorena, L.A.N.: Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Computers & Industrial Engineering\u00a060, 606\u2013613 (2011)","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.ejor.2009.05.031","volume":"202","author":"C. Bierwirth","year":"2010","unstructured":"Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research\u00a0202(3), 615\u2013627 (2010)","journal-title":"European Journal of Operational Research"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.tre.2010.11.016","volume":"47","author":"K. Buhrkal","year":"2011","unstructured":"Buhrkal, K., Zuglian, S., Ropke, S., Larsen, J., Lusby, R.: Models for the discrete berth allocation problem: a computational comparison. Transportation Research Part E: Logistics and Transportation Review\u00a047, 461\u2013473 (2011)","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"5","key":"5_CR4","doi-asserted-by":"publisher","first-page":"5013","DOI":"10.1016\/j.eswa.2010.09.149","volume":"38","author":"A.A. Chaves","year":"2010","unstructured":"Chaves, A.A., Lorena, L.A.N.: Hybrid evolutionary algorithm for the capacitated centered clustering problem. Expert Systems with Applications\u00a038(5), 5013\u20135018 (2010)","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10479-008-0493-0","volume":"180","author":"C.Y. Cheong","year":"2010","unstructured":"Cheong, C.Y., Tan, K.C., Liu, D.K., Lin, C.J.: Multi-objective and prioritized berth allocation in container ports. Annals of Operations Research\u00a0180(1), 63\u2013103 (2010)","journal-title":"Annals of Operations Research"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1287\/trsc.1050.0120","volume":"39","author":"J.F. Cordeau","year":"2005","unstructured":"Cordeau, J.F., Laporte, G., Legato, P., Moccia, L.: Models and tabu search heuristics for the berth allocation problem. Transportation Science\u00a039, 526\u2013538 (2005)","journal-title":"Transportation Science"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-6377(02)00147-5","volume":"30","author":"Y. Guan","year":"2002","unstructured":"Guan, Y., Xiao, W.Q., Cheung, R., Li, C.L.: A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis. Operations Research Letters\u00a030, 343\u2013350 (2002)","journal-title":"Operations Research Letters"},{"issue":"2","key":"5_CR8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"26","author":"R.W. Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. Bell System Technical Journal\u00a026(2), 147\u2013160 (1950)","journal-title":"Bell System Technical Journal"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.ejor.2006.12.057","volume":"191","author":"P. Hansen","year":"2008","unstructured":"Hansen, P., Oguz, C., Mladenovic, N.: Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research\u00a0191, 636\u2013649 (2008)","journal-title":"European Journal of Operational Research"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/S0191-2615(99)00057-0","volume":"35","author":"A. Imai","year":"2001","unstructured":"Imai, A., Nishimura, E., Papadimitriou, S.: The dynamic berth allocation problem for a container port. Transportation Research Part B: Methodological\u00a035, 401\u2013417 (2001)","journal-title":"Transportation Research Part B: Methodological"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/S0191-2615(02)00023-1","volume":"37","author":"A. Imai","year":"2003","unstructured":"Imai, A., Nishimura, E., Papadimitriou, S.: Berth allocation with service priority. Transportation Research Part B: Methodological\u00a037, 437\u2013457 (2003)","journal-title":"Transportation Research Part B: Methodological"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.trb.2004.04.004","volume":"39","author":"A. Imai","year":"2005","unstructured":"Imai, A., Sun, X., Nishimura, E., Papadimitriou, S.: Berth allocation in a container port: using a continuous location space approach. Transportation Research Part B\u00a039(3), 199\u2013221 (2005)","journal-title":"Transportation Research Part B"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.tre.2007.03.003","volume":"44","author":"A. Imai","year":"2008","unstructured":"Imai, A., Chen, H.C., Nishimura, E., Papadimitriou, S.: The simultaneous berth and quay crane allocation problem. Transportation Research Part E\u00a044, 900\u2013920 (2008)","journal-title":"Transportation Research Part E"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/S0191-2615(02)00027-9","volume":"37","author":"K. Kim","year":"2003","unstructured":"Kim, K., Moon, K.: Berth scheduling by simulated annealing. Transportation Research B\u00a037, 541\u2013560 (2003)","journal-title":"Transportation Research B"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1016\/j.tre.2010.01.009","volume":"46","author":"D.H. Lee","year":"2010","unstructured":"Lee, D.H., Chen, J.H., Cao, J.X.: The continuous berth allocation problem: a greedy randomized adaptive search solution. Transportation Research Part E\u00a046, 1017\u20131029 (2010)","journal-title":"Transportation Research Part E"},{"key":"5_CR16","first-page":"433","volume":"30","author":"C.L. Li","year":"1998","unstructured":"Li, C.L., Cai, X., Lee, C.Y.: Scheduling with multiple-job-on-one-processor pattern. IIE Transactions\u00a030, 433\u2013445 (1998)","journal-title":"IIE Transactions"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0167-6377(98)00010-8","volume":"22","author":"A. Lim","year":"1998","unstructured":"Lim, A.: The berth scheduling problem. Operations Research Letters\u00a022, 105\u2013110 (1998)","journal-title":"Operations Research Letters"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-78604-7_10","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"G.R. Mauri","year":"2008","unstructured":"Mauri, G.R., Oliveira, A.C.M., Lorena, L.A.N.: A Hybrid Column Generation Approach for the Berth Allocation Problem. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol.\u00a04972, pp. 110\u2013122. Springer, Heidelberg (2008)"},{"key":"5_CR19","unstructured":"Mauri, G.R., Andrade, L.N., Lorena, L.A.N.: A memetic algorithm for a continuous case of the berth allocation problem. In: ECTA 2011 - International Conference on Evolutionary Computation Theory and Applications, Paris, France (2011)"},{"issue":"2","key":"5_CR20","first-page":"265","volume":"41","author":"M.F. Monaco","year":"2007","unstructured":"Monaco, M.F., Sammarra, M.: The berth allocation problem: a strong formulation solved by a lagrangean approach. Transportation Research Part B\u00a041(2), 265\u2013280 (2007)","journal-title":"Transportation Research Part B"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/S0377-2217(00)00128-4","volume":"131","author":"E. Nishimura","year":"2001","unstructured":"Nishimura, E., Imai, A., Papadimitriou, S.: Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research\u00a0131, 282\u2013292 (2001)","journal-title":"European Journal of Operational Research"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Oliveira, A.C.M., Lorena, L.A.N.: Hybrid evolutionary algorithms and clustering search. SCI, vol.\u00a075, pp. 77\u201399 (2007)","DOI":"10.1007\/978-3-540-73297-6_4"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-002-0109-z","volume":"25","author":"Y.M. Park","year":"2003","unstructured":"Park, Y.M., Kim, K.H.: A scheduling method for Berth and Quay cranes. OR Spectrum\u00a025, 1\u201323 (2003)","journal-title":"OR Spectrum"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/s00773-010-0095-9","volume":"15","author":"S.R. Seyedalizadeh Ganji","year":"2010","unstructured":"Seyedalizadeh Ganji, S.R., Babazadeh, A., Arabshahi, N.: Analysis of the continuous berth allocation problem in container ports using a genetic algorithm. Journal of Marine Science and Technology\u00a015, 408\u2013416 (2010)","journal-title":"Journal of Marine Science and Technology"},{"key":"5_CR25","unstructured":"Thurman, K.P.: Optimal ship berthing plans. Dissertation (Masters of Science in Operations Research) - Naval Postgraduate School, Monterey, California - EUA (1989)"},{"key":"5_CR26","unstructured":"UNCTAD: Review of maritime transport. United Nations conference on trade and development (2010)"},{"issue":"1","key":"5_CR27","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ejor.2011.07.012","volume":"216","author":"D. Xu","year":"2012","unstructured":"Xu, D., Li, C.L., Leung, J.Y.: Berth allocation with time-dependent physical limitations on vessels. European Journal of Operational Research\u00a0216(1), 47\u201356 (2012)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29124-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T22:03:43Z","timestamp":1556489023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29124-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291234","9783642291241"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29124-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}