{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T07:49:52Z","timestamp":1774338592824,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,12,13]],"date-time":"2008-12-13T00:00:00Z","timestamp":1229126400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s10479-008-0493-0","type":"journal-article","created":{"date-parts":[[2008,12,12]],"date-time":"2008-12-12T20:19:59Z","timestamp":1229113199000},"page":"63-103","source":"Crossref","is-referenced-by-count":73,"title":["Multi-objective and prioritized berth allocation in\u00a0container ports"],"prefix":"10.1007","volume":"180","author":[{"given":"C. Y.","family":"Cheong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. C.","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. K.","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. J.","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,13]]},"reference":[{"issue":"2","key":"493_CR1","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TEVC.2003.810761","volume":"7","author":"P. Bosman","year":"2003","unstructured":"Bosman, P., & Thierens, D. (2003). The balance between proximity and diversity in multi-objective evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 7(2), 174\u2013188.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"493_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/1520-6750(199402)41:1<1::AID-NAV3220410102>3.0.CO;2-L","volume":"41","author":"G. G. Brown","year":"1994","unstructured":"Brown, G. G., Lawphongpanich, S., & Thurman, K. P. (1994). Optimizing ship berthing. Naval Research Logistics, 41, 1\u201315.","journal-title":"Naval Research Logistics"},{"key":"493_CR3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1002\/(SICI)1520-6750(199706)44:4<301::AID-NAV2>3.0.CO;2-A","volume":"44","author":"G. G. Brown","year":"1997","unstructured":"Brown, G. G., Cormican, K. J., Lawphongpanich, S., & Widddis, D. B. (1997). Optimizing submarine berthing with a persistence incentive. Navel Research Logistics, 44, 301\u2013318.","journal-title":"Navel Research Logistics"},{"key":"493_CR4","doi-asserted-by":"crossref","unstructured":"Cheong, C. Y., Tan, K. C., & Veeravalli, B. (2007). Solving the exam timetabling problem via a multi-objective evolutionary algorithm\u2014a more general approach. In Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007 (pp. 165\u2013172), Honolulu, HI, USA, 2007.","DOI":"10.1109\/SCIS.2007.367685"},{"key":"493_CR5","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K. Deb","year":"2001","unstructured":"Deb, K. (2001). Multi-objective optimization using evolutionary algorithms. New York: Wiley."},{"key":"493_CR6","unstructured":"Fonseca, C. M. (1995). Multiobjective genetic algorithms with application to control engineering problems. Ph.D. thesis, Department of Automatic Control and Systems Engineering, University of Sheffield, Sheffield, UK."},{"key":"493_CR7","unstructured":"Foo, H. M. (2000). The application of genetic algorithms to the berth allocation problem. Master thesis, Department of Computer Science, Faculty of Science, National University of Singapore, Singapore."},{"key":"493_CR8","doi-asserted-by":"crossref","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. K., & Li, C.-L. (2002). A\u00a0multiprocessor task scheduling model for berth allocation: heuristic and worst case analysis. Operations Research Letters, 30, 343\u2013350.","journal-title":"Operations Research Letters"},{"key":"493_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/atr.5670310107","volume":"31","author":"A. Imai","year":"1997","unstructured":"Imai, A., Nagaiwa, K., & Chan, W. T. (1997). Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation, 31, 75\u201394.","journal-title":"Journal of Advanced Transportation"},{"issue":"4","key":"493_CR10","doi-asserted-by":"crossref","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. (2001). The dynamic berth allocation problem for a container port. Transportation Research Part\u00a0B: Methodological, 35(4), 401\u2013417.","journal-title":"Transportation Research Part\u00a0B: Methodological"},{"issue":"5","key":"493_CR11","doi-asserted-by":"crossref","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. (2003). Berth allocation with service priority. Transportation Research Part\u00a0B: Methodological, 37(5), 437\u2013457.","journal-title":"Transportation Research Part\u00a0B: Methodological"},{"issue":"3","key":"493_CR12","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. (2005). Berth allocation in a container port: using a continuous location space approach. Transportation Research Part\u00a0B: Methodological, 39(3), 199\u2013221.","journal-title":"Transportation Research Part\u00a0B: Methodological"},{"issue":"2","key":"493_CR13","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/j.ejor.2006.03.034","volume":"179","author":"A. Imai","year":"2007","unstructured":"Imai, A., Nishimura, E., Hattori, M., & Papadimitriou, S. (2007). Berth allocation at indented berths for mega-containerships. European Journal of Operational Research, 179(2), 579\u2013593.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"493_CR14","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/S0191-2615(02)00027-9","volume":"37","author":"K. H. Kim","year":"2003","unstructured":"Kim, K. H., & Moon, K. C. (2003). Berth scheduling by simulated annealing. Transportation Research Part\u00a0B: Methodological, 37(6), 541\u2013560.","journal-title":"Transportation Research Part\u00a0B: Methodological"},{"key":"493_CR15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/atr.5670260105","volume":"26","author":"K. K. Lai","year":"1992","unstructured":"Lai, K. K., & Shih, K. (1992). A\u00a0study of container berth allocation. Journal of Advanced Transportation, 26, 45\u201360.","journal-title":"Journal of Advanced Transportation"},{"key":"493_CR16","first-page":"433","volume":"30","author":"C.-L. Li","year":"1998","unstructured":"Li, C.-L., Cai, X., & Lee, C.-Y. (1998). Scheduling with multiple-job-on-one-processor pattern. IIE Transactions, 30, 433\u2013445.","journal-title":"IIE Transactions"},{"issue":"2\u20133","key":"493_CR17","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. (1998). The berth planning problem. Operations Research Letters, 22(2\u20133), 105\u2013110.","journal-title":"Operations Research Letters"},{"issue":"2","key":"493_CR18","doi-asserted-by":"crossref","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. (2001). Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research, 131(2), 282\u2013292.","journal-title":"European Journal of Operational Research"},{"key":"493_CR19","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1057\/palgrave.jors.2601412","volume":"53","author":"K. T. Park","year":"2002","unstructured":"Park, K. T., & Kim, K. H. (2002). Berth scheduling for container terminals by using a sub-gradient optimization technique. Journal of the Operational Research Society, 53, 1054\u20131062.","journal-title":"Journal of the Operational Research Society"},{"key":"493_CR20","first-page":"1","volume":"25","author":"Y.-M. Park","year":"2003","unstructured":"Park, Y.-M., & Kim, K. H. (2003). A\u00a0scheduling method for berth and quay cranes. OR\u00a0Spectrum, 25, 1\u201323.","journal-title":"OR\u00a0Spectrum"},{"key":"493_CR21","first-page":"23","volume":"89","author":"P. Ross","year":"1994","unstructured":"Ross, P., & Corne, D. (1994). Applications of genetic algorithms. AISB Quarterly, 89, 23\u201330.","journal-title":"AISB Quarterly"},{"key":"493_CR22","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1016\/j.ejor.2005.12.029","volume":"177","author":"K. C. Tan","year":"2007","unstructured":"Tan, K. C., Cheong, C. Y., & Goh, C. K. (2007). Solving multi-objective vehicle routing problem with stochastic demand via evolutionary computation. European Journal of Operational Research, 177, 813\u2013839.","journal-title":"European Journal of Operational Research"},{"key":"493_CR23","unstructured":"Ying, Y. M. (1995). Berth allocation planning using genetic algorithms. Master thesis, Department of Civil Engineering, Faculty of Engineering, National University of Singapore, Singapore."},{"issue":"4","key":"493_CR24","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E. Zitzler","year":"1999","unstructured":"Zitzler, E., & Thiele, L. (1999). Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation, 3(4), 257\u2013271.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"493_CR25","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E. Zitzler","year":"2000","unstructured":"Zitzler, E., Deb, K., & Thiele, L. (2000). Comparison of multi-objective evolutionary algorithms: empirical results. Evolutionary Computation, 8(2), 173\u2013195.","journal-title":"Evolutionary Computation"},{"issue":"2","key":"493_CR26","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E. Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & Fonseca, V. G. (2003). Performance assessment of multi-objective optimizers: an analysis and review. IEEE Transactions on Evolutionary Computation, 7(2), 117\u2013132.","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0493-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0493-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0493-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:52Z","timestamp":1559153272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0493-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,13]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["493"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0493-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,13]]}}}