Ph. D. from Huazhong University of Science and Technology (Computer Science and Technology), 2011

M. Eng. from Huazhong University of Science and Technology (Computer Software and Theory), 2007

B. Eng. from Huazhong University of Science and Technology (Communications Engineering), 2005

Zhanghua Fu received his B. Eng. (communication engineering), M. Eng. (computer science), Ph. D. (computer science) degrees from Huazhong University of Science and Technology, respectively in 2005, 2007 and 2011. From February 2012 to August 2015, he worked as a post-doctoral researcher in university of Angers, France. In May 2018, he joined the Chinese University of Hongkong, Shenzhen, and is currently a research associate professor. He is also the director of the multi-agent collaboration center in Shenzhen Institute of Artificial Intelligence and Robotics for Society (AIRS). His research interests include operations research, machine learning, multi-robots system, etc. In 2014, he won several tracks of the 11th DIMACS Implementation Challenge. In 2023, he won the “Spark Award” granted by HUAWEI (highest level). He has undertaken (as the PI) more than ten projects, funded by the government or commissioned by well-known enterprises.

1. Zhanghua Fu, K.B. Qiu, H.Y. Zha. Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances, In Proceedings of AAAI2021, 35(8): 7474-7482, February 2-9, 2021, Online Conference (Due to COVID-19).
2. Zhanghua Fu, J.K. Hao. Swap-Vertex Based Neighborhood for Steiner Tree Problems. Mathematical Programming Computation, 2017, 9(2):1-24.
3. Zhanghua Fu, J.K. Hao. Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenue, Budget and Hop Constraints. INFORMS Journal on Computing, 2015, 27(2), 221-237.
4. Zhanghua Fu, J.K. Hao. Breakout Local Search for the Steiner Tree Problem with Revenue, Budget and Hop Constraints. European Journal of Operational Research. 2014, 232(1), 209-220.
5. Zhanghua Fu* (corresponding author), W.Q. Huang, Z.P. Lü. Iterated Tabu Search for the Circular Open Dimension Problem. European Journal of Operational Research. 2013, 225(2), 236-243.
6. Y.M. Zhou, W.Q. Xu, M.C. Zhou, Zhanghua Fu* (Corresponding Author). Bi-trajectory Hybrid Search to Solve Bottleneck-minimized Colored Traveling Salesman Problems. IEEE Transactions on Automation Science and Engineering, 2024, 21(1), 895-905.
7. J.T. Ren, J.K. Hao, F. Wu, Zhanghua Fu* (Corresponding Author). Effective Hybrid Search Algorithm for the Multiple Traveling Repairman Problem with Profits. European Journal of Operational Research, 2022, 304(2), 381-394.
8. Y. Jin, B.W. Xiong, H. He. J.K. Hao, C.M. Li, Zhanghua Fu* (Corresponding Author). Clustering Driven Iterated Hybrid Search for Vertex Bisection Minimization. IEEE Transactions on Computers, 2022,71(10), 2370-2379.
9. Y.M. Zhou, J.K. Hao*, Zhanghua Fu* (Corresponding Author), Z. Wang, X.J. Lai. Variable Population Memetic Search: A Case Study on the Critical Node Problem. IEEE Transactions on Evolutionary Computation, 2021, 25(1), 187-200.
10. H. Jiang, D.M. Zhu, Z.C. Xie, S.W. Yao, Zhanghua Fu* (Corresponding Author). A New Upper Bound based on Vertex Partitioning for the Maximum K-plex Problem. In Proceedings of IJCAI2021, Online Conference (Due to COVID-19).