{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:45:54Z","timestamp":1767707154329},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,8,13]],"date-time":"2009-08-13T00:00:00Z","timestamp":1250121600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10845-009-0304-8","type":"journal-article","created":{"date-parts":[[2009,8,12]],"date-time":"2009-08-12T10:18:48Z","timestamp":1250072328000},"page":"471-479","source":"Crossref","is-referenced-by-count":43,"title":["Multi-objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning"],"prefix":"10.1007","volume":"22","author":[{"given":"Chengji","family":"Liang","sequence":"first","affiliation":[]},{"given":"Jianquan","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,13]]},"reference":[{"issue":"4","key":"304_CR1","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., Widdis D. B. (1997) Optimizing submarine berthing with a persistence incentive. Naval Research Logistics 44(4): 301\u2013318","journal-title":"Naval Research Logistics"},{"issue":"3","key":"304_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0191-2615(89)90001-5","volume":"23","author":"C. F. Daganzo","year":"1989","unstructured":"Daganzo C. F. (1989) The crane scheduling problem. Transportation Research Part B 23(3): 159\u2013175","journal-title":"Transportation Research Part B"},{"key":"304_CR3","unstructured":"Dai, J., Lin, W., Moorthy, R., Teo, C. P. (2004). Berth allocation planning optimization in container terminal. Working paper, Georgia Institute of Technology, Atlanta; National University of Singapore."},{"key":"304_CR4","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K. Deb","year":"2001","unstructured":"Deb K. (2001) Multi-objective optimization using evolutionary algorithms. Wiley, New York"},{"key":"304_CR5","volume-title":"Genetic algorithms and engineering design","author":"M. Gen","year":"1997","unstructured":"Gen M., Cheng R. (1997) Genetic algorithms and engineering design. Wiley, New York"},{"key":"304_CR6","volume-title":"Genetic algorithms and engineering optimization","author":"M. Gen","year":"2000","unstructured":"Gen M., Cheng R. (2000) Genetic algorithms and engineering optimization. Wiley, New York"},{"key":"304_CR7","volume-title":"Network models and optimization: Multiobjective genetic algorithm approach","author":"M. Gen","year":"2008","unstructured":"Gen M., Cheng R., Lin L. (2008) Network models and optimization: Multiobjective genetic algorithm approach. Springer, New York"},{"key":"304_CR8","unstructured":"Henesey, L., Davidsson, P. & Persson, J. A. (2004). Using simulation in evaluating berth allocation at a container terminal. In Proceedings for the 3rd international conference on computer applications and information technology in the maritime industries."},{"issue":"4","key":"304_CR9","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 B: Methodological 35(4): 401\u2013417","journal-title":"Transportation Research Part B: Methodological"},{"key":"304_CR10","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 B 37: 437\u2013457","journal-title":"Transportation Research Part B"},{"key":"304_CR11","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1016\/j.tre.2007.03.003","volume":"44","author":"A. Imai","year":"2007","unstructured":"Imai A., Chen H. C., Nishimura E., Papadimitriou S. (2007) The simultaneous berth and quay crane allocation problem. Transportation Research Part E 44: 900\u2013920","journal-title":"Transportation Research Part E"},{"issue":"2","key":"304_CR12","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":"304_CR13","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 B: Methodological 37(6): 541\u2013560","journal-title":"Transportation Research Part B: Methodological"},{"issue":"3","key":"304_CR14","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/S0377-2217(03)00133-4","volume":"156","author":"K. H. Kim","year":"2004","unstructured":"Kim K. H., Park Y. M. (2004) A crane scheduling method for port container terminals. European Journal of Operational Research 156(3): 752\u2013768","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"304_CR15","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1504\/IJMTM.2009.021506","volume":"16","author":"C. J. Liang","year":"2009","unstructured":"Liang C. J., Lin L. (2009) Multi-objective hybrid genetic algorithm for quay crane scheduling in berth allocation planning. International Journal of Manufacturing Technology and Management 16(1\u20132): 127\u2013146","journal-title":"International Journal of Manufacturing Technology and Management"},{"issue":"3","key":"304_CR16","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1016\/j.cie.2008.09.024","volume":"56","author":"C. J. Liang","year":"2009","unstructured":"Liang C. J., Huang Y. F., Yang Y. (2009) A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Computers & Industrial Engineering 56(3): 1021\u20131028","journal-title":"Computers & Industrial Engineering"},{"issue":"2\u20133","key":"304_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":"304_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"},{"issue":"1","key":"304_CR19","doi-asserted-by":"crossref","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. (2003) A scheduling method for berth and quay cranes. OR Spectrum 25(1): 1\u201323","journal-title":"OR Spectrum"},{"issue":"1","key":"304_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00291-007-0100-9","volume":"30","author":"R. Stahlbock","year":"2008","unstructured":"Stahlbock R., Voss S. (2008) Operations research at container terminals: A literature update. OR Spectrum 30(1): 1\u201352","journal-title":"OR Spectrum"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-009-0304-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-009-0304-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-009-0304-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:11:45Z","timestamp":1559254305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-009-0304-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,13]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["304"],"URL":"https:\/\/doi.org\/10.1007\/s10845-009-0304-8","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,13]]}}}