Tutorials: How to Estimate Time Complexity of Your Evolutionary Algorithm?

Time complexity analysis, which qualitatively describes the runtime of algorithms, is an important and fundamental problem in the field of evolutionary computing. Current theoretical results are mainly based on the simplified algorithms, while there are few analysis results of the existing state-of-the-art evolutionary algorithms in practical application. This tutorial focuses on introducing the estimation of the time complexity of evolutionary algorithms in practical application and aims at bridging the gap between the theoretical basis and practical application.

Outline of the tutorial:

An introduction to the time complexity of evolutionary algorithms
Research on the time complexity of evolutionary algorithm
The estimation of time complexity of evolutionary algorithm based on an average gain model
Experimental methods and procedures of estimating the time complexity of evolutionary algorithm
A software system for estimating the time complexity of evolutionary algorithm
Learning outcomes:

By the conclusion of this tutorial, the learners will be able to:

Understand the importance and challenges of estimating the time complexity of evolutionary algorithm;
Develop a critical understanding of state-of-the art research on time complexity of evolutionary algorithm;
Master the experimental methods and procedures of estimating the time complexity of evolutionary algorithm;
Develop an understanding of the main functions and usage of the time complexity estimation system;
Cultivate their academic interest which would be beneficial for their future research on the time complexity of evolutionary algorithm.