{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:28:53Z","timestamp":1768451333700,"version":"3.49.0"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"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"}]},{"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"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Intell. Transport. Syst."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/tits.2018.2841022","type":"journal-article","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T18:45:31Z","timestamp":1530297931000},"page":"947-958","source":"Crossref","is-referenced-by-count":15,"title":["A Binary Borg-Based Heuristic Method for Solving a Multi-Objective Lock and Transshipment Co-Scheduling Problem"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3452-8308","authenticated-orcid":false,"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":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ymssp.2016.09.026"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(02)00027-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2006.06.008"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00773-010-0095-9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0120"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.01.002"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2007.03.003"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.04.224"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2015.03.009"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2014.03.009"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.09.007"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2014.04.052"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2013.12.010"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.071"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2013.2243836"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.06.045"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2016.2630718"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.08.009"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.04.019"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.12.030"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2004.04.004"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00075"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0610471104"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2008.922884"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2014.07.060"},{"key":"ref26","first-page":"105","article-title":"A memetic algorithm for a continuous case of the berth allocation problem","author":"mauri","year":"2011","journal-title":"Proc ECTA-FCTA"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2014.12.021"}],"container-title":["IEEE Transactions on Intelligent Transportation Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6979\/8654737\/08400549.pdf?arnumber=8400549","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:51:21Z","timestamp":1657745481000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8400549\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":30,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tits.2018.2841022","relation":{},"ISSN":["1524-9050","1558-0016"],"issn-type":[{"value":"1524-9050","type":"print"},{"value":"1558-0016","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}