现 任：计算机与大数据学院教授
研究方向：计算广告、智能推荐
所在院系：计算机与大数据公司
学历学位：理学博士
访学经历：香港城市大学、University of the Witwatersrand、University of Exeter
1、学术成果
论文、专著：
[1] Huang Yunhu, Lin Geng, Chen Dewang,Zhao Wendi. Deep Neural-Fuzzy System Algorithms with Improved Interpretability for Classification Problems. International Journal of Fuzzy Systems, 26(3): 900-921, 2024.
[2] Fan Linyuan, Ji Dandan, Lin Geng, Lin Peng, Liu Lixi. Information gap-based multi-objective optimization of a virtual energy hub plant considering a developed demand response model.Energy, Volume 276, 127462, 2023.
[3] Haiping Xu, Geng Lin. Incorporating global multiplicative decomposition and local statistical information for brain tissue segmentation and bias field estimation. Knowledge-Based Systems, 223, 107070, 2021.
[4] Geng Lin, Haiping Xu, Xiang Chen, Jian Guan. An effective binary artificial bee colony algorithm for maximum set k-covering problem. Expert Systems with Applications, 113717, 2020.
[5] Guan Jian, Lin Geng, Feng H. B., Ruan Z. Q. A decomposition-based algorithm for the double row layout problem. Applied Mathematical Modelling, 77, Part 1: 963-979, 2020.
[6] 林耿. 求解最大二等分问题的混合二进制人工蜂群算法. 浙江大学学报理学版, 46(5): 556-564, 2019.
[7] Lin Geng, Guan Jian, Li Zuoyong, Feng H.B.. A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem. Expert Systems With Applications, 135: 201-211, 2019.
[8] Guan Jian, Lin Geng, Feng H.B.. A multi-start iterated local search algorithm for the uncapacitated single allocation hub location problem. Applied Soft Computing, 73: 230-241, 2018.
[9] Lin Geng, Guan Jian. A hybrid binary particle swarm optimization for the obnoxious p-median problem. Information Sciences, 425: 1-17, 2018.
[10] Lin Geng, Guan Jian. Solving maximum set k-covering problem by an adaptive binary particle swarm optimization method. Knowledge-Based Systems, 142: 95-107, 2018.
[11] Lin Geng, Zhu Wenxing, Montaz M. Ali. An Effective Hybrid Memetic Algorithm for the Minimum Weight Dominating Set Problem. IEEE Transactions on Evolutionary Computation, 20(6): 892-907, 2016.
[12] Guan Jian, Lin Geng. Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem. European Journal of Operational Research, 248: 899-909, 2016.
[13] Lin Geng, Zhu Wenxing.An efficient memetic algorithm for the max-bisection problem. IEEE Transactions on Computers, 63(6): 1365-1376, 2014.
课题：
[1] 福建省自然科学基金面上项目,带信息反馈机制的大规模轴辐式网络物流配送优化算法研究，主持人，2024年。
[2] 福建省自然科学基金面上项目,大规模厌恶型p-中位问题的带信息反馈机制的优化算法研究，主持人，2020年。
2、获奖情况
[1]第十四届福建省自然科学优秀学术论文二等奖, 福建省科协, 2020, 排名第1。
3、联系方式：lingeng413@163.com