教育经历 2005.9 - 2009.6：华中科技大学文华学院，本科毕业，获学士学位。 2009.9 - 2012.3：华中科技大学，研究生毕业，获硕士学位。 2011.10 - 2015.5：法国昂热大学，研究生毕业，获博士学位。 工作经历 2015.12 - 2018.10：华中科技大学计算机学院，担任讲师（在职）。 2018.11 - 至今：华中科技大学计算机学院，担任副教授（在职）。

为基于机器学习的优化理论与方法研究、求解大规模组合优化问题的智能计算（邻域搜索、启发式优化、混合进化计算、强化学习等）

基于深度学习的车辆路径算法研究、矩形Packing问题优化算法研究、电路布图优化算法研究、最大团和社团检测优化算法研究、图分割优化算法研究、图染色问题及调度问题的混合进化算法研究、Routing问题的强化学习算法研究等

[1] Xuanhao Pan,Yuandong Ding,Mingxiao Feng,Li Zhao,Lei Song,Jiang Bian.Yan Jin.H-TSP: Hierarchically Solving the Large-Scale Travelling Salesman Problem.Proceedings of the AAAI Conference on Artificial Intelligence (AAAI2023｜February 2023，CCF A类人工智能会议论文）https://www.microsoft.com/en-us/research/publication/h-tsp-hierarchically-solving-the-large-scale-traveling-salesman-problem/, [2] Yan Jin,Yuandong Ding,Xuanhao Pan,Li Zhao,Tao Qin,Lei Song,Jiang Bian.Kun He.Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem.Proceedings of the AAAI Conference on Artificial Intelligence (AAAI2023｜February 2023，CCF A类人工智能会议论文）https://www.microsoft.com/en-us/research/publication/pointerformer-deep-reinforced-multi-pointer-transformer-for-the-traveling-salesman-problem/, [3] Zhou,Yi,Xiao,Mingyu,Guo,Zhenyu,Xu,Jingwei.Jin,Yan.Enumerating Maximal k-Plexes with Worst-Case Time Guarantee.Proceedings of the AAAI Conference on Artificial Intelligence (AAAI),2020,(3):2442-2449 [4] Jin,Yan,He,Kun,Zou,Shenghao.Hao,Jin-Kao,Dosh,Mohammed.Solving the Latin square completion problem by memetic graph coloring.IEEE Transactions on Evolutionary Computation,2019,(6):1015-1028 [5] Qinghua Wu, Qing Zhou, Yan Jin*, Jin-Kao Hao. Minimum sum coloring for large graphs with extraction and backward expansion search. Applied Soft Computing，62:1056-1065, 2018. (SCI， IF 3.541). [6] Kun He, Huan Yang, Yan Jin*, Qian Hu, Pengli Ji. The Orthogonal Packing and Scheduling Problem: Model, Heuristic and Benchmark. IEEE Transactions on Systems, Man, and Cybernetics: Systems, DOI: 10.1109/TSMC.2017.2768072, 2017. (SCI, IF 2.350). [7] Kun He, Mohammed Dosh*, Yan Jin, Shenghao Zou. Packing UnequalCircles into a Square Container based on the Narrow Action Spaces. Science China Information Sciences, accepted, 2017. (SCI, IF 2.350). [8] Pengli Ji, Kun He*, Yan Jin, Hongsheng Lan, Chu-Min Li. An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules. Computers & Operations Research, 2017, 86:110-123. (SCI， IF 2.600). [9] Yan Jin, Jean-Philippe Hamiez, Jin-Kao Hao*. Algorithms for the minimum sum coloring problem: a review. Artificial Intelligence Review, 47(3): 367-394, 2017 . (SCI, IF 2.627). [10] Yan Jin, Jin-Kao Hao*. Hybrid evolutionary search for the minimum sum coloring problem of graphs. Information Sciences, 352-353: 15-34, 2016. (SCI，IF 4.832).