{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T20:54:23Z","timestamp":1775940863355,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T00:00:00Z","timestamp":1578009600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T00:00:00Z","timestamp":1578009600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71971143"],"award-info":[{"award-number":["71971143"]}],"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":["71571120"],"award-info":[{"award-number":["71571120"]}],"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":["71901052"],"award-info":[{"award-number":["71901052"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Major Project for National Science Foundation of China","award":["71790615"],"award-info":[{"award-number":["71790615"]}]},{"DOI":"10.13039\/501100010226","name":"Department of Education of Guangdong Province","doi-asserted-by":"publisher","award":["2017GWTSCX038"],"award-info":[{"award-number":["2017GWTSCX038"]}],"id":[{"id":"10.13039\/501100010226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013137","name":"Guangdong Province Higher Vocational Colleges and Schools Pearl River Scholar Funded Scheme","doi-asserted-by":"publisher","award":["2016"],"award-info":[{"award-number":["2016"]}],"id":[{"id":"10.13039\/501100013137","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s11047-019-09781-3","type":"journal-article","created":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T07:03:20Z","timestamp":1578035000000},"page":"89-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Multi-objective bacterial colony optimization algorithm for integrated container terminal scheduling problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Ben","family":"Niu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qianying","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengxu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3744-0312","authenticated-orcid":false,"given":"Lijing","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"issue":"4","key":"9781_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10951-009-0105-0","volume":"12","author":"C Bierwirth","year":"2009","unstructured":"Bierwirth C, Meisel F (2009) A fast heuristic for quay crane scheduling with interference constraints. J Sched 12(4):345\u2013360","journal-title":"J Sched"},{"issue":"1","key":"9781_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0377-2217(01)00382-4","volume":"144","author":"EK Bish","year":"2003","unstructured":"Bish EK (2003) A multiple-crane-constrained scheduling problem in a container terminal. J Eur J Oper Res 144(1):83\u2013107","journal-title":"J Eur J Oper Res"},{"key":"9781_CR3","first-page":"106","volume":"21","author":"HD Chen","year":"2015","unstructured":"Chen HD (2015) Optimal power flow of distribution network with distributed generation based on bacterial colony optimization. J Power Syst Prot Control 21:106\u2013111 (in Chinese)","journal-title":"J Power Syst Prot Control"},{"issue":"10","key":"9781_CR4","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ejor.2006.06.033","volume":"181","author":"L Chen","year":"2007","unstructured":"Chen L, Bostel N, Dejax P, Cai J (2007) A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. J Eur J Oper Res 181(10):40\u201358","journal-title":"J Eur J Oper Res"},{"key":"9781_CR5","doi-asserted-by":"crossref","unstructured":"Cheong CY, Habibullah MS, Goh RSM, Fu X (2010) Multi-objective optimization of large scale berth allocation and quay crane assignment problems. In: 2010 IEEE international conference on systems, man and cybernetics, pp 669\u2013676","DOI":"10.1109\/ICSMC.2010.5641824"},{"issue":"3","key":"9781_CR6","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/TEVC.2004.826067","volume":"8","author":"CAC Coello","year":"2004","unstructured":"Coello CAC, Pulido GT, Lechuga MS (2004) Handling multiple objectives with particle swarm optimization. IEEE Trans Evol Comput 8(3):256\u2013279. https:\/\/doi.org\/10.1109\/TEVC.2004.826067","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"9781_CR7","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1287\/trsc.1050.0120","volume":"39","author":"J-F Cordeau","year":"2005","unstructured":"Cordeau J-F, Laporte G, Legato P, Moccia L (2005) Models and Tabu search heuristics for the Berth-allocation problem. J Transp Sci 39(4):526\u2013538","journal-title":"J Transp Sci"},{"issue":"3","key":"9781_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0191-2615(89)90001-5","volume":"23","author":"CF Daganzo","year":"1989","unstructured":"Daganzo CF (1989) The crane scheduling problem. J Transp Res Part B (Methodological) 23(3):159\u2013175","journal-title":"J Transp Res Part B (Methodological)"},{"issue":"2","key":"9781_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9781_CR10","first-page":"60","volume":"39","author":"P Dong","year":"2013","unstructured":"Dong P, Hu ZH, Tao S (2013) Berth and crane allocation probleilll based on cost analysis of quay cranes for container terminal. J Dalian Marit Univ 39(2):60\u201364 (in Chinese)","journal-title":"J Dalian Marit Univ"},{"issue":"1","key":"9781_CR11","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/3468.650320","volume":"28","author":"CM Fonseca","year":"1998","unstructured":"Fonseca CM, Fleming PJ (1998) Multiobjective optimization and multiple constraint handling with evolutionary algorithms. IEEE Trans Syst Man Cybern Part A Syst Hum 28(1):38\u201347. https:\/\/doi.org\/10.1109\/3468.650320","journal-title":"IEEE Trans Syst Man Cybern Part A Syst Hum"},{"issue":"6","key":"9781_CR12","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1016\/j.tre.2009.05.006","volume":"45","author":"MM Golias","year":"2009","unstructured":"Golias MM, Boile M, Theofanis S (2009) Berth scheduling by customer service differentiation: a multi-objective approach. J Transp Res Part E Logist Transp Rev 45(6):878\u2013892","journal-title":"J Transp Res Part E Logist Transp Rev"},{"issue":"3","key":"9781_CR13","doi-asserted-by":"publisher","first-page":"1327","DOI":"10.1016\/j.ejor.2010.07.018","volume":"207","author":"XL Han","year":"2010","unstructured":"Han XL, Lu ZQ, Xi LF (2010) A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. J Eur J Oper Res 207(3):1327\u20131340","journal-title":"J Eur J Oper Res"},{"issue":"2","key":"9781_CR14","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/int.20128","volume":"21","author":"VL Huang","year":"2006","unstructured":"Huang VL, Suganthan PN, Liang JJ (2006) Comprehensive learning particle swarm optimizer for solving multiobjective optimization problems: research articles. J Int J Intell Syst 21(2):209\u2013226","journal-title":"J Int J Intell Syst"},{"issue":"4","key":"9781_CR15","doi-asserted-by":"publisher","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. J Transp Res Part B 35(4):401\u2013417","journal-title":"J Transp Res Part B"},{"issue":"5","key":"9781_CR16","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.tre.2007.03.003","volume":"44","author":"A Imai","year":"2008","unstructured":"Imai A, Chen HC, Nishimura E, Papadimitriou S (2008) The simultaneous Berth and quay crane allocation problem. J Transp Res Part E Logist Transp Rev 44(5):900\u2013920","journal-title":"J Transp Res Part E Logist Transp Rev"},{"key":"9781_CR17","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.ijpe.2014.09.028","volume":"159","author":"N Kaveshgar","year":"2015","unstructured":"Kaveshgar N, Huynh N (2015) Integrated quay crane and yard truck scheduling for unloading inbound containers. J Int J Prod Econ 159:168\u2013177","journal-title":"J Int J Prod Econ"},{"issue":"3\u20134","key":"9781_CR18","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1016\/S0360-8352(97)00219-2","volume":"33","author":"KY Kim","year":"1997","unstructured":"Kim KY, Kim KH (1997) A routing algorithm for a single transfer crane to load export containers onto a containership. J Comput Ind Eng 33(3\u20134):673\u2013676","journal-title":"J Comput Ind Eng"},{"issue":"3","key":"9781_CR19","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1016\/S0377-2217(03)00133-4","volume":"156","author":"KH Kim","year":"2004","unstructured":"Kim KH, Park YM (2004) A crane scheduling method for port container terminals. J Eur J Oper Res 156(3):752\u2013768","journal-title":"J Eur J Oper Res"},{"key":"9781_CR20","doi-asserted-by":"publisher","unstructured":"Kursawe F (1998) A variant of evolution strategies for vector optimization. In: Proceedings of international conference on parallel problem solving from nature (PPSN), pp 193\u2013197. https:\/\/doi.org\/10.1007\/bfb0029752","DOI":"10.1007\/bfb0029752"},{"issue":"3","key":"9781_CR21","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1016\/j.cie.2008.09.024","volume":"56","author":"CJ Liang","year":"2009","unstructured":"Liang CJ, Huang YF, Yang Y (2009) A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. J Comput Ind Eng 56(3):1021\u20131028","journal-title":"J Comput Ind Eng"},{"issue":"3","key":"9781_CR22","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10845-009-0304-8","volume":"22","author":"CJ Liang","year":"2011","unstructured":"Liang CJ, Guo JQ, Yang Y (2011) Multi-objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning. J Intell Manuf 22(3):471\u2013479","journal-title":"J Intell Manuf"},{"issue":"1","key":"9781_CR23","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tre.2003.12.002","volume":"41","author":"E Nishimura","year":"2005","unstructured":"Nishimura E, Imai A, Papadimitriou S (2005) Yard trailer routing at a maritime container terminal. J Transp Res Part E Logist Transp Rev 41(1):53\u201376","journal-title":"J Transp Res Part E Logist Transp Rev"},{"key":"9781_CR24","doi-asserted-by":"publisher","unstructured":"Niu B, Wang H (2012) Bacterial colony optimization: principles and foundations. In: Proceedings of international conference on intelligent computing (ICIC\u201912), pp 501\u2013506. https:\/\/doi.org\/10.1007\/978-3-642-31837-5_73","DOI":"10.1007\/978-3-642-31837-5_73"},{"key":"9781_CR25","doi-asserted-by":"publisher","unstructured":"Niu B, Xie T, Bi Y, Liu J (2014) Bacterial colony optimization for integrated yard truck scheduling and storage allocation problem. In: Proceedings of international conference on intelligent computing (ICIC\u201914), pp 431\u2013437. https:\/\/doi.org\/10.1007\/978-3-319-09330-7_50","DOI":"10.1007\/978-3-319-09330-7_50"},{"key":"9781_CR26","unstructured":"Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of international conference on genetic algorithms (ICGA\u201985), pp 93\u2013100"},{"issue":"4","key":"9781_CR27","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1016\/j.eswa.2013.08.051","volume":"41","author":"C-J Ting","year":"2014","unstructured":"Ting C-J, Wu K-C, Chou H (2014) Particle swarm optimization algorithm for the berth allocation problem. J Expert Syst Appl 41(4):1543\u20131550","journal-title":"J Expert Syst Appl"},{"key":"9781_CR28","unstructured":"Van Veldhuizen DA, Lamont GB (1998) Multiobjective evolutionary algorithm research: a history and analysis. Technical Report TR-98-03, Department of Electrical and Computer Engineering, Graduate School of Engineering, Air Force Institute of Technology, Wright-Patterson AFB"},{"key":"9781_CR29","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.tre.2017.07.006","volume":"106","author":"X Xi","year":"2017","unstructured":"Xi X, Changchun L, Lixin M (2017) Bi-objective robust model for berth allocation scheduling under uncertainty. J Transp Res Part E Logist Transp Rev 106:294\u2013319","journal-title":"J Transp Res Part E Logist Transp Rev"},{"key":"9781_CR30","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.cie.2018.09.033","volume":"126","author":"X Xiang","year":"2018","unstructured":"Xiang X, Liu CC, Miao LX (2018) Reactive strategy for discrete berth allocation and quay crane assignment problems under uncertainty. J Comput Ind Eng 126:196\u2013216","journal-title":"J Comput Ind Eng"},{"issue":"3","key":"9781_CR31","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s00291-010-0193-4","volume":"32","author":"R Zhang","year":"2010","unstructured":"Zhang R, Yun WY, Kopfer H (2010) Heuristic-based truck scheduling for inland container transportation. J OR Spectr 32(3):787\u2013808","journal-title":"J OR Spectr"},{"issue":"2","key":"9781_CR32","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. J Evol Comput 8(2):173\u2013195","journal-title":"J Evol Comput"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-019-09781-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-019-09781-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-019-09781-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T21:06:46Z","timestamp":1614892006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-019-09781-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,3]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["9781"],"URL":"https:\/\/doi.org\/10.1007\/s11047-019-09781-3","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,3]]},"assertion":[{"value":"3 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}