个人基本情况：
博士，2012年6月毕业于复旦大学，主持或参与国家自然科学基金、上海市青年教师培养计划等课题8项，近年来第一作者发表SCI论文30余篇，微课比赛华东赛区二等奖。
主要研究方向：智能计算算法，水资源优化配置
主持科研项目：
主持上海市青年教师培养计划，中国水利水电科学研究院流域水循环与调控国家重点实验室开放基金两项，获得上海高校青年骨干教师国内访问学者人才计划，并参与国家自然科学基金四项。
发表论文：
[1]Wang Z, Wang D, Bao X, Wu T. A parallel biological computing algorithm to solve the vertex coloring problem with polynomial time complexity. Journal of Intelligent and Fuzzy Systems, 2021(3):1-11.
[2]Wang Z, Bao X, Wu T. A Parallel Bioinspired Algorithm for Chinese Postman Problem Based on Molecular Computing. Computational Intelligence and Neuroscience, 2021, 8814947.
[3]X. Ren, X. Wang, Z. Wang*, T. Wu, Parallel DNA algorithms of generalized traveling salesman problem based bioinspired computing model, International Journal of Computational Intelligence Systems, 2021, 14(1):228-237.
[4]Li R, Chang Y, Wang Z*. Study on optimal allocation of water resources in Dujiangyan irrigation district of China based on improved genetic algorithm, Water Supply, vol. 24, 2020.
[5]Deng A, Wang Z*, Liu H, Wu T. A bio-inspired algorithm for a classical water resources allocation problem based on Adleman-Lipton model, Desalination and Water Treatment, 2020, 185: 168-174.
[6]Wang Z, Ren X, Ji Z, et al. A novel bio-heuristic computing algorithm to solve the capacitated vehicle routing problem based on Adleman–Lipton model. Biosystems, 2019, 184: 103997.
[7] Ji Z，Wang Z*, Deng X, Huang W，Wu T. A new parallel algorithm to solve one classic water resources optimal allocation problem based on inspired computational model. Desalination and Water Treatment, 2019, 160: 214-218.
[8] Ji Z，Wang Z*, Bao X,Wang X, Wu T. Research on water resources optimal scheduling problem based on parallel biological computing[J]. Desalination and Water Treatment, 2018, 111: 88-93.
[9]Wang Z, Ji Z, Wang X, et al. A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model[J]. BioSystems, 2017, 162: 59-65.
[10]Ji Z, Wang Z*, Wu T, et al. Solving the 0-1 knapsack problem based on a parallel intelligent molecular computing model system[J]. Journal of Intelligent & Fuzzy Systems, 2017, 33(5):2719-2726.
[11]Wang Z, Ji Z, Su Z, et al. Solving the maximal matching problem with DNA molecules in Adleman–Lipton model[J]. International Journal of Biomathematics, 2016, 9(02): 1650019.
[12]Wang Z, Huang D, et al. A parallel algorithm for solving the n-queens problem based on inspired computational model[J]. Biosystems, 2015, 131(5): 22-29.
[13]Wang Z, Zhao K, Wang X, et al. A Biological Computing Algorithm to Solve K-Closure Problem[J]. Journal of Computational and Theoretical Nanoscience, 2015, 12(8): 1818-1820.
[14]Wang Z, Qin J, et al. Solving the maximum weighted clique problem based on parallel biological computing model[J]. Mathematical Problems in Engineering，2015, 275019.
[15]Wang Z, Pu J, Cao L, et al. A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing[J]. International journal of molecular sciences, 2015, 16(10): 25338-25352.
[16]Wang Z, Tan J, Zhu L, et al. Solving the Maximum Independent Set Problem based on Molecule Parallel Supercomputing[J]. Appl. Math. Inf. Sci, 2014, 8(5): 2361-2366.
[17]Wang Z*, Huang D, Pei R. Solving the Minimum Vertex Cover Problem with DNA Molecules in Adleman-Lipton Model[J]. Journal of Computational and Theoretical Nanoscience, 2014, 11(2): 521-523.
[18]Wang Z, Tang C*, Liu H, et al. A New Algorithm for Set Splitting Problem Based DNA Molecules Computation[J]. Journal of Computational and Theoretical Nanoscience, 2014, 11(3): 899-900.
[19]Wang Z, Huang W*, Ye C, et al. Algorithm of Solving the Maximum Edges Independent Set Problem Based on DNA Molecules Computation[J]. Journal of Computational and Theoretical Nanoscience, 2014, 11(4): 961-963.
[20]Wang Z*, Huang D, Meng H, et al. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation[J]. Biosystems, 2013, 114(1): 1-7.
[21]Wang Z*, Zhang Y, Zhou W, et al. Solving traveling salesman problem in the Adleman–Lipton model[J]. Applied Mathematics and Computation, 2012, 219(4): 2267-2270.
[22]Wang Z, Tan J, Huang D, et al. A biological algorithm to solve the assignment problem based on DNA molecules computation[J]. Applied Mathematics and Computation, 2014, 244: 183-190.
[23]Wang Z, Tan J, Zhu L, et al. A Biological Algorithm to Solve the Maximum Complete Subgraph Problem Based on Adleman-Lipton Model[J]. Journal of Computational and Theoretical Nanoscience, 2014, 11(11): 2310-2312.
获奖
王兆才，生物并行计算算法研究，金沙城娱乐，自然科学成果奖，三等奖，2016
E-mail：zcwang@shou.edu.cn
联系地址：上海市浦东新区沪城环路999号， 金沙城娱乐401
邮编：201306