[DMANET] CEC 2019 Special Session on Theory of Bio-Inspired Computation

================================================================
CEC 2019 Special Session on Theory of Bio-Inspired Computation
================================================================

CALL FOR PAPERS

================
I. MOTIVATION
================

The area of runtime analysis for bio-inspired computing techniques such as evolutionary algorithms and ant colony optimisation provides new insights into the working behaviour of these methods for solving optimisation 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.

=========
II. SCOPE
=========

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:

* Theoretical foundations of bio-inspired heuristics
* Exact and approximation runtime analysis
* Parametrized complexity analysis
* Black box complexity
* Self-adaptation
* Population diversity
* Population dynamics
* Fitness landscape and problem difficulty analysis
* All problem domains will be considered including:
* combinatorial and continuous optimization
* single-objective and multi-objective optimization
* constraint handling
* dynamic and stochastic optimization
* co-evolution and evolutionary learning


=============
III. SUBMISSION
=============

You should follow the IEEE CEC 2019 submission website.<http://cec2019.org/papers.html#submission> On the submission system select "CEC-21, Special Session on Theory of Bio-inspired Computation" as "Main Research Topic".

Special session papers are treated in the same way as regular conference papers. Visit the main CEC 2019 web page at http://www.cec2019.org/.

==================
IV. IMPORTANT DATES
==================

Important Dates

* Paper submissions: January 7, 2019
* Review Submission Deadline: February 28, 2019
* Notification of acceptance: March 7, 2019
* Final paper submission: March 31, 2019

===============
V. ORGANIZORS
===============

Mojgan Pourhassan<https://cs.adelaide.edu.au/~mojgan/>
School of Computer Science
University of Adelaide
Adelaide, Australia

Frank Neumann<https://cs.adelaide.edu.au/~frank/>
School of Computer Science
University of Adelaide
Adelaide, Australia

Chao Qian<http://staff.ustc.edu.cn/~chaoqian/>
School of Computer Science and Technology
University of Science and Technology of China
Anhui, China
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************