{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:33:43Z","timestamp":1761676423725},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319396354"},{"type":"electronic","value":"9783319396361"}],"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-39636-1_14","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T10:36:37Z","timestamp":1464086197000},"page":"187-201","source":"Crossref","is-referenced-by-count":7,"title":["Robust Berth Allocation Using a Hybrid Approach Combining Branch-and-Cut and\u00a0the\u00a0Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Ghazwan","family":"Alsoufi","sequence":"first","affiliation":[]},{"given":"Xinan","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Abdellah","family":"Salhi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.plrev.2005.10.001","volume":"2","author":"C Blum","year":"2005","unstructured":"Blum, C.: Ant colony optimization: introduction and recent trends. Phys. Life Rev. 2(4), 353\u2013373 (2005). Elsevier","journal-title":"Phys. Life Rev."},{"issue":"1","key":"14_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10479-008-0493-0","volume":"180","author":"C Cheong","year":"2010","unstructured":"Cheong, C., Tan, K., Liu, D., Lin, C.: Multi-objective and prioritized berth allocation in container ports. Ann. Oper. Res. 180(1), 63\u2013103 (2010). Springer","journal-title":"Ann. Oper. Res."},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.swevo.2013.06.001","volume":"13","author":"I Fister","year":"2013","unstructured":"Fister, I., Fister, J., Yang, X., Brest, J.: A comprehensive review of firefly algorithms. Swarm Evol. Comput. 13, 34\u201346 (2013). Elsevier","journal-title":"Swarm Evol. Comput."},{"issue":"4","key":"14_CR4","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/s00773-010-0095-9","volume":"15","author":"S Ganji","year":"2010","unstructured":"Ganji, S., Babazadeh, A., Arabshahi, N.: Analysis of the continuous berth allocation problem in container ports using a genetic algorithm. Mar. Sci. Technol. 15(4), 408\u2013416 (2010). Springer","journal-title":"Mar. Sci. Technol."},{"key":"14_CR5","unstructured":"Goh, K., Lim, A.: Combining various algorithms to solve the ship berthing problem. In: 12th IEEE International Conference on ICTAI, pp. 370\u2013375. IEEE (2000)"},{"issue":"1","key":"14_CR6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00291-003-0140-8","volume":"26","author":"Y Guan","year":"2004","unstructured":"Guan, Y., Cheung, R.: The berth allocation problem: models and solution methods. OR Spectrum 26(1), 75\u201392 (2004). Springer","journal-title":"OR Spectrum"},{"key":"14_CR7","volume-title":"The Grid: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"J Holland","year":"1975","unstructured":"Holland, J.: The Grid: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan Press, Ann Arbor (1975)"},{"issue":"3","key":"14_CR8","doi-asserted-by":"crossref","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. Transp. Res. Part B Methodol. 39(3), 199\u2013221 (2005). Elsevier","journal-title":"Transp. Res. Part B Methodol."},{"issue":"6","key":"14_CR9","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1016\/j.tre.2010.01.009","volume":"46","author":"D Lee","year":"2010","unstructured":"Lee, D., Chen, J., Cao, J.: The continuous berth allocation problem: a greedy randomized adaptive search solution. Transp. Res. Part E Logist. Transport. Rev. 46(6), 1017\u20131029 (2010). Elsevier","journal-title":"Transp. Res. Part E Logist. Transport. Rev."},{"issue":"2","key":"14_CR10","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/j.ejor.2008.03.021","volume":"196","author":"Y Lee","year":"2009","unstructured":"Lee, Y., Chen, C.: An optimization heuristic for the berth scheduling problem. Eur. J. Oper. Res. 196(2), 500\u2013508 (2009). Elsevier","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"14_CR11","first-page":"433","volume":"30","author":"C Li","year":"1998","unstructured":"Li, C., Cai, X., Lee, C.: Scheduling with multiple-job-on-one-processor pattern. IIE Trans. 30(5), 433\u2013445 (1998). Springer","journal-title":"IIE Trans."},{"issue":"2","key":"14_CR12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0167-6377(98)00010-8","volume":"22","author":"A Lim","year":"1998","unstructured":"Lim, A.: The berth planning problem. Oper. Res. Lett. 22(2), 105\u2013110 (1998). Elsevier","journal-title":"Oper. Res. Lett."},{"key":"14_CR13","unstructured":"Moon, K.: A mathematical model and a heuristic algorithm for berth planning. Brain Korea. 21 (2000). Citeseer"},{"issue":"4","key":"14_CR14","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s00291-006-0036-5","volume":"28","author":"R Moorthy","year":"2006","unstructured":"Moorthy, R., Teo, C.: Berth management in container terminal: the template design problem. OR Spectrum 28(4), 495\u2013518 (2006). Springer","journal-title":"OR Spectrum"},{"issue":"18","key":"14_CR15","doi-asserted-by":"crossref","first-page":"13108","DOI":"10.1016\/j.eswa.2012.05.091","volume":"39","author":"N Kaveshgar","year":"2012","unstructured":"Kaveshgar, N., Huynh, N., Rahimian, S.: An efficient genetic algorithm for solving the quay crane scheduling problem. Expert Syst. Appl. 39(18), 13108\u201313117 (2012). Elsevier","journal-title":"Expert Syst. Appl."},{"key":"14_CR16","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1007\/978-0-387-30164-8_630","volume-title":"Encyclopedia of Machine Learning","author":"J Kennedy","year":"2011","unstructured":"Kennedy, J.: Particle swarm optimization. In: Sammut, C., Webb, G.I. (eds.) Encyclopedia of Machine Learning, pp. 760\u2013766. Springer, New York (2011)"},{"issue":"6","key":"14_CR17","doi-asserted-by":"crossref","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. Transp. Res. Part B Methodol. 37(6), 541\u2013560 (2003). Elsevier","journal-title":"Transp. Res. Part B Methodol."},{"key":"14_CR18","unstructured":"Vazquez-Rodr\u00edguez, J.A., Salhi, A.: Hybrid evolutionary methods for the solutionof complex scheduling problems. In: Advances in Artificial Intelligence, pp. 17\u201328 (2006)"},{"key":"14_CR19","unstructured":"Salhi, A., Fraga, E.S.: Nature-inspired optimisation approaches and the new plant propagation algorithm. In: Proceedings of the ICeMATH 2011, pp. K2-1-K2-8 (2011)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Vazquez-Rodr\u00edguez, J.A., Salhi, A.: A synergy exploiting evolutionary approach to complex scheduling problems. In: Computer Aided Methods in Optimal Design and Operations, Series on Computers and Operations Research, pp. 59\u201368. World Scientific (2006)","DOI":"10.1142\/9789812772954_0007"},{"issue":"2","key":"14_CR21","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s12293-013-0121-7","volume":"6","author":"A Salhi","year":"2014","unstructured":"Salhi, A., Vazquez-Rodr\u00edguez, J.A.: Tailoring hyper-heuristics to specific instances of a scheduling problem using affinity and competence functions. Memetic Comput. 6(2), 77\u201384 (2014). Springer","journal-title":"Memetic Comput."},{"issue":"4","key":"14_CR22","doi-asserted-by":"crossref","first-page":"2186","DOI":"10.1016\/j.dss.2006.06.008","volume":"42","author":"F Wang","year":"2007","unstructured":"Wang, F., Lim, A.: A stochastic beam search for the berth allocation problem. Dec. Supp. Syst. 42(4), 2186\u20132196 (2007). Elsevier","journal-title":"Dec. Supp. Syst."},{"issue":"1","key":"14_CR23","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10479-010-0820-0","volume":"192","author":"Y Xu","year":"2012","unstructured":"Xu, Y., Chen, Q., Quan, X.: Robust berth scheduling with uncertain vessel delay and handling time. Ann. Oper. Res. 192(1), 123\u2013140 (2012). Springer","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"14_CR24","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/j.cie.2012.03.003","volume":"63","author":"L Zhen","year":"2012","unstructured":"Zhen, L., Chang, D.: A bi-objective model for robust berth allocation scheduling. Comput. Ind. Eng. 63(1), 262\u2013273 (2012). Elsevier","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"14_CR25","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ejor.2011.01.021","volume":"212","author":"L Zhen","year":"2011","unstructured":"Zhen, L., Lee, L., Chew, E.: A decision model for berth allocation under uncertainty. Eur. J. Oper. Res. 212(1), 54\u201368 (2011). Elsevier","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39636-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T02:31:18Z","timestamp":1718591478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39636-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319396354","9783319396361"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39636-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}