Jun He B.A. (Maths) Ph.D. (Computer Science) Wuhan University, China

Senior Lecturer

Contact Details

Room Number..........:  E33
Building....................:  Llandinam
Phone.......................:   +44 (0)1970 621787
E-Mail........................:   jqh
Home Page...............:   Personal

External Publication Websites:
Google Scholar

Research Groups

Teaching Areas

Modules Taught

  • CSM2120: The Object Oriented Programming Paradigm
  • CSM6320: Representation and Reasoning for Intelligent Systems



Chong, S.Y., Tiňo, P., He, J., Yao, X. 2017. A new framework for analysis of coevolutionary systems - directed graph representation and random walks. Evolutionary Computation 10.1162/evco_a_00218

Li, K., Chen, Y., Li, W., He, J., Xue, Y. 2017. Improved gene expression programming to solve the inverse problem for ordinary differential equations. Swarm and Evolutionary Computation 10.1016/j.swevo.2017.07.005

Corus, D., He, J., Jansen, T., Oliveto, P.S., Sudholt, D., Zarges, C. 2017. On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation. Algorithmica 78 (2) pp. 714–740. 10.1007/s00453-016-0201-4 Cadair

Li, K., Chen, Y., He, J. 2017. The Research of Solving Inverse Problems of Complex Differential Equations. In M. Gong., L. Pen., T. Song., G. Zhang. (eds) Bio-inspired Computing - Theories and Applications: 11th International Conference, BIC-TA 2016, Xi'an, China, October 28-30, 2016. Communications in Computer and Information Science, vol. 682 11th International Conference, BIC-TA 2016. Part 11th edn, Springer Nature pp. 518-523. 10.1007/978-981-10-3614-9_64 Cadair


He, J., Yao, X. 2016. Average Drift Analysis and Population Scalability. IEEE Transactions on Evolutionary Computation (99) 10.1109/TEVC.2016.2608420 Cadair

Xu, T., He, J., Shang, C., Ying, W. 2016. A New Multi-objective Model for Constrained Optimisation. In P. Angelov., A. Gegov., C. Jayne., Q. Shen. (eds) Advances in Computational Intelligence Systems: Contributions presented at the 16th UK Workshop on Computational Intelligence, September 7-9, 2016, Lancaster UK. Advances in Computational Intelligence Systems, vol. 513 Springer Nature pp. 71-85. 10.1007/978-3-319-46562-3_6 Other Cadair

He, J. 2016. An analytic expression of relative approximation error for a class of evolutionary algorithms. IEEE World Congress on Computational Intelligence. 10.1109/cec.2016.7744345 Cadair


He, J., Lin, G. 2015. Average Convergence Rate of Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation 20 (2) pp. 316-321. 10.1109/TEVC.2015.2444793 Cadair

He, J., Wang, Y., Zhou, Y. 2015. Analysis of Solution Quality of a Multiobjective Optimization-based Evolutionary Algorithm for Knapsack Problem. In G. Ochoa. (ed) Evolutionary Computation in Combinatorial Optimization. Lecture notes in Computer Science, vol. 9026 Springer Nature pp. 74-85. 10.1007/978-3-319-16468-7_7 Cadair

He, J., Jansen, T., Ochoa, G., Zarges, C. 2015. Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII. Association for Computing Machinery Cadair

Corus, D., He, J., Jansen, T., Oliveto, P., Sudholt, D., Zarges, C. 2015. On easiest functions for somatic contiguous hypermutations and standard bit mutations. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015). Association for Computing Machinery, New York pp. 1399-1406. Cadair


He, J., Mitavskiy, B., Zhou, Y. 2014. A theoretical assessment of solution quality in evolutionary algorithms for the knapsack problem. 2014 IEEE Congress on Evolutionary Computation (CEC). 10.1109/CEC.2014.6900442 Other Cadair

He, J., Chen, T., Yao, X. 2014. On the Easiest and Hardest Fitness Functions. IEEE Transactions on Evolutionary Computation 19 (2) pp. 295-305. 10.1109/TEVC.2014.2318025 Cadair


Mitavskiy, B.S., Tuci, E., Cannings, C., Rowe, J., He, J. 2013. Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning. Natural Computing 12 (4) pp. 473-484. 10.1007/s11047-013-9395-4 Cadair

Lai, X., Zhou, Y., He, J., Zhang, J. 2013. Performance Analysis of Evolutionary Algorithms for the Minimum Label Spanning Tree Problem. IEEE Transactions on Evolutionary Computation 18 (6) pp. 860-872. 10.1109/TEVC.2013.2291790 Cadair

Mitavskiy, B., He, J. 2013. Combining drift analysis and generalized schema theory to design efficient hybrid and/or mixed strategy EAs. 2013 IEEE Congress on Evolutionary Computation. 2013 IEEE Congress on Evolutionary Computation (CEC). IEEE Press pp. 2028-2036. 10.1109/CEC.2013.6557808 Other Other Cadair

He, J., Hou, W., Dong, H., He, F. 2013. Mixed strategy may outperform pure strategy: An initial study. 2013 IEEE Congress on Evolutionary Computation (CEC). 2013 IEEE Congress on Evolutionary Computation (CEC). IEEE Press pp. 562-569. 10.1109/CEC.2013.6557618 Other Cadair

Mitavskiy, B.S., He, J. 2013. A further generalization of the finite-population geiringer-like theorem for pomdps to allow recombination overarbitrary set covers. The Twelfth Workshop. 10.1145/2460239.2460252 Other Cadair


Mitavskiy, B., He, J. 2012. A polynomial time approximation scheme for a single machine scheduling problem using a hybrid evolutionary algorithm. 2012 IEEE Congress on Evolutionary Computation (CEC). 2012 IEEE Congress on Evolutionary Computation (CEC). IEEE Press pp. 1-8. 10.1109/CEC.2012.6256166 Other Cadair

He, J., He, F., Dong, H. 2012. Pure Strategy or Mixed Strategy? In J. Hao., M. Middendorf. (eds) Evolutionary Computation in Combinatorial Optimization: 12th European Conference, EvoCOP 2012, Málaga, Spain, April 11-13, 2012. Proceedings. Evolutionary Computation in Combinatorial Optimization, vol. 7245 Springer Nature pp. 218-229. 10.1007/978-3-642-29124-1_19 Other Cadair


Chen, Y., Zou, X., He, J. 2011. Drift conditions for estimating the first hitting times of evolutionary algorithms. International Journal of Computer Mathematics 88 (1) pp. 37-50. 10.1080/00207160903477167 Cadair


He, J. 2010. A Note on the First Hitting Time of (1+N) Evolutionary Algorithm for Linear Functions with Boolean Inputs. Proceedings of 2010 IEEE Congress on Evolutionary Computation. IEEE Congress on Evolutionary Computation (CEC). IEEE Press pp. 1-6. 10.1109/CEC.2010.5586055 Cadair

Liang, S., He, J. 2010. A Mixed Strategy for Evolutionary Programming Based on Local Fitness Landscape. IEEE Congress on Evolutionary Computation (CEC). 10.1109/CEC.2010.5586414 Cadair

Chen, T., He, J., Chen, G., Yao, X. 2010. Choosing selection pressure for wide-gap problems. Theoretical Computer Science 411 (6) pp. 926-934. 10.1016/j.tcs.2009.12.014 Cadair

Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C. 2010. Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Evolutionary Computation 18 (4) pp. 617-633. 10.1162/EVCO_a_00003 Cadair


Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C. 2009. Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. Evolutionary Computation 17 (1) pp. 3-19. 10.1162/evco.2009.17.1.3 Cadair

Chen, T., He, J., Yao, X.Chen, G. 2009. A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems. 39 (5) pp. 1092-1106. 10.1109/TSMCB.2008.2012167 Cadair

Oliveto, P.S., He, J., Yao, X. 2009. Analysis of the (1+1)-EA for Finding Approximate Solutions to Vertex Cover Problems. IEEE Transactions on Evolutionary Computation 13 (5) pp. 1006-1029. 10.1109/TEVC.2009.2014362 Cadair

He, J., Kang, L. 2009. A Mixed Strategy of Combining Evolutionary Algorithms with Multigrid Methods. International Journal of Computer Mathematics 86 (5) pp. 837-849. 10.1080/00207160701713581 Cadair

Zhou, Y., He, J., Nie, Q. 2009. A Comparative Runtime Analysis of Heuristic Algorithms for Satisfiability Problems. Artificial Intelligence 173 (2) pp. 240-257. 10.1016/j.artint.2008.11.002 Cadair


Powers, S., He, J. 2008. A Hybrid Artificial Immune System and Self Organising Map for Network Intrusion Detection. Information Sciences 178 (15) pp. 3024-3042. 10.1016/j.ins.2007.11.028 Cadair


He, J., Reeves, C., Witt, C., Yao, X. 2007. A Note on Problem Difficulty Measures in Black-Box Optimization: Classification, Realizations and Predictability. Evolutionary Computation 15 (4) pp. 435-443. 10.1162/evco.2007.15.4.435 Cadair

Zhou, Y., He, J. 2007. A runtime analysis of evolutionary algorithms for constrained optimization problems. IEEE Transactions on Evolutionary Computation 11 (5) pp. 608-619. 10.1109/TEVC.2006.888929 Cadair


He, J., Yao, X. 2003. Towards an Analytic Framework for Analysing the Computation Time of Evolutionary Algorithms. Artificial Intelligence 145 (1-2) pp. 59-97. 10.1016/S0004-3702(02)00381-8 Cadair


He, J., Yao, X. 2002. From an Individual to a Population: An Analysis of the First Hitting Time of Population-based Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation 6 (5) pp. 495-511. 10.1109/TEVC.2002.800886 Cadair


He, J., Yu, X. 2001. Conditions for the convergence of evolutionary algorithms. Journal of Systems Architecture 47 (7) pp. 601-612. 10.1016/S1383-7621(01)00018-2 Cadair

He, J., Yao, X. 2001. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence 127 (1) pp. 57-85. 10.1016/S0004-3702(01)00058-3 Cadair