Faculty

Faculty

Zhou Yangming

Associate Professor

Office Phone:
Address:No.1954, Huashan Road, Xuhui District, Shanghai
E-mail:yangming.zhou[at].sjtu.edu.cn

Education Background
2014 – 2018: Ph. D, Department of Computer Science, University of Angers, France
2011 – 2014: MA. Eng, Department of Control Science and Engineering, Zhejiang University, China
2007 – 2011: B.S., Department of Automation, Donghua University, China
Work Experience
2024 – now: Associate Professor, Shanghai Jiao Tong University
2021 – 2023: Assistant Professor, Shanghai Jiao Tong University
2018 – 2021: Assistant Professor, East China University of Science and Technology
Research Interests
Combinatorial optimization, evolutionary computation, intelligent optimization, meta-heuristics, machine learning, and their applications to transportation and logistics.
Research Project
[1]. National Natural Science Foundation of China (NSFC), General Program (Project No.72371157),2024-2027, PI.
[2]. National Natural Science Foundation of China (NSFC), Youth Program (Project No.61903144),2020-2022, PI.
[3]. Shanghai Pujiang Program (Category C) (Project No.23PJC070), 2023-2026, PI.
[4]. Macau Young Scholars Program (Project No.AM2020011), 2021-2022, PI.
[5]. Shanghai Sailing Program (No.19YF1412400), 2019-2022, PI.
[6]. Shenzhen Institute of Artificial Intelligence and Robotics, Open Program (Project No.AC01202005002), PI.
[7]. National Key R&D Program of China (Project No.2018AAA0101300), 2019-2022
[8]. Fundo Para o Desenvolvimento das Ciências da Tecnologia (FDCT), (Project No. 0047/2021/A1), 2021-2024
[9]. CITIC Heavy Industry Program (Project No. 21-2288), 2021-2022
Publications
He has over 40 publications, including journal papers on INFORMS JOC (UTD-24, Featured Article), INFORMS TS, EJOR, IEEE TEVC, IEEE TCYB, IEEE TSMC, IEEE TITS, IEEE TASE, IEEE TCCS, etc. His Google Scholar is 1400+ (h-index 19 and i10-index 29)
2024
[1].Yangming Zhou, Jiaqi Li, Jin-Kao Hao*, and Fred Glover* (2024). Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search. . INFORMS Journal on Computing, 36(1):39-40 (UTD-24, Featured Article).  ResearchGate
[2].Yangming Zhou, Wenqiang Xu, MengChu Zhou, and Zhang-Hua Fu* (2024). Bi-trajectory Hybrid Search to Solve Bottleneck-minimized Colored Traveling Salesman Problems. IEEE Transactions on Automation Science and Engineering,21(1):895-905.  ResearchGate
[3].Yuning Chen, Junhua Xue, Yangming Zhou*, and Qinghua Wu (2024). An Efficient Threshold Acceptance-based Multi-layer Search Algorithm for Capacitated Electric Vehicle Routing Problem. IEEE Transactions on Intelligent Transportation Systems, Online.  ResearchGate

2023
[4].Yangming Zhou, Jin-Kao Hao*, Zhen Li, and Fred Glover (2023). Heuristic Search for Rank Aggregation with Application to Label Ranking. INFORMS Journal on Computing, Online. (UTD-24).  ResearchGate
[5].Yangming Zhou, Yawen Kou, and MengChu Zhou* (2023). Bilevel Memetic Search Approach for Soft-Clustered Vehicle Routing Problem. Transportation Science, 57(3):701-716.  ResearchGate
[6].Yangming Zhou, Gezi Wang, Jin-Kao Hao, Na Geng, and Zhibin Jiang* (2023). A Fast Tri-individual Memetic Search for the Distance-based Critical Node Problem. European Journal of Operational Research, 308(2):540-554.  ResearchGate
[7].Yangming Zhou, Xiaze Zhang, Na Geng, Zhibin Jiang, Shouguang Wang, and MengChu Zhou* (2023). Frequent Itemset-Driven Search for Finding Minimal Node Separators and Its Application to Air Transportation Network Analysis. IEEE Transactions on Intelligent Transportation Systems, 24(8):8348-8360.  ResearchGate
[8].Yangming Zhou, Gezi Wang, and MengChu Zhou* (2023). Detecting k-Vertex Cuts in Sparse Networks via a Fast Local Search Approach. IEEE Transactions on Computational Social Systems, Online.  ResearchGate

2022
[9].Yangming Zhou, Wenqiang Xu, Zhang-Hua Fu, and MengChu Zhou* (2022). Multi-neighborhood Simulated Annealing-based Iterated Local Search for Colored Traveling Salesman Problems. IEEE Transactions on Intelligent Transportation Systems, 23(9):16072-16082.  ResearchGate
[10].Yangming Zhou, Jin-Kao Hao*, and Beatrice Duval (2022). Frequent Pattern Based Search: A Case Study on the Quadratic Assignment Problem. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 52(3):1503-1515.  ResearchGate

2021
[11].Yangming Zhou, Jin-Kao Hao*, Zhang-Hua Fu*, Zhe Wang, and Xiangjing Lai (2021). Variable Population Memetic Search: A Case Study on the Critical Node Problem. IEEE Transactions on Evolutionary Computation, 25(1):187-200.  ResearchGate
[12].Yangming Zhou, Zhe Wang, Yan Jin, and Zhang-Hua Fu* (2021). Late Acceptance-based Heuristic Algorithms for Identifying Critical Nodes of Weighted Graphs. Knowledge-Based Systems, 211:106562.  ResearchGate
Teaching
[1].《Artificial Intelligence and its Applications》 (Graduate Course)
[2].《Big Data and Internet of Things》 (Graduate Course)
[3].《Computer Programming》 (Undergraduate Course)
Part-time Academic Job
[1]. Industry Chairs of IEEE iCaMaL 2024
[2]. Reviewers of IEEE TKDE, IEEE TASE, IEEE TITS, IEEE TSMC, IEEE, ACM TELO, IEEE/CAA JAS, COR, PR, BKS, etc.
[3]. Outstanding Reviewer of Knowledge-Based Systems Journal (2017)
Awards and Honors
[1]. Shanghai Pujiang Program (2023)
[2]. Macau Young Scholars Program (2020)
[3]. Young Talents Program (Category A) (2019)
[4]. Shanghai Sailing Program (2019)
[5]. Outstanding Reviewer of Knowledge-Based Systems Journal (2017)
Copyright © 2018 上海交大中美物流研究院 版权所有
Shared by

Fax:021-62932117 
Tel:021-62932115 62932399 
E-mail:sugli@sjtu.edu.cn