{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T13:01:20Z","timestamp":1783515680815,"version":"3.55.0"},"reference-count":66,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100010023","name":"Natural Science Research of Jiangsu Higher Education Institutions of China","doi-asserted-by":"publisher","award":["23KJB520018"],"award-info":[{"award-number":["23KJB520018"]}],"id":[{"id":"10.13039\/501100010023","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U23B2058"],"award-info":[{"award-number":["U23B2058"]}],"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":["62303231"],"award-info":[{"award-number":["62303231"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013280","name":"Major Basic Research Project of the Natural Science Foundation of the Jiangsu Higher Education Institutions","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013280","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Jiangsu Province Natural Science Foundation","doi-asserted-by":"publisher","award":["BK20230419"],"award-info":[{"award-number":["BK20230419"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Swarm and Evolutionary Computation"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1016\/j.swevo.2025.102241","type":"journal-article","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T16:59:19Z","timestamp":1764608359000},"page":"102241","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Evolutionary reinforcement learning with density-based behavioral diversity enhancement for berth allocation and crane assignment"],"prefix":"10.1016","volume":"100","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-2121-5593","authenticated-orcid":false,"given":"Shengchang","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6627-2514","authenticated-orcid":false,"given":"Peilan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenglong","family":"Ding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ziqian","family":"Kong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8357-1655","authenticated-orcid":false,"given":"Wenjian","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.swevo.2025.102241_b1","doi-asserted-by":"crossref","first-page":"2938","DOI":"10.1109\/TITS.2020.3023701","article-title":"A bi-objective optimization for integrated berth allocation and quay crane assignment with preventive maintenance activities","volume":"23","author":"Li","year":"2020","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"10.1016\/j.swevo.2025.102241_b2","series-title":"Proceedings of the 2009 International Conference on Artificial Intelligence and Computational Intelligence","first-page":"48","article-title":"An investigation into berth allocation and quay crane assignment based on hybrid parallel genetic algorithm","volume":"vol. 2","author":"He","year":"2009"},{"key":"10.1016\/j.swevo.2025.102241_b3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.cie.2015.04.033","article-title":"A new continuous berth allocation and quay crane assignment model in container terminal","volume":"89","author":"Han","year":"2015","journal-title":"Comput. Ind. Eng."},{"issue":"7\u20139","key":"10.1016\/j.swevo.2025.102241_b4","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1007\/s10472-021-09743-5","article-title":"A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals","volume":"90","author":"Nourmohammadzadeh","year":"2022","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"10.1016\/j.swevo.2025.102241_b5","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/j.ejor.2021.03.016","article-title":"An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times","volume":"295","author":"Rodrigues","year":"2021","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.swevo.2025.102241_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110397","article-title":"An accelerated benders decomposition algorithm for the integrated storage space assignment, berth allocation, and yard crane deployment problem","volume":"194","author":"Soroushnia","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.swevo.2025.102241_b7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.tre.2015.06.008","article-title":"Integrated berth allocation and quay crane assignment problem: Set partitioning models and computational results","volume":"81","author":"Iris","year":"2015","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"4","key":"10.1016\/j.swevo.2025.102241_b8","doi-asserted-by":"crossref","first-page":"495","DOI":"10.3390\/jmse10040495","article-title":"Discretization-strategy-based solution for berth allocation and quay crane assignment problem","volume":"10","author":"Tang","year":"2022","journal-title":"J. Mar. Sci. Eng."},{"key":"10.1016\/j.swevo.2025.102241_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2022.101733","article-title":"Hybrid rolling-horizon optimization for berth allocation and quay crane assignment with unscheduled vessels","volume":"54","author":"Ji","year":"2022","journal-title":"Adv. Eng. Inform."},{"key":"10.1016\/j.swevo.2025.102241_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110827","article-title":"An innovative framework for optimizing discrete berth allocation and quay crane assignment problems","volume":"200","author":"Xiang","year":"2025","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.swevo.2025.102241_b11","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1177\/0037549714558128","article-title":"Integrated strategy for berth allocation and crane assignment on a continuous berth using Monte Carlo simulation","volume":"91","author":"Ji","year":"2015","journal-title":"Simulation"},{"key":"10.1016\/j.swevo.2025.102241_b12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.tre.2017.06.013","article-title":"Improved formulations and an adaptive large neighborhood search heuristic for the integrated berth allocation and quay crane assignment problem","volume":"105","author":"Iris","year":"2017","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"10.1016\/j.swevo.2025.102241_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110699","article-title":"A modified adaptive large neighborhood search algorithm for solving the multi-port continuous berth allocation problem with vessel speed optimization","volume":"198","author":"Ji","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.swevo.2025.102241_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2024.103456","article-title":"Integrated planning of berth allocation, quay crane assignment and yard assignment in multiple cooperative terminals","volume":"183","author":"Guo","year":"2024","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"9","key":"10.1016\/j.swevo.2025.102241_b15","doi-asserted-by":"crossref","first-page":"2885","DOI":"10.1109\/TCYB.2017.2669334","article-title":"Modified NSGA-II for solving continuous berth allocation problem: Using multiobjective constraint-handling strategy","volume":"47","author":"Ji","year":"2017","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.swevo.2025.102241_b16","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106672","article-title":"Integrated continuous berth allocation and quay crane assignment and scheduling problem with time-dependent physical constraints in container terminals","volume":"147","author":"Malekahmadi","year":"2020","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.swevo.2025.102241_b17","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/TITS.2022.3213834","article-title":"An enhanced NSGA-II for solving berth allocation and quay crane assignment problem with stochastic arrival times","volume":"24","author":"Ji","year":"2022","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"12","key":"10.1016\/j.swevo.2025.102241_b18","doi-asserted-by":"crossref","first-page":"13572","DOI":"10.1109\/TCYB.2021.3111082","article-title":"Deep reinforcement learning for solving the heterogeneous capacitated vehicle routing problem","volume":"52","author":"Li","year":"2022","journal-title":"IEEE Trans. Cybern."},{"issue":"12","key":"10.1016\/j.swevo.2025.102241_b19","doi-asserted-by":"crossref","first-page":"13142","DOI":"10.1109\/TCYB.2021.3103811","article-title":"Deep reinforcement learning for combinatorial optimization: Covering salesman problems","volume":"52","author":"Li","year":"2022","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.swevo.2025.102241_b20","series-title":"Proceedings of the 2021 International Joint Conference on Neural Networks","first-page":"1","article-title":"Policy optimization for berth allocation problems","author":"Cervellera","year":"2021"},{"issue":"5","key":"10.1016\/j.swevo.2025.102241_b21","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.3390\/jmse11051025","article-title":"Optimizing berth allocation in maritime transportation with quay crane setup times using reinforcement learning","volume":"11","author":"Dai","year":"2023","journal-title":"J. Mar. Sci. Eng."},{"issue":"3","key":"10.1016\/j.swevo.2025.102241_b22","article-title":"An improved deep reinforcement learning approach: A case study for optimisation of berth and yard scheduling for bulk cargo terminal","volume":"18","author":"Ai","year":"2023","journal-title":"Adv. Prod. Eng. Manag."},{"key":"10.1016\/j.swevo.2025.102241_b23","series-title":"Evolutionary reinforcement learning","author":"Khadka","year":"2018"},{"key":"10.1016\/j.swevo.2025.102241_b24","series-title":"Evolution strategies as a scalable alternative to reinforcement learning","author":"Salimans","year":"2017"},{"key":"10.1016\/j.swevo.2025.102241_b25","doi-asserted-by":"crossref","unstructured":"Z. Chen, Y. Zhou, X. He, S. Jiang, A Restart-based Rank-1 Evolution Strategy for Reinforcement Learning, in: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI, 2019, pp. 2130\u20132136.","DOI":"10.24963\/ijcai.2019\/295"},{"key":"10.1016\/j.swevo.2025.102241_b26","unstructured":"S. Wu, J. Yao, H. Fu, Y. Tian, C. Qian, Y. Yang, Q. Fu, Y. Wei, Quality-Similar Diversity via Population Based Reinforcement Learning, in: International Conference on Learning Representations, ICLR, 2023."},{"key":"10.1016\/j.swevo.2025.102241_b27","article-title":"Improving exploration in evolution strategies for deep reinforcement learning via a population of novelty-seeking agents","volume":"31","author":"Conti","year":"2018","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.swevo.2025.102241_b28","series-title":"QD-RL: Efficient mixing of quality and diversity in reinforcement learning","first-page":"36","author":"Cideron","year":"2020"},{"key":"10.1016\/j.swevo.2025.102241_b29","unstructured":"Y. Wang, K. Xue, C. Qian, Evolutionary diversity optimization with clustering-based selection for reinforcement learning, in: International Conference on Learning Representations, ICLR, 2021."},{"key":"10.1016\/j.swevo.2025.102241_b30","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s10479-018-3125-3","article-title":"The integrated berth allocation, quay crane assignment and scheduling problem: mathematical formulations and a case study","volume":"291","author":"Abou Kasm","year":"2020","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"10.1016\/j.swevo.2025.102241_b31","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.ejor.2017.05.040","article-title":"MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem","volume":"264","author":"Agra","year":"2018","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.swevo.2025.102241_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2021.102455","article-title":"An almost robust optimization model for integrated berth allocation and quay crane assignment problem","volume":"104","author":"Xiang","year":"2021","journal-title":"Omega"},{"key":"10.1016\/j.swevo.2025.102241_b33","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.cie.2016.04.008","article-title":"Behavior perception-based disruption models for berth allocation and quay crane assignment problems","volume":"97","author":"Liu","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.swevo.2025.102241_b34","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.cie.2018.09.033","article-title":"Reactive strategy for discrete berth allocation and quay crane assignment problems under uncertainty","volume":"126","author":"Xiang","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.swevo.2025.102241_b35","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2021.101252","article-title":"Modeling berth allocation and quay crane assignment considering QC driver cost and operating efficiency","volume":"47","author":"He","year":"2021","journal-title":"Adv. Eng. Inform."},{"key":"10.1016\/j.swevo.2025.102241_b36","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.swevo.2015.11.002","article-title":"A HPSO for solving dynamic and discrete berth allocation problem and dynamic quay crane assignment problem simultaneously","volume":"27","author":"Hsu","year":"2016","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2025.102241_b37","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.109910","article-title":"Berth and quay cranes allocation problem with on-shore power supply assignment in container terminals","volume":"188","author":"Wang","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.swevo.2025.102241_b38","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2025.104365","article-title":"Multi-terminal continuous and dynamic berth allocation problem considering tidal time windows and channel constraints","volume":"203","author":"Ran","year":"2025","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"10.1016\/j.swevo.2025.102241_b39","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2025.104104","article-title":"An intelligent hyperheuristic algorithm for the berth allocation and scheduling problem at marine container terminals","volume":"198","author":"Li","year":"2025","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"10.1016\/j.swevo.2025.102241_b40","article-title":"Swarm optimization with intra-and inter-hierarchical competition for large-scale berth allocation and crane assignment","author":"Zou","year":"2025","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"10.1016\/j.swevo.2025.102241_b41","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2022.102722","article-title":"Applications of machine learning methods in port operations\u2013a systematic literature review","volume":"161","author":"Filom","year":"2022","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"10.1016\/j.swevo.2025.102241_b42","doi-asserted-by":"crossref","DOI":"10.1016\/j.ocecoaman.2024.107484","article-title":"Dual strategies-based resilience enhancement in a bulk cargo port under dynamic machinery failure scenarios with reinforcement learning","volume":"260","author":"Lv","year":"2025","journal-title":"Ocean & Coastal Management"},{"key":"10.1016\/j.swevo.2025.102241_b43","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2024.103152","article-title":"A novel multi-attention reinforcement learning for the scheduling of unmanned shipment vessels (USV) in automated container terminals","volume":"129","author":"Zhu","year":"2024","journal-title":"Omega"},{"issue":"3","key":"10.1016\/j.swevo.2025.102241_b44","doi-asserted-by":"crossref","first-page":"2625","DOI":"10.1109\/TETCI.2024.3369485","article-title":"Path planning for unmanned aerial vehicle via off-policy reinforcement learning with enhanced exploration","volume":"8","author":"Wang","year":"2024","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"issue":"3","key":"10.1016\/j.swevo.2025.102241_b45","doi-asserted-by":"crossref","first-page":"1984","DOI":"10.1109\/TCYB.2023.3312476","article-title":"Multiobjective combinatorial optimization using a single deep reinforcement learning model","volume":"54","author":"Wang","year":"2023","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.swevo.2025.102241_b46","doi-asserted-by":"crossref","DOI":"10.1016\/j.ocecoaman.2024.107113","article-title":"Dynamic berth allocation under uncertainties based on deep reinforcement learning towards resilient ports","volume":"252","author":"Lv","year":"2024","journal-title":"Ocean & Coastal Management"},{"issue":"23","key":"10.1016\/j.swevo.2025.102241_b47","doi-asserted-by":"crossref","first-page":"3742","DOI":"10.3390\/math12233742","article-title":"Discrete dynamic berth allocation optimization in container terminal based on deep Q-network","volume":"12","author":"Wang","year":"2024","journal-title":"Mathematics"},{"key":"10.1016\/j.swevo.2025.102241_b48","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2025.104089","article-title":"Modeling and solving the joint berth allocation and vessel sequencing problem with speed optimization in a busy seaport","volume":"197","author":"Liu","year":"2025","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"9","key":"10.1016\/j.swevo.2025.102241_b49","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.3390\/electronics11091390","article-title":"Intelligent scheduling method for bulk cargo terminal loading process based on deep reinforcement learning","volume":"11","author":"Li","year":"2022","journal-title":"Electronics"},{"issue":"3","key":"10.1016\/j.swevo.2025.102241_b50","doi-asserted-by":"crossref","first-page":"121","DOI":"10.3390\/info13030121","article-title":"Discrete event modeling and simulation for reinforcement learning system design","volume":"13","author":"Capocchi","year":"2022","journal-title":"Information"},{"key":"10.1016\/j.swevo.2025.102241_b51","article-title":"Attention is all you need","volume":"30","author":"Vaswani","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.swevo.2025.102241_b52","series-title":"Learning phrase representations using RNN encoder-decoder for statistical machine translation","author":"Cho","year":"2014"},{"key":"10.1016\/j.swevo.2025.102241_b53","article-title":"Pointer networks","volume":"28","author":"Vinyals","year":"2015","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"2","key":"10.1016\/j.swevo.2025.102241_b54","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1109\/TCYB.2019.2907657","article-title":"Differential evolution for multimodal optimization with species by nearest-better clustering","volume":"51","author":"Lin","year":"2021","journal-title":"IEEE Trans. Cybern."},{"issue":"7","key":"10.1016\/j.swevo.2025.102241_b55","doi-asserted-by":"crossref","first-page":"6707","DOI":"10.1109\/TCYB.2020.3032995","article-title":"Hybridizing niching, particle swarm optimization, and evolution strategy for multimodal optimization","volume":"52","author":"Luo","year":"2022","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.swevo.2025.102241_b56","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1214\/aoms\/1177728190","article-title":"Remarks on some nonparametric estimates of a density function","author":"Rosenblatt","year":"1956","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/j.swevo.2025.102241_b57","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2021.100971","article-title":"An alternative way of evolutionary multimodal optimization: density-based population initialization strategy","volume":"67","author":"Xu","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2025.102241_b58","series-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"key":"10.1016\/j.swevo.2025.102241_b59","series-title":"Continuous control with deep reinforcement learning","author":"Lillicrap","year":"2015"},{"key":"10.1016\/j.swevo.2025.102241_b60","series-title":"International Conference on Machine Learning","first-page":"387","article-title":"Deterministic policy gradient algorithms","author":"Silver","year":"2014"},{"key":"10.1016\/j.swevo.2025.102241_b61","series-title":"Playing atari with deep reinforcement learning","author":"Mnih","year":"2013"},{"issue":"1","key":"10.1016\/j.swevo.2025.102241_b62","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/106365603321828970","article-title":"Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES)","volume":"11","author":"Hansen","year":"2003","journal-title":"Evol. Comput."},{"issue":"7","key":"10.1016\/j.swevo.2025.102241_b63","doi-asserted-by":"crossref","first-page":"2018","DOI":"10.3390\/su11072018","article-title":"A hybrid GA with variable quay crane assignment for solving berth allocation problem and quay crane assignment problem simultaneously","volume":"11","author":"Hsu","year":"2019","journal-title":"Sustainability"},{"key":"10.1016\/j.swevo.2025.102241_b64","series-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014"},{"key":"10.1016\/j.swevo.2025.102241_b65","first-page":"255","article-title":"KEEL data-mining software tool: Data set repository, integration of algorithms and experimental analysis framework","volume":"17","author":"Derrac","year":"2015","journal-title":"J. Mult.-Valued Logic Soft Comput."},{"key":"10.1016\/j.swevo.2025.102241_b66","first-page":"8198","article-title":"One solution is not all you need: Few-shot extrapolation via structured maxent rl","volume":"33","author":"Kumar","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."}],"container-title":["Swarm and Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650225003980?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650225003980?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T14:47:49Z","timestamp":1773845269000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2210650225003980"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":66,"alternative-id":["S2210650225003980"],"URL":"https:\/\/doi.org\/10.1016\/j.swevo.2025.102241","relation":{},"ISSN":["2210-6502"],"issn-type":[{"value":"2210-6502","type":"print"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Evolutionary reinforcement learning with density-based behavioral diversity enhancement for berth allocation and crane assignment","name":"articletitle","label":"Article Title"},{"value":"Swarm and Evolutionary Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.swevo.2025.102241","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102241"}}