{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:29:44Z","timestamp":1781087384669,"version":"3.54.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2016,3,2]],"date-time":"2016-03-02T00:00:00Z","timestamp":1456876800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Funds of China","doi-asserted-by":"crossref","award":["51509056"],"award-info":[{"award-number":["51509056"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002858","name":"the Postdoctoral Science Foundation of China","doi-asserted-by":"crossref","award":["2015M571394"],"award-info":[{"award-number":["2015M571394"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Heilongjiang Postdoctoral Fund","award":["LBH-Z14059"],"award-info":[{"award-number":["LBH-Z14059"]}]},{"name":"the Fundamental Research Funds for the Central Universities","award":["HEUCF150108"],"award-info":[{"award-number":["HEUCF150108"]}]},{"name":"the Ministry of Science and Technology Project of Western Transportation Construction of Ministry of Communications","award":["2014364554050"],"award-info":[{"award-number":["2014364554050"]}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan (TW)","doi-asserted-by":"publisher","award":["MOST 104-2410-H-161-002"],"award-info":[{"award-number":["MOST 104-2410-H-161-002"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s00521-016-2226-7","type":"journal-article","created":{"date-parts":[[2016,3,2]],"date-time":"2016-03-02T01:27:29Z","timestamp":1456882049000},"page":"3163-3182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":47,"title":["Berth and quay crane coordinated scheduling using multi-objective chaos cloud particle swarm optimization algorithm"],"prefix":"10.1007","volume":"28","author":[{"given":"Ming-Wei","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3001-2921","authenticated-orcid":false,"given":"Wei-Chiang","family":"Hong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Geng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianlun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,3,2]]},"reference":[{"key":"2226_CR1","doi-asserted-by":"crossref","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. Eur J Oper Res 207:1327\u20131340","journal-title":"Eur J Oper Res"},{"key":"2226_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00293-X","volume":"147","author":"IFA Vis","year":"2003","unstructured":"Vis IFA, Koster R (2003) Transshipment of containers at a container terminal: an overview. Eur J Oper Res 147:1\u201316","journal-title":"Eur J Oper Res"},{"key":"2226_CR3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.cie.2012.03.004","volume":"63","author":"CX Yang","year":"2012","unstructured":"Yang CX, Wang XJ, Li ZF (2012) An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal. Comput Ind Eng 63:243\u2013253","journal-title":"Comput Ind Eng"},{"key":"2226_CR4","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.neucom.2012.08.002","volume":"99","author":"MW Li","year":"2013","unstructured":"Li MW, Hong WC, Kang HG (2013) Urban traffic flow forecasting using Gauss-SVR with cat mapping, cloud model and PSO hybrid algorithm. Neurocomputing 99:230\u2013240","journal-title":"Neurocomputing"},{"key":"2226_CR5","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1109\/JSEE.2013.00041","volume":"24","author":"MW Li","year":"2013","unstructured":"Li MW, Kang HG, Zhou PH, Hong WC (2013) Hybrid optimization algorithm based on chaos, cloud and particle swarm optimization algorithm. J Syst Eng Electron 24:324\u2013334","journal-title":"J Syst Eng Electron"},{"key":"2226_CR6","first-page":"82","volume":"37","author":"MW Li","year":"2013","unstructured":"Li MW, Kang HG, Zhou PH (2013) Intersection traffic signal intelligent timing optimization based on chaos cloud particle swarm optimization algorithm. J Wuhan Unive Technol (Trans Sci Eng) 37:82\u201385","journal-title":"J Wuhan Unive Technol (Trans Sci Eng)"},{"key":"2226_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/atr.5670260105","volume":"26","author":"KK Lai","year":"1992","unstructured":"Lai KK, Shih K (1992) A study of container berth allocation. J Adv Trans 26:45\u201360","journal-title":"J Adv Trans"},{"key":"2226_CR8","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":"GG Brown","year":"1994","unstructured":"Brown GG, Lawphongpanich S, Thurman KP (1994) Optimizing ship berthing. Naval Res Logist 41:1\u201315","journal-title":"Naval Res Logist"},{"key":"2226_CR9","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":"GG Brown","year":"1997","unstructured":"Brown GG, Cormican KJ, Lawphongpanich S, Widdis DB (1997) Optimizing submarine berthing with a persistence incentive. Naval Res Logist 44:301\u2013318","journal-title":"Naval Res Logist"},{"key":"2226_CR10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/atr.5670310107","volume":"31","author":"A Imai","year":"1997","unstructured":"Imai A, Nagaiwa K, Tat CW (1997) Efficient planning of berth allocation for container terminals in Asia. J Adv Trans 31:75\u201394","journal-title":"J Adv Trans"},{"key":"2226_CR11","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. Transp Res Part B 35:401\u2013417","journal-title":"Transp Res Part B"},{"key":"2226_CR12","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/j.ejor.2006.12.057","volume":"191","author":"P Hansen","year":"2008","unstructured":"Hansen P, O\u011fuz C, Mladenovic N (2008) Variable neighborhood search for minimum cost berth allocation. Eur J Oper Res 191:636\u2013649","journal-title":"Eur J Oper Res"},{"key":"2226_CR13","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. Eur J Oper Res 131:282\u2013292","journal-title":"Eur J Oper Res"},{"key":"2226_CR14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1287\/trsc.1060.0171","volume":"41","author":"MF Monaco","year":"2007","unstructured":"Monaco MF, Sammarra M (2007) The berth allocation problem: a strong formulation solved by a Lagrangean approach. Trans Sci 41:265\u2013280","journal-title":"Trans Sci"},{"key":"2226_CR15","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1287\/trsc.1050.0120","volume":"39","author":"JF Cordeau","year":"2005","unstructured":"Cordeau JF, Laporte G, Legato P, Moccia L (2005) Models and tabu search heuristics for the berth-allocation problem. Trans Sci 39:526\u2013538","journal-title":"Trans Sci"},{"key":"2226_CR16","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. Transp Res Part B 37:437\u2013457","journal-title":"Transp Res Part B"},{"key":"2226_CR17","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. Eur J Oper Res 179:579\u2013593","journal-title":"Eur J Oper Res"},{"key":"2226_CR18","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.tre.2006.05.002","volume":"44","author":"A Imai","year":"2008","unstructured":"Imai A, Nishimura E, Papadimitriou S (2008) Berthing ships at a multi-user container terminal with a limited quay capacity. Transp Res Part E 44:136\u2013151","journal-title":"Transp Res Part E"},{"key":"2226_CR19","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1016\/j.trc.2009.07.001","volume":"18","author":"MM Golias","year":"2010","unstructured":"Golias MM, Boile M, Theofains S (2010) A lambda-optimal based heuristic for the berth scheduling problem. Transp Res Part C 18:794\u2013806","journal-title":"Transp Res Part C"},{"key":"2226_CR20","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1016\/j.tre.2009.05.006","volume":"45","author":"MM Golias","year":"2009","unstructured":"Golias MM, Boile M, Theofains S (2009) Berthing scheduling by customer service differentiation: a multi-objective approach. Transp Res Part E 45:878\u2013892","journal-title":"Transp Res Part E"},{"key":"2226_CR21","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.tre.2010.11.016","volume":"47","author":"K Buhrkal","year":"2011","unstructured":"Buhrkal K, Zuglian S, Ropke S, Larsen J, Lusby R (2011) Models for the discrete berth allocation problem: a computational comparison. Transp Res Part E 47:461\u2013473","journal-title":"Transp Res Part E"},{"key":"2226_CR22","unstructured":"Christensen CG, Holst CT (2008) Berth allocation in container terminals. Master\u2019s thesis, Department of informatics and mathematical modelling, Technical University of Denmark, April (in Danish)"},{"key":"2226_CR23","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. Oper Res Lett 22:105\u2013110","journal-title":"Oper Res Lett"},{"key":"2226_CR24","first-page":"433","volume":"30","author":"CL Li","year":"1998","unstructured":"Li CL, Cai X, Lee CY (1998) Scheduling with multiple-job-on-one-processor pattern. IIE Trans 30:433\u2013445","journal-title":"IIE Trans"},{"key":"2226_CR25","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00291-003-0140-8","volume":"26","author":"Y Guan","year":"2004","unstructured":"Guan Y, Cheung RK (2004) The berth allocation problem: models and solution methods. OR Spectrum 26:75\u201392","journal-title":"OR Spectrum"},{"key":"2226_CR26","doi-asserted-by":"crossref","first-page":"2186","DOI":"10.1016\/j.dss.2006.06.008","volume":"42","author":"F Wang","year":"2007","unstructured":"Wang F, Lim A (2007) A stochastic beam search for the berth allocation problem. Decis Support Syst 42:2186\u20132196","journal-title":"Decis Support Syst"},{"key":"2226_CR27","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 WQ, Cheung RK, Li CL (2002) A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis. Oper Res Lett 30:343\u2013350","journal-title":"Oper Res Lett"},{"key":"2226_CR28","unstructured":"Moon K (2000) A mathematical model and a heuristic algorithm for berth planning. Ph.D. Thesis, Pusan National University, Pusan"},{"key":"2226_CR29","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1057\/palgrave.jors.2601412","volume":"53","author":"KT Park","year":"2002","unstructured":"Park KT, Kim KH (2002) Berth scheduling for container terminals by using a sub-gradient optimization technique. J Oper Res Soc 53:1054\u20131062","journal-title":"J Oper Res Soc"},{"key":"2226_CR30","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. Transp Res Part B 39:199\u2013221","journal-title":"Transp Res Part B"},{"key":"2226_CR31","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1504\/IJCAT.2008.021382","volume":"32","author":"D Chang","year":"2008","unstructured":"Chang D, Yan W, Chen CH, Jiang Z (2008) A berth allocation strategy using heuristics algorithm and simulation optimization. Int J Comput Appl Technol 32:272\u2013281","journal-title":"Int J Comput Appl Technol"},{"key":"2226_CR32","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1016\/j.tre.2010.01.009","volume":"46","author":"DH Lee","year":"2010","unstructured":"Lee DH, Chen JH, Cao JX (2010) The continuous berth allocation problem: a greedy randomized adaptive search solution. Transp Res Part E 46:1017\u20131029","journal-title":"Transp Res Part E"},{"key":"2226_CR33","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ejor.2011.01.021","volume":"212","author":"L Zhen","year":"2011","unstructured":"Zhen L, Lee LH, Chew EP (2011) A decision model for berth allocation under uncertainty. Eur J Oper Res 212:54\u201368","journal-title":"Eur J Oper Res"},{"key":"2226_CR34","doi-asserted-by":"crossref","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. Transp Res Part E 44:900\u2013920","journal-title":"Transp Res Part E"},{"key":"2226_CR35","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S1874-8651(09)60001-6","volume":"28","author":"PF Zhou","year":"2008","unstructured":"Zhou PF, Kang HG (2008) Study on berth and quay-crane allocation under stochastic environment in container terminal. Syst Eng Theory Pract 28:161\u2013169","journal-title":"Syst Eng Theory Pract"},{"key":"2226_CR36","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1016\/j.cie.2008.09.024","volume":"56","author":"C Liang","year":"2009","unstructured":"Liang C, Huang Y, Yang Y (2009) A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Comput Ind Eng 56:1021\u20131028","journal-title":"Comput Ind Eng"},{"key":"2226_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00291-002-0109-z","volume":"25","author":"YM Park","year":"2003","unstructured":"Park YM, Kim KH (2003) A scheduling method for berth and quay cranes. OR Spectrum 25:1\u201323","journal-title":"OR Spectrum"},{"key":"2226_CR38","unstructured":"O\u011fuz C, B\u0142azewicz J, Cheng TCE, Machowiak M (2004) Berth allocation as a moldable task scheduling problem. In: Proceedings of the ninth international workshop on project management and scheduling, Nancy, pp. 201\u2013205"},{"key":"2226_CR39","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.cie.2009.08.002","volume":"58","author":"C Zhang","year":"2010","unstructured":"Zhang C, Zheng L, Zhang Z, Shi L, Armstrong AJ (2010) The allocation of berths and quay cranes by using a sub-gradient optimization technique. Comput Ind Eng 58:40\u201350","journal-title":"Comput Ind Eng"},{"key":"2226_CR40","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1016\/j.tre.2010.05.008","volume":"46","author":"D Chang","year":"2010","unstructured":"Chang D, Jiang Z, Yan W, He J (2010) Integrating berth allocation and quay crane assignments. Transp Res Part E 46:975\u2013990","journal-title":"Transp Res Part E"},{"key":"2226_CR41","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.tre.2008.03.001","volume":"45","author":"F Meisel","year":"2009","unstructured":"Meisel F, Bierwirth C (2009) Heuristics for the integration of crane productivity in the berth allocation problem. Transp Res Part E 45:196\u2013209","journal-title":"Transp Res Part E"},{"key":"2226_CR42","first-page":"1286","volume":"41","author":"LB Zhang","year":"2004","unstructured":"Zhang LB, Zhou CG, Ma M, Liu XH (2004) Solutions of multi objective optimization problems based on particle swarm optimization. J Comput Res Dev 41:1286\u20131291","journal-title":"J Comput Res Dev"},{"key":"2226_CR43","first-page":"1720","volume":"27","author":"CX Yang","year":"2010","unstructured":"Yang CX, Wang N (2010) Berth-quay crane allocation in container terminal based on multi-objective genetic algorithm. Appl Res Comput 27:1720\u20131722","journal-title":"Appl Res Comput"},{"key":"2226_CR44","first-page":"86","volume":"30","author":"F Xue","year":"2011","unstructured":"Xue F, Chen G, Gao S (2011) Solving 0\u20131 integer programming problem by hybrid particle swarm optimization algorithm. Comput Technol Autom 30:86\u201389","journal-title":"Comput Technol Autom"},{"key":"2226_CR45","first-page":"59","volume":"34","author":"HJ Zhang","year":"2012","unstructured":"Zhang HJ, Le ML (2012) Research on container berth-quay crane allocation based on multi-objective PSO. J Wuhan Univ Technol 34:59\u201364","journal-title":"J Wuhan Univ Technol"},{"key":"2226_CR46","first-page":"17","volume":"17","author":"JL Peng","year":"2014","unstructured":"Peng JL, Li RJ, Li XL, Ju CH (2014) A Study of archipelago berth allocation based on hybrid particle swarm optimization algorithm. Ind Eng J 17:17\u201322","journal-title":"Ind Eng J"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-016-2226-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2226-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2226-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2226-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T22:21:29Z","timestamp":1559082089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-016-2226-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,2]]},"references-count":46,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["2226"],"URL":"https:\/\/doi.org\/10.1007\/s00521-016-2226-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,2]]}}}