计算智能、数据挖掘、生物信息学和计算机应用

本科课程：

《Java语言程序设计》

《Java应用开发基础》

研究生课程：

《机器学习与智能计算》

《数据挖掘》

1、福建省自然科学基金项目，2023J01078，强化学习增强的树编码粒子群优化算法及其应用研究，2023 - 2026，主持

2、福建农林大学科技创新专项基金，KFB23192,自适应文化基因算法及其应用研究，2023 - 2026，主持

3、福建省自然科学基金项目，2019J01401，基于列表和外部文档的自适应模拟退火算法及其在复杂优化问题中的应用，2019 - 2022，主持

4、福建省自然科学基金项目，2019J01661，GPU加速的数据库查询优化研究，2019 - 2022，排名第二

5、福建农林大学科技创新专项基金，基于列表的自适应模拟退火算法及其并行化研究，2017 - 2019，主持

6、福建农林大学科技创新专项基金，农林大数据应用关键技术研究，2017 - 2019，主持

7、区域发展项目、2015N3011、智能森林资源生态管理系统开发与应用，2015年04月01日— 2017年03月31日，技术负责人

8、福建省自然科学基金项目、2015J01233、一种个体表达为区间数的群智能优化算法研究、2015年04月01日— 2018年03月31日，排名第二

Chenwei Zhu; Yu Lin; Fuyuan Zheng; Juan Lin; Yiwen Zhong(Corresponding). An Adaptive Multi-Meme Memetic Algorithm for the prize-collecting generalized minimum spanning tree problem[J]. Swarm and Evolutionary Computation, 2024,Vol.90: 101664. https://doi.org/10.1016/j.swevo.2024.101664

Juan Lin, Ailing Shen, Liangcheng Wu & Yiwen Zhong(Corresponding). Learning-based simulated annealing algorithm for unequal area facility layout problem. Soft Comput 28, 5667–5682 (2024). https://doi.org/10.1007/s00500-023-09372-6

Hong, Li & Zhong, Yiwen (Corresponding) & Lin, Sannuo. (2023). Simulated Annealing Algorithm for the Bounded Diameter Minimum Spanning Tree Problem. 215-218. https://doi.org/10.1145/3583133.3590575.

Ailing Shen, Juan Lin, and Yiwen Zhong(Corresponding). 2022. External archive hybrid genetic algorithm for unequal area facility layout problem. In Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO '22). Association for Computing Machinery, New York, NY, USA, 204–207. https://doi.org/10.1145/3520304.3528971

Xinhua Yang, Yufan Zhou, Ailing Shen, Juan Lin, Yiwen Zhong(Corresponding). 2021. A hybrid ant colony optimization algorithm for the knapsack problem with a single continuous variable. GECCO’21: Proceedings of the Genetic and Evolutionary Computation Conference, 57–65. https://doi.org/10.1145/3449639.3459343

杨新花,周昱帆,沈爱玲,林娟,钟一文(通信作者).基于拉马克进化的差分进化算法求解KPC问题. 计算机工程与应用. 2020录用.

张铭,邓文瀚,林娟,钟一文(通信作者).改进蚁群优化算法求解折扣{0-1}背包问题[J/OL]. 计算机工程与应用. 2020录用.

邓文瀚,张铭,王李进,钟一文(通信作者).混合群体增量学习算法求解闭环布局问题[J].计算机应用,2021,41(01):95-102.

L. Wang, R. Cai, M. Lin and Y. Zhong(Corresponding), Enhanced List-Based Simulated Annealing Algorithm for Large-Scale Traveling Salesman Problem, in IEEE Access, vol. 7, pp. 144366-144380, 2019. doi: 10.1109/ACCESS.2019.2945570, Source Code:  https://github.com/yiwzhong/ELBSA4TSP

Zhan, S., Wang, L., Zhang, Z., Zhong Y.( Corresponding). Noising methods with hybrid greedy repair operator for 0–1 knapsack problem, Memetic Comp. (2019). https://doi.org/10.1007/s12293-019-00288-z, Source Code:  https://github.com/yiwzhong/NM4KP

Yiwen Zhong, Lijin Wang, Min Lin, Hui Zhang, Discrete pigeon-inspired optimization algorithm with Metropolis acceptance criterion for large-scale traveling salesman problem, Swarm and Evolutionary Computation, 2019, https://doi.org/10.1016/j.swevo.2019.04.002.

S. Zhan, Z. Zhang, L. Wang and Y. Zhong (Corresponding), List-based Simulated Annealing Algorithm with Hybrid Greedy Repair and Optimization Operator for 0-1 Knapsack Problem, in IEEE Access. doi: 10.1109/ACCESS.2018.2872533

Zhong Y, Lin J, Wang L, et al. Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem[J]. Swarm and evolutionary computation, 2018: 77-88.

Lin Juan, Zhong Yiwen, Li Erna, et al. Multi-Agent Simulated Annealing Algorithm with Parallel Adaptive Multiple Sampling for Protein Structure Prediction in AB off-lattice model[J]. Applied Soft Computing, 2018, 62: 491-503.

Zhong Y, Lin J, Wang L, et al. Hybrid Discrete Artificial Bee Colony Algorithm with Threshold Acceptance Criterion for Traveling Salesman Problem[J]. Information Sciences, 2017, 421: 70-84.

Zhan, Shihua, et al. Comparative analysis of selection schemes used in artificial bee colony algorithm. International Journal of Computing Science and Mathematics 8.3 (2017): 218-227. (Corresponding)

Wang L, Zhong Y, Yin Y. Nearest neighbour cuckoo search algorithm with probabilistic mutation[J]. Applied Soft Computing, 2016, 49: 498-509.

Zhan, Shi-hua, et al. List-based simulated annealing algorithm for traveling salesman problem. Computational intelligence and neuroscience 2016 (2016): 8. (Corresponding)

Wang, C., Lin, M., Zhong, Y. (Corresponding), & Zhang, H. Swarm simulated annealing algorithm with knowledge-based sampling for travelling salesman problem. International Journal of Intelligent Systems Technologies and Applications 15.1 (2016): 74-94.

Wang, C., Lin, J., Lin, M., & Zhong, Y. (Corresponding). Evolutionary harmony search algorithm with Metropolis acceptance criterion for travelling salesman problem. International Journal of Wireless and Mobile Computing, 2016, 10(2), 166-173.

Yiwen Zhong, Juan Lin, Qingliang Du, Limei Wang. Multi-agent simulated annealing algorithm based on differential perturbation for protein structure prediction problems. Int. J. of Computer Applications in Technology[J], 2015 Vol.51, No.3, pp.164 - 172