{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:52:32Z","timestamp":1772553152297,"version":"3.50.1"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51379080"],"award-info":[{"award-number":["51379080"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41571514"],"award-info":[{"award-number":["41571514"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1109\/tcyb.2017.2669334","type":"journal-article","created":{"date-parts":[[2017,2,24]],"date-time":"2017-02-24T19:30:03Z","timestamp":1487964603000},"page":"2885-2895","source":"Crossref","is-referenced-by-count":64,"title":["Modified NSGA-II for Solving Continuous Berth Allocation Problem: Using Multiobjective Constraint-Handling Strategy"],"prefix":"10.1109","volume":"47","author":[{"given":"Bin","family":"Ji","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0939-2704","authenticated-orcid":false,"given":"Xiaohui","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Yanbin","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.02.002"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7825(99)00389-8"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.05.031"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2012.03.003"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-010-0820-0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2004.04.004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1504\/IJCAT.2008.021382"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s00773-010-0095-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0120"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29124-1_5"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.01.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1120.0419"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(99)00057-0"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2012.2227469"},{"key":"ref4","first-page":"370","article-title":"Combining various algorithms to solve the ship berthing problem","author":"goh","year":"2000","journal-title":"Proc Int Conf Tools Artif Intell"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(98)00010-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(02)00027-9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2004.841906"},{"key":"ref5","article-title":"A mathematical model and a heuristic algorithm for berth planning","author":"moon","year":"2000"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2006.06.008"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601412"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1061\/9780784413067.165"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2010.01.009"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00291-003-0157-z","article-title":"Container terminal operation and operations research-a classification and literature review","volume":"26","author":"steenken","year":"2004","journal-title":"OR Spectrum"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.12.030"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.07.010"},{"key":"ref21","first-page":"1b","article-title":"Handbook of evolutionary computation","volume":"97","author":"back","year":"1997","journal-title":"Release"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-015-2017-z"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2395412"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2014.04.052"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/8006322\/07864389.pdf?arnumber=7864389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:59:00Z","timestamp":1642006740000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7864389\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":33,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2017.2669334","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9]]}}}