The area of runtime analysis for bio-inspired computing techniques such as evolutionary algorithms and ant colony optimization provides new insights into the working behaviour of these methods for solving optimization problems. The theoretical analysis of these algorithms includes studying the runtime complexity with respect to the input size and/or other parameters of the instance of the problem until reaching an optimal or approximate solution of the problem. Rigorous analysis of these algorithms help us in designing more efficient algorithms. Moreover, investigating the effect of different parameters of the studied algorithms lead to more efficient parameter tuning for these algorithms. Furthermore, studying the theoretical behaviour of bio-inspired algorithms with respect to the characteristics of the studied problem is beneficial in choosing the right algorithm for solving each instance of the problem.
The purpose of this special session is to bring together people working on theoretical analysis of bio-inspired computing techniques. We aim to provide a forum for the researchers in this field to discuss the latest outcomes and new directions in the theory of bio-inspired algorithms.
The authors are invited to submit papers on original contributions in the area of theoretical analysis of bi-inspired computation techniques. The scope of this special session includes (but is not limited to) the following topics:
You should follow the IEEE CEC 2019 submission website. On the submission system select "Theoretical Foundations of Bio-inspired Computation" as "Main Research Topic".
Special session papers are treated in the same way as regular conference papers. Click here to visit the main CEC 2019 web page.
Mojgan Pourhassan
School of Computer Science
University of Adelaide
Adelaide, Australia
Frank Neumann
School of Computer Science
University of Adelaide
Adelaide, Australia
Chao Qian
School of Computer Science and Technology
University of Science and Technology of China
Anhui, China