赖向京，研究员（正高四级），2018年入选江苏省“六大人才高峰”高层次人才。至今，赖向京以第一或通信作者发表学术论文40余篇，其中以第一作者在 INFORMS Journal On Computing (UTD24, 2篇) ，European Journal of Operational Research (ABS 4星, 5 篇), Computers & Operations Research (ABS 3 星, 5篇) 等国际知名学术期刊上发表 SCI 论文 30 篇；获得了国际自动控制联合会（IFAC）颁发的 EAAI 期刊（IFAC 会刊）最佳论文奖 1 项；主持了国家自然科学基金、江苏省自然科学基金等科研项目 6 项，参与国家自然科学基金重点项目 1 项、国家自然科学基金物理专项基金 1 项；获国家发明专利 7 项。

研究方向： 

运筹与优化，连续优化，组合优化，启发式搜索，物流中的路径规划. 

代表作：

1. Xiangjing Lai (赖向京), Z. Lin, J.K. Hao, Q.H. Wu. An efficient optimization model and tabu search– based global optimization approach for the continuous p-dispersion problem. INFORMS Journal On Computing, 2024, DOI: https://doi.org/10.1287/ijoc.2023.0089. (SCI, UTD24)

2. Xiangjing Lai (赖向京), J.K. Hao, R.B. Xiao, F. Glover. Perturbation-based thresholding search for packing equal circles and spheres. INFORMS Journal On Computing, 2023, 35(4), 725-746. (SCI, UTD24，封面论文)

3. Xiangjing Lai (赖向京), Lei Wang, J.K. Hao, Q.H. Wu, An effective evolutionary algorithm for packing rectangles into a fixed-size circular container, European Journal of Operational Research, 2025, https://doi.org/10.1016/j.ejor.2025.04.044. (SCI, ABS 4)

4. Xiangjing Lai  (赖向京), J.K. Hao, D. Yue, Z.P. Lü, Z.H. Fu. Iterated dynamic thresholding search for packing equal circles into a circular container. European Journal of Operational Research, 2022, 299:137-153. (SCI, ABS4)

5. Xiangjing Lai (赖向京), J.K. Hao, Z.H. Fu, D. Yue, A neighborhood decomposition based variable neighborhood and tabu search for the maximally diverse grouping problem, European Journal of Operational Research, 289(3): 1067-1086, 2021 (SCI, ABS4)

6. Xiangjing Lai (赖向京), J.K. Hao, D. Yue, Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem, European Journal of Operational Research, 2019, 274: 35-48. (SCI, ABS 4)

7. Xiangjing Lai (赖向京), J.K. Hao, Iterated maxima search for the maximally diverse grouping problem, European Journal of Operational Research, 2016, 254(3): 780-800. (SIC,  ABS4)  

8. Xiangjing Lai (赖向京), J.K. Hao, Z.H. Fu, D. Yue, Neighborhood decomposition-driven variable neighborhood search for capacitated clustering. Computers & Operations Research, 134: 105362, 2021. (ABS3, SCI)

9. Xiangjing Lai (赖向京), J.K. Hao, Iterated variable neighborhood search for the capacitated clustering problem,  Engineering Applications of Artificial Intelligence, 2016, 56:102-120. (SCI, JCR 1 区, 获该期刊2014-2016年度 最佳论文奖，由国际控制联合会（IFAC） 颁发)

10. Z. Gao, F. Deng, Z.H. Fu, Xiangjing Lai* (赖向京，通讯作者), Q. Wu，A problem reduction based memetic algorithm for the vehicle routing problem with discrete split deliveries and pickups.Computers & Operations Research, 182, 107106, 2025. (ABS3, SCI)