Provisionally Accepted IEEE CEC 2019 Special Sessions


CEC-01 Special Session on Memetic Computing
CEC-02 Special Session on Data-Driven Optimization of Computationally Expensive Problems
CEC-03 Special Session on Evolutionary Computation for Automated Algorithm Design
CEC-04 Special Session on Games
CEC-05 Special Session on Evolutionary Computation for Music, Art, and Creativity
CEC-06 Special Session on Multimodal Multiobjective Optimization
CEC-07 Special Session on Brain Storm Optimization Algorithms
CEC-08 Special Session on Evolutionary Computation and Neural Network for Combating Cybercrime
CEC-09 Special Session on Evolutionary Computation in Healthcare and Biomedical Data
CEC-10 Special Session on Pigeon Inspired Optimization
CEC-11 Special Session on Evolutionary Scheduling and Combinatorial Optimisation
CEC-12 Special Session on Evolutionary Many-objective Optimization
CEC-13 Special Session on Evolutionary Computation in Healthcare Industry
CEC-14 Special Session on Evolutionary Computation for Service and Cloud Computing
CEC-15 Special Session on New Directions in Evolutionary Machine Learning
CEC-16 Special Session on When Evolutionary Computation Meets Data Mining
CEC-17 Special Session on Evolutionary Computation for Smart Grid and Sustainable Energy Systems
CEC-18 Special Session on Evolutionary Computation for Feature Selection, Extraction and Dimensionality Reduction
CEC-19 Special Session on Transfer Learning in Evolutionary Computation
CEC-20 Special Session on Nature-Inspired Constrained Optimization
CEC-21 Special Session on Theory of Bio-Inspired Computation
CEC-22 Special Session on Optimization, Learning, and Decision-Making in Bioinformatics and Bioengineering
CEC-23 Special Session on Evolutionary Computation in Internet of Everything
CEC-24 Special Session on Evolutionary Computation for Symbolic Modelling
CEC-25 Special Session on Hybrid Algorithms in Scheduling and Network Design
CEC-26 Special Session on Evolutionary Computation for Handling Missing Values in Data Mining
CEC-27 Special Session on Complex Networks and Evolutionary Computation
CEC-28 Special Session on Evolutionary Computation in Dynamic and Uncertain Environments
CEC-29 Special Session on Artificial Immune Systems
CEC-30 Special Session on Ethics and Social Implications of Computational Intelligence
CEC-31 Special Session on Evolutionary Computation for Smart City
CEC-32 Special Session on Cooperative Evolutionary Computation
CEC-33 Special Session on Evolutionary Computation for Finance and Economics
CEC-34 Special Session on Distributed and Advanced Evolutionary Computation in the Smart City Era
CEC-35 Special Session on Evolutionary Computation for Granular Computing
CEC-36 Special Session on Evolutionary Deep Learning and Applications
CEC-37 Special Session on Dynamic Multi-objective Optimization and its Applications
CEC-38 Special Session on Self-Organizing Migrating Algorithm
CEC-39 Special Session on big optimization
CEC-40 Special Session on Evolutionary Computation on Filtering, Modeling and Data Assimilation
CEC-41 Special Session on Advances in Decomposition-based Evolutionary Multi-objective Optimization
CEC-42 Special Session on Fireworks Algorithm and Its Applications
CEC-43 Special Session on Swarm Intelligence in Operations Research, Management Science, and Decision-Making
CEC-44 Special Session on Smart Logistics
CEC-45 Special Session on Evolutionary Computation for Multiple Energy Systems Integration
CEC-46 Special Session on Evolutionary Computer Vision and Image Processing
CEC-47 Special Session on Evolutionary Computing Application in Hardware
CEC-48 Special Session on Diversity Preservation Mechanisms for Population-based Meta-heuristics
CEC-49 Special Session on Evolutionary Optimisation in Advanced Manufacturing Processes
CEC-50 Special Session on Quantum and Evolutionary Computing
CEC-51 Evolutionary Algorithms for Complex Optimization in the Energy Domain
CEC-52 Special Session on Evolutionary Computation in Intelligent Transportation Systems
CEC-53 Special Session on Computational Intelligence in Aerospace Science and Engineering
CEC-54 Special Session on Distributed Evolutionary Computation and Its Applications
CEC-55 Special Session on Large Scale Global Optimization
CEC-56 Special Session on Differential Evolution: Past, Present and Future
CEC-57 Special Session on Evolutionary Computation for Multi-Agent Systems
CEC-58 Special Session on Evolutionary Computation for Actionable Knowledge Discovery
CEC-59 Special Session on Computational Intelligence for Cybersecurity
CEC-60 Special Session on Evolutionary Computation for Communication Networks
CEC-61 Special Session on Evolutionary Algorithms for Nonlinear Equations Systems
CEC-62 Special Session on Evolutionary Computation for Bilevel Optimization
CEC-63 Special Session on Evolutionary Computation for Creativity, Manufacture and Engineering Management in the Industry 4.0 Era
CEC-64 Special Session on Gene Expression Programming and Its Applications
CEC-65 Special Session on Probability Distribution Based Evolutionary Algorithms
CEC-66 Special Session on Search-based and Machine Learning Methods in Software Engineering
CEC-67 Special Session on Biologically-inspired Intelligence and Evolutionary Computation for Robotics and Mechatronics
CEC-68 Special Session on Adaptive Swarm Intelligence Algorithms
CEC-69 Special Session on Evolutionary Computation for Sensors and UAV Applications
CEC-70 Special Session on Speciation
CEC-71 Special Session on Hybrid Metaheuristics for Automatic Data Clustering and Analysis
CEC-72 Special Session on Design of New Nanomaterials Using Evolutionary Optimization
CEC-73 Special Session on Evolutionary and Machine Learning Algorithms in Crowdsourcing
CEC-74 Special Session on Benchmarking of Evolutionary Algorithms for Discrete Optimization
CEC-75 Special Session on 100-Digit Challenge on Single Objective Numerical Optimization



CEC-01 Special Session on Memetic Computing


Organized by Liang Feng, Yuan Yuan, and Chuan-Kang Ting

Supported by IEEE CIS ISATC Task Force on Transfer Learning and Transfer Optimization

Scope and Topics

Memetic Computing (MC) represents a broad generic framework using the notion of meme(s) as units of information encoded in computational representations for the purpose of problem-solving. In the literature, MC has been successfully manifested as memetic algorithm, where meme has been typically perceived as individual learning procedures, adaptive improvement procedures or local search operators that enhance the capability of population based search algorithms. More recently, novel manifestations of meme in the forms such as knowledge building-block, decision tree, artificial neural works, fuzzy system, graphs, etc., have also been proposed for efficient problem-solving. These meme-inspired algorithms, frameworks and paradigms have demonstrated with considerable success in various real-world applications.

The aim of this special session on memetic computing is to provide a forum for researchers in this field to exchange the latest advances in theories, technologies, and practice of memetic computing. The scope of this special session covers, but is not limited to:

  • Single/Multi-Objective memetic algorithms for continuous or combinatorial optimization.
  • Theoretical studies that enhance our understandings on the behaviors of memetic computing.
  • Adaptive systems and meme coordination.
  • Novel manifestations of memes for problem-solving.
  • Cognitive, brain, individual learning, and social learning inspired memetic computation
  • Self-design algorithms in memetic computing.
  • Memetic frameworks using surrogate or approximation methods
  • Memetic automaton, cognitive and brain inspired agent based memetic computing
  • Data mining and knowledge learning in memetic computation paradigm
  • Memetic computing for expensive and complex real-world problems
  • Evolutionary multi-tasking


CEC-02 Special Session on Data-Driven Optimization of Computationally Expensive Problems


Organized by Chaoli Sun, Jonathan Fieldsend, and Yew-Soon Ong

Supported by IEEE CIS ECTC Task Force on Data-Driven Evolutionary Optimization of Expensive Problems

Scope and Topics

Meta-heuristic algorithms, including evolutionary algorithms and swarm optimization, face challenges when solving time-consuming problems, as typically these approaches require thousands of function evaluations to arrive at solutions that are of reasonable quality. Surrogate models, which are computationally cheap, have in recent years gained in popularity in assisting meta-heuristic optimization, by replacing the compute-expense/time-expensive problem during phases of the heuristic search. However, due to the curse of dimensionality, it is very difficult, if not impossible to train accurate surrogate models. Thus, appropriate model management techniques, memetic strategies and other schemes are often indispensable. In addition, modern data analytics involving advance sampling techniques and learning techniques such as semi-supervised learning, transfer learning and active learning are highly beneficial for speeding up evolutionary search while bringing new insights into the problems of interest. This special session aims at bringing together researchers from both academia and industry to explore future directions in this field.

The topics of this special issue include but are not limited to the following topics:

  • Surrogate-assisted evolutionary optimization for computationally expensive problems
  • Adaptive sampling using machine learning and statistical techniques
  • Surrogate model management in evolutionary optimization
  • Data-driven optimization using big data and data analytics
  • Knowledge acquisition from data and reuse for evolutionary optimization
  • Computationally efficient evolutionary algorithms for large scale and/or many-objective optimization problems
  • Real world applications including multi-disciplinary optimization.


CEC-03 Special Session on Evolutionary Computation for Automated Algorithm Design


Organized by Nelishia Pillay and Rong Qu

Supported by IEEE CIS ISATC Task Force on Hyper-Heuristics

Scope and Topics

Computational intelligence systems play an imperative role in solving real world complex problems in industry. These systems have contributed to many facets of industry including data mining, transportation, health systems, computer vision, computer security, robotics, software engineering scheduling, and amongst others. Computational intelligence systems employ one or more computational intelligence techniques such as neural networks, fuzzy logic, genetic algorithms, multi-agent approaches and rule-based systems. Implementation of these techniques require a number of design decisions to be made, e.g. what architecture to use, what parameter values to use, and derivation of problem specific operators. It may also be necessary to employ a hybrid system combining techniques to solve a problem. This makes the development of computational systems time consuming, requiring extensive expertise, and many man hours. Consequently, there have been a number of initiatives to automate these processes.

There has been a fair amount of research into parameter tuning and control, automating neural network architecture design, inducing fuzzy functions, rule-based systems and multi-agent architectures, amongst others. The aim of this special session is to examine recent developments in the field and future directions including the challenges and how these can be overcome.

The topics covered include, but are not limited to, the use of EC for the following:

  • Parameter control and tuning
  • Architecture design, e.g. design of neural network and multi-agent architectures
  • Automated hybridization of intelligent techniques
  • Derivation of operators
  • Derivation of construction heuristics
  • Derivation of evaluation functions
  • Automatic system development using hyper-heuristics
  • Automatic programming
  • Auto-ML
  • Search-based software engineering
  • Neuroevolution


CEC-04 Special Session on Games


Organized by Jialin Liu and Daniel Ashlock

Supported by IEEE CIS Games Technical Committee

Scope and Topics

Games are an ideal domain to study computational intelligence (CI) methods because they provide affordable, competitive, dynamic, reproducible environments suitable for testing new search algorithms, pattern-based evaluation methods, or learning concepts. Games scale from simple problems for developing algorithms to incredibly hard problems for testing algorithms to the limit. They are also interesting to observe, fun to play, and very attractive to students. Additionally, there is great potential for CI methods to improve the design and development of both computer games as well as tabletop games, board games, and puzzles. This special session aims at gathering leaders and neophytes in games research as well as practitioners in this field who research applications of computational intelligence methods to computer games.

In general, papers are welcome that consider all kinds of applications of methods (evolutionary computation, supervised learning, unsupervised learning, fuzzy systems, game-tree search, rolling horizon algorithms, MCTS, etc.) to games (card games, board games, mathematical games, action games, strategy games, role-playing games, arcade games, serious games, etc.).

Examples include but are not limited to:

  • Adaptation in games
  • Automatic game testing
  • Coevolution in games
  • Comparative studies (e.g. CI versus human-designed players)
  • Dynamic difficulty in games
  • Games as test-beds for algorithms
  • Imitating human players
  • Learning to play games
  • Multi-agent and multi-strategy learning
  • Player/Opponent modelling
  • Procedural content generation
  • CI for Serious Games (e.g., games for health care, education or training)
  • Results of game-based CI and open competitions


CEC-05 Special Session on Evolutionary Computation for Music, Art, and Creativity


Organized by Chuan-Kang Ting, Francisco Fernández de Vega, and Chien-Hung Liu

Supported by IEEE CIS ETTC Task Force on Creative Intelligence

Scope and Topics

Evolutionary computation (EC) techniques, including genetic algorithm, evolution strategies, genetic programming, particle swarm optimization, ant colony optimization, differential evolution, and memetic algorithms have shown to be effective for search and optimization problems. Recently, EC and deep neural networks gained several promising results and become important tools in computational creativity, such as in music, visual art, literature, architecture, and industrial design.

The aim of this special session is to reflect the most recent advances of EC for Music, Art, and Creativity, with the goal to enhance autonomous creative systems as well as human creativity. This session will allow researchers to share experiences and present their new ways for taking advantage of CI techniques in computational creativity. Topics of interest include, but are not limited to, EC in the following aspects:

  • Generation of music, visual art, literature, architecture, and industrial design
  • Algorithmic design in creative intelligence
  • Integration of EC and (deep) neural networks for creation of music and arts
  • Application of EC to music analysis, classification/clustering, composition, variation and improvisation
  • Optimization in creativity
  • Development of hardware and software for creative systems
  • Evaluation methodologies
  • Assistance of human creativity
  • Computational aesthetics
  • Emotion response
  • Human-machine creativity


CEC-06 Special Session on Multimodal Multiobjective Optimization


Organized by Jing Liang, Boyang Qu, and Dunwei Gong

Scope and Topics

In multiobjective optimization problems, there may exist two or more distinct Pareto optimal sets (PSs) corresponding to the same Pareto Front (PF). These problems are defined as multimodal multiobjective optimization problems (MMOPs). Arguably, finding one of these multiple PSs may be sufficient to obtain an acceptable solution for some problems. However, failing to identify more than one of the PSs may prevent the decision maker from considering solution options that could bring about improved performance.

The aim of this special session is to promote the research on MMO and hence motivate researchers to formulate real-world practical problems. Given that the study of multimodal multiobjective optimization (MMO) is still in its emerging stages, although many real-word applications are likely to be amenable to treatment as a MMOP, to date the researchers have ignored such formulations.

This special session is devoted to the novel approaches, algorithms and techniques for solving MMOPs. The main topics of the special session are:

  • Evolutionary algorithms for multimodal multiobjective optimization
  • Hybrid algorithms for multimodal multiobjective optimization
  • Adaptable algorithms for multimodal multiobjective optimization
  • Surrogate techniques for multimodal multiobjective optimization
  • Machine learning methods helping to solve multimodal multiobjective optimization problems
  • Memetic computing for multimodal multiobjective optimization
  • Niching techniques for multimodal multiobjective optimization
  • Parallel computing for multimodal multiobjective optimization
  • Design methods for multimodal multiobjective optimization test problems
  • Decision making in multimodal multiobjective optimization
  • Related theory analysis
  • Applications


CEC-07 Special Session on Brain Storm Optimization Algorithms


Organized by Shi Cheng, Junfeng Chen, and Yuhui Shi

Scope and Topics

The Brain Storm Optimization (BSO) algorithm is a new kind of swarm intelligence algorithm, which is based on the collective behavior of human being, that is, the brainstorming process. There are two major operations involved in BSO, i.e., convergent operation and divergent operation. A “good enough” solution could be obtained through recursive solution divergence and convergence in the search space. The designed optimization algorithm will naturally have the capability of both convergence and divergence. The BSO algorithm can be seen as a combination of swarm intelligence and data mining techniques. Every individual in the brain storm optimization algorithm is not only a solution to the problem to be optimized, but also a data point to reveal the landscapes of the problem. The swarm intelligence and data mining techniques can be combined to produce benefits above and beyond what either method could achieve alone.

This special session aims at presenting the latest developments of BSO algorithm, as well as exchanging new ideas and discussing the future directions of developmental swarm intelligence. Original contributions that provide novel theories, frameworks, and applications to algorithms are very welcome for this Special session. Potential topics include, but are not limited to:

  • Theoretical aspects of BSO algorithms;
  • Analysis and control of BSO parameters;
  • Parallelized and distributed realizations of BSO algorithms;
  • BSO for multiple/many objective optimization;
  • BSO for constrained optimization;
  • BSO for discrete optimization;
  • BSO for large-scale optimization;
  • BSO algorithm with data mining techniques;
  • BSO in uncertain environments;
  • BSO for real-world applications.


CEC-08 Special Session on Evolutionary Computation and Neural Network for Combating Cybercrime


Organized by Manoranjan Mohanty, Ajit Narayanan, and Mukesh Prasad

Scope and Topics

The volume of cybercrime is increasing daily with increasing use of the internet for email and social media purposes. The use of neural networks for tackling cybercrime is an active area of research. For example, conventional neural network-based solutions have been proposed to detect image tampering, source camera attribution of an anonymous crime image, explicit content detection, virus detection, etc. Recently, researchers are focusing more on unsupervised solutions. New types of cybercrimes are also emerging (e.g., deepfake video) which may, in turn, require new approaches. Interestingly, the role of evolutionary computing in tackling cybercrime is relatively underexplored.

This special session aims to bring together researchers from both academia and industry in the application of evolutionary computation and neural networks for combating cybercrime. This session also will welcome research which focuses on the risk of a neural network for spreading new kind of cybercrimes (e.g., deepfake videos) and evolutionary computing for creating new types of malware (e.g., polymorphic and metamorphic viruses). The session will attract researchers working in cybersecurity, evolutionary computation, and neural networks. Of particular interest will be research that combines evolutionary computing with neural network approaches. The main topics of this special session include, but are not limited to, the following:

  • Malware detection using neural networks and evolutionary computation
  • Internet fraud detection and prediction using neural networks and evolutionary computation
  • Intrusion detection using neural networks and evolutionary computation
  • Digital rights management using neural networks and evolutionary computation
  • Explicit content filtering using neural networks and evolutionary computation
  • Application of convolutional neural networks for multimedia security
  • Image and video forensics using convolutional neural networks
  • Cybercrime risk due to neural networks (e.g., deepfake)
  • Digital forensics for detecting neural network-based fraud


CEC-09 Special Session on Evolutionary Computation in Healthcare and Biomedical Data


Organized by Mukesh Prasad, Paul J. Kennedy, and Manoranjan Mohanty

Scope and Topics

Biomedical data contains several challenges in data analysis, including high dimensionality, class imbalance and low numbers of samples. There is also a need to explore big data in biomedical and healthcare research. An increasing flood of data characterises human health care and biomedical research. Healthcare data are available in different formats, including numeric, textual reports, signals and images, and the data are available from different sources. An interesting aspect is to integrate different data sources in the data analysis process which requires exploiting the existing domain knowledge from available sources. The data sources can be ontologies, annotation repositories, and domain experts’ reports.

This special session aims to bring together the current research progress (from both academia and industry) on data analysis for biomedical and healthcare applications. It will attract healthcare practitioners who have access to interesting sources of data but lack the expertise in using the data mining effectively. Special attention will be devoted to handle feature selection, class imbalance, and data fusion in biomedical and healthcare applications.

The main topics of this special session include, but are not limited to, the following:

  • Information fusion and knowledge transfer in biomedical and healthcare applications.
  • Data Analysis of the biomedical data including genomics.
  • Text mining for medical reports.
  • Statistical analysis and characterization of biomedical data.
  • Machine Learning Methods Applied to Medicine
  • Large Datasets and Big Data Analytics on biomedical and healthcare applications.
  • Information Retrieval of Medical Images
  • Single cell sequencing analysis
  • Medical imaging and genomics


CEC-10 Special Session on Pigeon Inspired Optimization


Organized by Haibin Duan and Yin Wang

Scope and Topics

With the explosion of data generation, getting optimal solutions to data driven problems is increasingly becoming a challenge, if not impossible. Pigeon Inspired Optimization (PIO) is a recently developed intelligent bio-inspired algorithm and become popular to deal with a variety of optimization problems. It is capable of addressing highly complex problems to provide working solutions in time, especially with dynamic problem definitions, fluctuations in constraints, incomplete or imperfect information and limited computation capacity.

This special session aims at presenting the latest developments of PIO algorithm, as well as exchanging new ideas and discussing the future directions of developmental swarm intelligence. Original contributions that provide novel theories, frameworks, and applications to algorithms are very welcome for this Special Session. Potential topics include, but are not limited to:

  • Analysis and control of PIO parameters
  • Parallelized and distributed realizations of PIO algorithms
  • PIO for Multi-objective optimization
  • PIO for Constrained optimization
  • PIO for Discrete optimization
  • PIO algorithm with data mining techniques
  • PIO in uncertain environments
  • Theoretical aspects of PIO algorithm
  • PIO for Real-world applications


CEC-11 Special Session on Evolutionary Scheduling and Combinatorial Optimisation


Organized by Su Nguyen, Yi Mei, and Aaron Chen

Supported by IEEE CIS ETTC

Scope and Topics

This special session focuses on both practical and theoretical aspects of Evolutionary Scheduling and Combinatorial Optimization. Examples of evolutionary methods include genetic algorithm, genetic programming, evolutionary strategies, ant colony optimization, particle swarm optimization, evolutionary based hyper-heuristics, memetic algorithms. Novel hybrid approaches that combine machine learning and evolutionary computation to solve difficult ESCO problems are highly encouraged. Examples include using machine learning to improve surrogate-assisted evolutionary algorithms, and designing evolutionary algorithms for reinforcement learning and transfer learning.

We welcome the submissions of quality papers that effectively use the power of EC techniques to solve hard and practical scheduling and combinatorial optimization problems. Papers with rigorous analyses of EC techniques and innovative solutions to handle challenging issues in scheduling and combinatorial optimisation problems are also highly encouraged.

Topics of interest include, but not limited to:

  • Production scheduling
  • Timetabling
  • Vehicle routing
  • Project scheduling
  • Transport scheduling
  • Airport runway scheduling
  • Grid/cloud scheduling
  • Evolutionary scheduling with big data
  • Web service composition
  • SDN scheduling
  • 2D/3D strip packing
  • Resource allocation
  • Multi-objective scheduling
  • Complex combinatorial optimization with interdependent components
  • Automated heuristic design for combinatorial optimization
  • Dynamic combinatorial optimization
  • Innovative applications of evolutionary scheduling and combinatorial optimization


CEC-12 Special Session on Evolutionary Many-objective Optimization


Organized by Rui Wang, Ran Cheng, Miqing Li and Hisao Ishibuchi

Supported by IEEE CIS ETTC Task Force on Operations Research and Management Sciences

Scope and Topics

The field of evolutionary multi-objective optimization has developed rapidly over the last 20 years, but the design of effective algorithms for addressing problems with more than three objectives (called many-objective optimization problems, MaOPs) remains a great challenge. First, the ineffectiveness of the Pareto dominance relation, which is the most important criterion in multi-objective optimization, results in the underperformance of traditional Pareto-based algorithms. Also, the aggravation of the conflict between convergence and diversity, along with increasing time or space requirement as well as parameter sensitivity, has become key barriers to the design of effective many-objective optimization algorithms. Furthermore, the infeasibility of solutions' direct observation can lead to serious difficulties in algorithms' performance investigation and comparison. All of these suggest the pressing need of new methodologies designed for dealing with MaOPs, new performance metrics and test functions tailored for experimental and comparative studies of evolutionary many-objective optimization (EMaO) algorithms.

List of topics, but are not limited to:

  • Algorithms for EMaO, including search operators, mating selection, environmental selection and population initialization
  • Performance indicators for EMaO
  • Benchmark functions for EMaO
  • Visualization techniques for EMaO
  • Objective reduction techniques for EMaO
  • Preference articulation and decision making methods for EMaO
  • Constraint handling methods for EMaO
  • EMaO in combinatorial/discrete problems
  • EMaO in dynamic environments
  • EMaO in large-scale problems


CEC-13 Special Session on Evolutionary Computation in Healthcare Industry


Organized by Handing Wang, Rong Qu, Yaochu Jin

Supported by IEEE CIS ISATC Task Force on Intelligence Systems for Health

Scope and Topics

Worldwide, the healthcare industry would continue to thrive and grow, because diagnosis, treatment, disease prevention, medicine, and service affect the mortal rates and life quality of human beings. Two key issues of the modern healthcare industry are improving healthcare quality as well as reducing economic and human costs. The problems in the healthcare industry can be formulated as scheduling, planning, predicting, and optimization problems, where evolutionary computation methods can play an important role. Although evolutionary computation has been applied to scheduling and planning for trauma system and pharmaceutical manufacturing, other problems in the healthcare industry like decision making in computer-aided diagnosis and predicting for disease prevention have not properly formulated for evolutionary computation techniques, and many evolutionary computation techniques are not well-known to the healthcare community. This special session aims to promote the research on evolutionary computation methods for their application to the healthcare industry.

The topics of this special session include but are not limited to the following topics:

  • Evolutionary computation in resource allocation for hospital location planning, aeromedical retrieval system planning, etc.
  • Application of evolutionary computation for job scheduling, such as ambulance scheduling, nurse scheduling, job scheduling in medical device and pharmaceutical manufacturing, etc.
  • Multiple-criteria decision-making for computer-aided diagnosis using expert systems.
  • Web self-diagnostic system with the application of information retrieval and recommendation system.
  • Learning and optimization for vaccine selection and personalized/stratified medicine.
  • Data-driven surrogate-assisted evolutionary algorithms in pharmaceutical manufacturing processes.
  • Modeling and prediction in epidemic surveillance system for disease prevention.
  • Route planning for disability robots.


CEC-14 Special Session on Evolutionary Computation for Service and Cloud Computing


Organized by Hui Ma, Yi Mei, and Mengjie Zhang

Supported by IEEE CIS ETTC

Scope and Topics

Services computing is becoming more and more prominent in the Internet environment with the rapid growth of services available on the internet. Cloud computing has become a scalable services consumption and delivery platform in the field of Services Computing. This raises issues for service providers such as Web service composition and service location allocation, resource allocation and scheduling, etc. Computational Intelligence (CI) has been successfully applied to many challenging real-world problems. This special session aims to solve the service and cloud computing problems with CI techniques, covering all different evolutionary computation paradigms such as GA, GP, EP, ES, MA, LCS, PSO, ACO, DE, and EMO.

The scope of this special session includes both new theories and methods on how to solve the challenging services computing and cloud computing problems. Topics of interest include, but not limited to:

  • Evolutionary Web service composition
  • Evolutionary Web service workflow optimisation
  • Evolutionary Web service selection
  • Evolutionary Web service location allocation
  • Evolutionary Web service scheduling
  • Evolutionary semantic Web service composition
  • Evolutionary dynamic Web service composition
  • Multi-objective Web service composition
  • Evolutionary computation for resource allocation in Cloud computing
  • Evolutionary computation for workflow management in Cloud
  • Evolutionary computation for distributed Web service composition
  • Novel representations and search operators for Service-oriented computing
  • Cooperative coevolution for Service-oriented computing
  • Evolutionary computation for Big Data As A Service
  • Evolutionary computation for Internet of Things Services
  • Hybrid algorithms between EC techniques and other CI and learning techniques such as neural networks and fuzzy systems for service and cloud computing


CEC-15 Special Session on New Directions in Evolutionary Machine Learning


Organized by Masaya Nakata , Yusuke Nojima and Will Browne

Scope and Topics

Evolutionary Machine Learning (EML) explores technologies that integrate machine learning (e.g., neural networks, decision trees, fuzzy systems, reinforcement learning) with evolutionary computation for tasks including optimization, classification, regression, and clustering. Since machine learning contributes to parameter learning while evolutionary computation contributes to model/parameter optimization, one of the fundamental interests in EML is a management of interactions between learning and evolution to produce a system performance that cannot be achieved by either of these approaches alone. Historically, this research area was called Genetics-Based Machine Learning (GBML) and it was concerned with learning classifier systems (LCS) with its numerous implementations. More recently, EML has emerged as a more general field than GBML. It is consequently a broader, more flexible and more capable paradigm than GBML. From this viewpoint, the aim of this special session is to explore potential EML technologies and clarify new directions for EML to show its prospects. For this purpose, this special session focuses on, but is not limited to, the following areas in EML:

  • Evolutionary learning systems (e.g., learning classifier systems)
  • Evolutionary neural network (e.g., neuroevolution, evolutionary deep neural networks)
  • Evolutionary decision trees
  • Evolutionary cascade systems
  • Evolutionary fuzzy systems
  • Evolutionary reinforcement learning
  • Evolutionary ensemble systems
  • Evolutionary adaptive systems
  • Artificial immune systems
  • Genetic programming applied to machine learning
  • Evolutionary feature selection and construction for machine learning
  • Transfer learning; learning blocks of knowledge (memes, code, etc.)
  • Accuracy-interpretability tradeoff in EML
  • Applications and theory of EML


CEC-16 Special Session on When Evolutionary Computation Meets Data Mining


Organized by Zhun Fan, Xinye Cai, Chuan-Kang Ting

Scope and Topics

Many of the tasks carried out in data mining and machine learning, such as feature subset selection, associate rule mining, model building, etc., can be transformed as optimization problems. Thus it is very natural that Evolutionary Computation (EC), has been widely applied to these tasks in the fields of data mining (DM) and machine learning (ML), as an optimization technique. On the other hand, EC is a class of population-based iterative algorithms, which generate abundant data about the search space, problem feature and population information during the optimization process. Therefore, the data mining and machine learning techniques can also be used to analyze these data for improving the performance of EC.

The aim of this special session is to serve as a forum for scientists in this field to exchange the latest advantages in theories, technologies, and practice. We invite researchers to submit their original and unpublished work related to, but not limited to, the following topics:

  • EC enhanced by data mining and machine learning concepts and/or framework
  • Data mining and machine learning based on EC techniques
  • Machine learning enhanced or model-based multi/many-objective optimization
  • Data mining and machine learning enhanced combinatorial, constrained, large-scale, or dynamic optimization
  • Data mining and machine learning enhanced memetic computation or local search
  • Association rule mining based on multi-objective optimization
  • Knowledge discovery in data mining via EC
  • Genetic programming in data mining
  • Multi-agent data mining using EC
  • Medical data mining with EC
  • Evolutionary clustering in noisy data sets
  • Big data projects with EC
  • Deep learning with EC
  • Real-world applications


CEC-17 Special Session on Evolutionary Computation for Smart Grid and Sustainable Energy Systems


Organized by Zhile Yang, Kunjie Yu, Zhou Wu

Scope and Topics

To shape a low carbon energy future has been a crucial and urgent task under Paris Global Agreement. Numerous optimisation problems have been formulated and solved to effectively save the fossil fuel cost and relief energy waste from power system and energy application side. However, some key problems are of strong non-convex, non-smooth or mixed integer characteristics, leading to significant challenging issues for system operators and energy users. Evolutionary computation is immune from complex problem modeling formulation, and is therefore promising to provide powerful optimisation tools for intelligently and efficiently solving problems such as smart grid and various energy systems scheduling to reduce carbon consumptions.

This special session intends to reflect the state-of-the-art advances of evolutionary optimisation approaches for solving emerging problems in complex modern power and energy system. The submissions are encouraged to be focus on smart grid scheduling with integration of new participants such as renewable generations, plug-in electric vehicles, distribution generations and energy storages, multiple time-spacial energy reductions and other energy optimisation topics. Potential submission topics include:

  • Unit commitment, economic dispatch and optimal power flow
  • Optimal smart grid scheduling and integration with renewable energy generations
  • Energy management, intelligent coordination and control of electric vehicles/ships
  • Life cycle analysis and optimization of building energy systems
  • Charging and discharging strategies for energy storage battery systems
  • Internal and whole scale management for single and hybrid energy storage systems
  • Energy reduction strategies for food and chemical process industry
  • Energy reduction strategies for energy intensive manufacturing processes
  • Parameters identification for photovoltaic models and PEM fuel cells
  • Thermodynamic optimisation for heat exchanger design and Organic Rankine Cycle


CEC-18 Special Session on Evolutionary Computation for Feature Selection, Extraction and Dimensionality Reduction


Organized by Bing Xue, Mengjie Zhang, and Yaochu Jin

Supported by IEEE CIS ETTC Task Force on Evolutionary Computation for Feature Selection and Construction

Scope and Topics

In machine learning and data mining, the quality of the input data, i.e. feature space, is a key for success of any algorithm. Feature selection, feature extraction or construction and dimensionality reduction are important and necessary data pre-processing techniques to increase the quality of the feature space. However, they are challenging tasks due to the large search space and feature interactions. This special session aims to use Evolutionary Computation for feature reduction, covering ALL different evolutionary computation paradigms. Authors are invited to submit their original and unpublished work to this special session.

Topics of interest include but are not limited to:

  • Dimensionality reduction
  • Feature ranking/weighting
  • Feature subset selection
  • Multi-objective feature selection
  • Filter, wrapper, and embedded methods for feature selection
  • Feature extraction or construction
  • Filter, wrapper, and embedded methods for feature extraction
  • Multi-objective feature extraction
  • Feature selection, extraction, and dimensionality reduction in image analysis, pattern recognition, classification, clustering, regression, and other tasks
  • Feature selection, extraction, and dimensionality reduction on high-dimensional and large-scale data
  • Analysis on evolutionary feature selection, extraction, and dimensionality reduction algorithms
  • Hybridisation of evolutionary computation and neural networks, and fuzzy systems for feature selection and extraction
  • Hybridisation of evolutionary computation and machine learning, information theory, statistics, mathematical modelling, etc., for feature selection and extraction
  • Real-world applications of evolutionary feature selection and extraction, e.g. images and video sequences/analysis, face recognition, gene analysis, biomarker detection, medical data analysis, hand written digit recognition, text mining, instrument recognition, power system, financial and business data analysis, etc.


CEC-19 Special Session on Transfer Learning in Evolutionary Computation


Organized by Bing Xue, Liang Feng, Yew Soon Ong, and Mengjie Zhang

Supported by IEEE CIS ISATC Task Force on Transfer Learning & Transfer Optimization

Scope and Topics

Transfer learning aims to transfer knowledge acquired in one problem domain, i.e. the source domain, onto another domain, i.e. the target domain. Transfer learning has recently emerged as a popular learning framework in data mining and machine learning. Evolutionary computation techniques have been successfully applied to many real-world problems, and started to be used to solve transfer learning and transfer optimisation tasks.

The aim of this special session is to investigate in both the new theories and methods on how transfer learning and optimisation can be achieved with evolutionary computation, and how transfer learning can be adopted in evolutionary computation. Authors are invited to submit their original and unpublished work to this special session.

Topics of interest include but are not limited to:

  • Evolutionary supervised, unsupervised, and semi-supervised transfer learning
  • Domain adaptation and domain generalization
  • Instance based transfer approaches
  • Feature based transfer learning
  • Parameter/model based transfer learning
  • Relational based transfer learning
  • Evolutionary transfer learning for classification, regression, and clustering
  • Evolutionary transfer learning for other data mining tasks, such as association rules and link analysis
  • Evolutionary transfer learning for numeric optimisation tasks
  • Evolutionary transfer learning for scheduling and combinatorial optimisation tasks
  • Hybridisation of evolutionary computation, neural networks, and fuzzy systems for transfer learning
  • Hybridisation of evolutionary computation and machine learning, information theory, statistics, etc., for transfer learning
  • Theoretical studies on the behaviours of evolutionary transfer learning and optimisation
  • Real-world applications of transfer learning in evolutionary computation, e.g. text mining, image analysis, face recognition, WiFi localisation, etc.


CEC-20 Special Session on Nature-Inspired Constrained Optimization


Organized by Efrén Mezura-Montes, Helio J.C. Barbosa, and Rituparna Datta

Supported by IEEE CIS ECTC Task Force on Nature-Inspired Constrained Optimization

Scope and Topics

In their original versions, nature-inspired algorithms for optimization such as evolutionary algorithms (EAs) and swarm intelligence algorithms (SIAs) are designed to sample unconstrained search spaces. Therefore, a considerable amount of research has been dedicated to adapt them to deal with constrained search spaces. The objective of the session is to present the most recent advances in constrained optimization using different nature-inspired algorithms. The session seeks to promote the discussion and presentation of novel works related with (but not limited to) the following issues:

  • Novel constraint-handling techniques for EAs and SIAs
  • Novel constraint-handling techniques for constrained dynamic optimization
  • Novel/adapted search algorithms for constrained optimization
  • Memetic algorithms in constrained search spaces
  • Parameter setting (tuning and control) in constrained optimization
  • Mixed (discrete-continuous) constrained optimization
  • Theoretical analysis and complexity of algorithms in constrained optimization
  • Convergence analysis in constrained optimization
  • Performance evaluation of algorithms in constrained optimization
  • Expensive Constrained Optimization
  • Design of difficult and scalable test functions
  • Applications


CEC-21 Special Session on Theory of Bio-Inspired Computation


Organized by Mojgan Pourhassan, Frank Neumann, and Chao Qian

Supported by IEEE CIS Task Force on Theory of Bio-inspired Computing

Scope and Topics

The area of runtime analysis for bio-inspired computing techniques 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 helps 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. Topics of interest include, but are not limited to:

  • 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


CEC-22 Special Session on Optimization, Learning, and Decision-Making in Bioinformatics and Bioengineering


Organized by Joseph A. Brown, Gonzalo Ruz, Daniel Ashlock, and Richard Allmendinger

Supported by IEEE CIS Task Force on Optimization Methods in Bioinformatics and Bioengineering

Scope and Topics

Bioinformatics and Bioengineering (BB) are interdisciplinary scientific fields involving many branches of computer science, engineering, mathematics, and statistics. Bioinformatics is concerned with the development and application of computational methods for the modeling, retrieving and analysis of biological data, whilst Bioengineering is the application of engineering techniques to biology so as to create usable and economically viable products.

Bioinformatics and Bioengineering are relatively new fields in which many challenges and issues can be formulated as (single and multiobjective) optimization problems. These problems span from traditional problems, such as the optimization of biochemical processes, construction of gene regulatory networks, protein structure alignment and prediction, to more modern problems, such as directed evolution, drug design, experimental design, and optimization of manufacturing processes, material and equipment.

The main aim of this special session is to bring together both experts and new-comers working on Optimization, Learning and Decision-Making in Bioinformatics and Bioengineering to discuss new and exciting issues in this area. The topics are, but not limited to, the following

  • (Single and multiobjective) optimization techniques for Bioinformatics and Bioengineering (BB) problems
  • Decision-making and MCDM techniques for BB problems
  • Experimental optimization of BB problems
  • Learning in/from the optimization of BB problems
  • Data-driven optimization for BB problems
  • Tuning of optimization, learning and decision-making techniques for BB problems
  • Emerging topics in BB
    • Novel applications
    • Novel challenges
    • Interactive visualization
    • Predictive fitness landscape design
    • Many-objective optimization
    • Ecoinformatics
    • Side effect machines and other kernel representations for sequence analysis
    • Biomedical data modelling and mining


CEC-23 Special Session on Evolutionary Computation in Internet of Everything


Organized by Kusum Deep, Hesham Elsayed, and Mukesh Prasad

Scope and Topics

Evolutionary Computation (EC) techniques are widely used in Internet of Everything (IoEt) applications such as Internet of Things, Fog Computing, Edge Computing, and Cloud Computing towards sustainable computing infrastructure at different levels. A large amount of effort is being put toward achieving distributed artificial intelligence. Distributed Artificial Intelligence is a method to enable complex learning, planning, and decision-making problems in a decentralized fashion. It is able to execute large scale computation through distributed computing resources. These properties allow it to solve problems that require the processing of very large data sets. This approach, when put together with the idea of Internet of Everything, opens up a new world of applications of artificial intelligence in a localised manner.

It is clear that EC is going to play a huge role in the lives of the average human being. With the ongoing research in fields like distributive computing, fuzzy logic, neural networks etc, we can also be sure that the intelligence that will run the world will be far more advanced and heuristic than the kind we have today.

The main topics of this special session include, but are not limited to, the following:

  • Data Analytics middleware for Edge computing
  • Cloud-based intelligent analytics
  • Edge-node-driven data analytics
  • Intelligent data synchronization and updating between Edge nodes or Cloud nodes
  • Data metering for Edge nodes and Cloud nodes
  • Intelligent pricing mechanisms for Edge nodes and Cloud nodes
  • Data-driven privacy and security solutions in Edge computing and Cloud computing
  • Case studies for data analytics using Edge nodes or Cloud nodes


CEC-24 Special Session on Evolutionary Computation for Symbolic Modelling


Organized by Qi Chen, Bing Xue and Mengjie Zhang

Scope and Topics

Symbolic modeling is the process of developing symbolic descriptions/mathematical models to capture the structure of the data and make an accurate prediction. In evolutionary computation, symbolic modeling can be achieved by a set of techniques including but not only limited to genetic programming and learning classifier systems.

The theme of this special session is to promote evolutionary computation for symbolic modelling. This involves contributions to the state-of-the-art symbolic modelling techniques through either theoretical or algorithmic work investigating and enhancing the learning, the generalisation, the interpretability, the efficiency and the robustness of the techniques. This also involves methods to handle complex large-scale datasets and high-dimensional datasets, e.g. instance sampling, feature selection and feature construction. Novel applications are also important and interesting to explore. Authors are invited to submit their original and unpublished work to this special session. Topics of interest include but are not limited to:

  • Model evaluation and selection
  • Feature selection, feature construction and dimensionality reduction on high-dimensional regression data
  • Instance selection on large-scale regression data
  • Generalisation of symbolic models
  • Interpretability of symbolic models
  • Multi-objective symbolic modelling
  • Multivariate symbolic modelling
  • Visualisation in symbolic modelling
  • Symbolic modelling on incomplete data
  • Symbolic modelling on unbalanced data
  • Symbolic modelling on noisy data
  • Symbolic modelling on time series
  • Hybrid methods for symbolic modelling
  • Transfer learning in symbolic modelling
  • Novel applications of symbolic modelling on real-world problems in science, industry, economics, finance, etc.


CEC-25 Special Session on Hybrid Algorithms in Scheduling and Network Design


Organized by Ruibin Bai, Rong Qu, and Ben Niu

Scope and Topics

Numerous industries and service sections are now striving to embrace the latest AI technologies. As a result, research in scheduling and network design problems is getting increasingly popular. Most of these problems, unfortunately, are NP-Hard and cannot usually be solved by exact approaches. Therefore, significant research attention has been attracted on exploring techniques in hybridizing Computational Intelligence (including evolutionary computation, neural networks, swarm intelligence, fuzzy logic) with classic integer programming techniques like branch and bound, column generations, branch and pricing, etc. This special session aims to explore recent advances in this area. Topics include, but are not limited to, the following:

  • Hybrid Algorithms for Combinatorial Optimisation Problems
  • Evolutionary Branch and Price Method
  • Machine Learning and Optimisation in Scheduling
  • Machine Learning and Optimisation in Network Design
  • Production Scheduling
  • Personnel Scheduling
  • Healthcare Scheduling
  • Vehicle Routing
  • Sports Scheduling
  • Transportation Network Optimisation
  • Communication Network Optimisation
  • Service Network Design Problems
  • Supply Chain Optimisation
  • Educational Timetabling
  • Other Scheduling Problems
  • In-depth Experimental Analysis and Comparisons Between Different Techniques
  • Meta-analytics and Search Space Landscape Analyses
  • Automated Design of Metaheuristics
  • Complexity Analyses in Scheduling
  • Complexity Analyses in Network Design Problems
  • Interactive Scheduling using Computational Intelligence
  • Experiences of CI within Scheduling
  • Case Studies in Scheduling and Network Design


CEC-26 Special Session on Evolutionary Computation for Handling Missing Values in Data Mining


Organized by Cao Truong Tran, Bing Xue and Mengjie Zhang

Scope and Topics

Many of industrial and research databases suffer from an unavoidable problem of data incompleteness. In big data era, data is generated almost everywhere; therefore, the more data is collected, the more frequent the data suffers from missing values. Missing values not only cause the non-applicability, but also cause the loss of effectiveness and efficiency of almost all data mining algorithms.

Evolutionary computation (EC) techniques have been successfully applied to solve and improve data mining tasks. However, EC techniques have been mainly used for data mining with complete data and also, but with less effort with missing data. Hence, this special session aims to encourage information exchange and discussion between researchers with an interest in the use of any EC technique for handling missing data in data mining and machine learning. Topics of interest include but are not limited to, the use of any EC technique for handling missing data in data mining:

  • Classification, regression, and time-series analysis with missing data
  • Association and clustering with missing data
  • Feature extraction, feature construction, feature selection and feature ranking/weighting with missing data
  • Evolutionary computation for imputing missing values
  • Evolutionary computation for directly evolving models with missing data
  • Ensemble learning for data mining with missing data
  • Hybridisation of evolutionary computation and machine learning for handling missing values
  • Hybridisation of evolutionary computation and fuzzy systems for handling missing values
  • Handling missing values in real-world data such as survey data, mechanical data, medical data, gene expression data, etc.


CEC-27 Special Session on Complex Networks and Evolutionary Computation


Organized by Jing Liu, Wenbo Du, and Xingyi Zhang

Scope and Topics

The application of complex networks to evolutionary computation (EC) has received considerable attention from the EC community in recent years. The most well-known study should be the attempt of using complex networks, such as small-world networks and scale-free networks, as the potential population structures in evolutionary algorithms (EAs). Structured populations have been proposed to as a means for improving the search properties because several researchers have suggested that EAs populations might have structures endowed with spatial features, like many natural populations. Moreover, empirical results suggest that using structured populations is often beneficial owing to better diversity maintenance, formation of niches, and lower selection pressures in the population favouring the slow spreading of solutions and relieving premature convergence and stagnation. Moreover, the study of using complex networks to analyse fitness landscapes and designing predictive problem difficulty measures is also attracting increasing attentions. On the other hand, using EAs to solve problems related to complex networks, such as community detection, is also a popular topic.

This special session seeks to bring together the researchers from around the globe for a creative discussion on recent advances and challenges in combining complex networks and EAs. The special session will focus on, but not limited to, the following topics:

  • Complex networks and fitness landscape analysis
  • Complex networks and problem difficulty prediction
  • Evolutionary dynamics on complex networks
  • Evolutionary algorithms based on complex networks
  • Community detection using evolutionary algorithms
  • Community detection using multi-objective evolutionary algorithms
  • Real world applications of evolutionary algorithms based on complex networks


CEC-28 Special Session on Evolutionary Computation in Dynamic and Uncertain Environments


Organized by Changhe Li, Michalis Mavrovouniotis, and Shengxiang Yang

Supported by IEEE CIS TF on Evolutionary Computation in Dynamic and Uncertain Environments

Scope and Topics

Many real-world optimization problems are subject to dynamism and uncertainties that are often impossible to avoid in practice. For instance, the fitness function is uncertain or noisy as a result of simulation/ measurement errors or approximation errors (in the case where surrogates are used in place of the computationally expensive high-fidelity fitness function). In addition, the design variables or environmental conditions can be perturbed, or they change over time. The tools to solve these dynamic and uncertain optimization problems (DOP) should be flexible, able to tolerate uncertainties, fast to allow reaction to changes and adaptation. Moreover, the objective of such tools is no longer to simply locate the global optimum solution, but to continuously track the optimum in dynamic environments, or to find a robust solution that operates properly in the presence of uncertainties.

This special session aims at bringing together researchers from both academia and industry to review the latest advances and explore future directions in this field. Topics of interest include, but are not limited to:

  • Benchmark problems and performance measures
  • Dynamic single - and multi-objective optimization
  • Dynamic constrained optimization
  • Adaptation, learning, and anticipation
  • Models of uncertainty and their management
  • Handling noisy fitness functions
  • Using fitness approximations
  • Searching for robust optimal solutions
  • Algorithm comparison and benchmarking
  • Hybrid approaches
  • Theoretical analysis
  • Real-world benchmarks and applications


CEC-29 Special Session on Artificial Immune Systems


Organized by Zaineb Chelly Dagdia, Wenjian Luo, and Yong Wang

Supported by IEEE CIS ETTC Task Force on Artificial Immune Systems

Scope and Topics

The biological immune system is a powerful defense system that protects an organism itself from diseases and danger. The biological immune system is a kind of complex, adaptive, dynamic and distributive systems with abilities of learning, memory, self-organization, feature extraction and pattern recognition. The Artificial Immune System, also known as Immune Computation, is a relatively new branch in the computational intelligence community, which is inspired by the structure, functions, models and information processing mechanism of biological immune system. The Artificial Immune System is a fast developing research area. Nowadays, the scope of this research area ranges from modeling to simulation of the biological immune system, to the development of novel engineering solutions to complex problems.

This special session aims to focus on the state-of-the-art research on immune-inspired algorithms and the new conceptual models for understanding the dynamics that underlie the immune system. Topics of interest include, but are not limited to:

  • Computational and mathematical modelling of the immune system
  • Novel immune algorithms and new immune operators
  • Theoretical aspects of immune inspired algorithms
  • Empirical investigations on immune inspired algorithms
  • Benchmarking immune inspired algorithms against other techniques
  • Hybridization of immune inspired algorithms with other techniques
  • Systems and synthetic immunology


CEC-30 Special Session on Ethics and Social Implications of Computational Intelligence


Organized by Matt Garratt, Keeley Crocket, and Bob Reynolds

Supported by IEEE CIS Task Force on the Ethical and Social Implications of Computational Intelligence

Scope and Topics

Computational Intelligence (CI) can provide great benefits to society but also will introduce some challenges. For example, are CI systems used for marking student assignments capable of bias? Moreover, is the current legal framework capable of dealing with the repercussions of decisions made by CI systems on matters such as finance, medical treatments or autonomous vehicle collision avoidance. This special session aims to discuss solutions to some of these challenges, what safeguards might be required (both technologically and legally) and how we can better present the benefits of CI to the wider community.

Topics of interest include, but are not limited to:

  • Potential effects of CI on the human workforce and distribution of wealth
  • Potential effects of CI on privacy
  • Possible bias in CI systems (e.g. can a deep neural network trained to detect lying from spoken language be more likely to get a false positive results for one racial group more than another)
  • Safety of CI systems embedded in autonomous and automated systems (e.g. autonomous vehicles, nuclear power plant control systems)
  • Human-machine Trust in CI Systems
  • Specific applications of CI and the potential ethical/social benefits and risks (e.g. Marking of student assignments, assessment of legal documents, automated decision making in the stock market, medical research)
  • Legal implications of CI (e.g. legal liabilities when things go wrong; how do you certify systems that can ‘learn’ from their environment etc)
  • Need and direction for developing formal standards in ethics for CI
  • Public perception of CI


CEC-31 Special Session on Evolutionary Computation for Smart City


Organized by Kaizhou Gao, Jing Liang, and Ling Wang

Scope and Topics

A Smart City is an urban area that uses different types of electronic data collection sensors to supply information which is used to manage assets and resources efficiently. It integrates information and communication technology (ICT), and various physical devices connected to the network (the Internet of things or IoT) to optimize the efficiency of city operations and services. A smart city is powered by “smart connections” for various items such as street lighting, smart buildings, distributed energy resources (DER), data analytics, and smart transportation.

There are various complex optimization problems in Smart City. The aim of this special session is to bring together researchers from both academia and industry in the application of evolutionary computation for solving various optimization problems in smart city. The main topics of this special session include, but are not limited to, the following:

  • Traffic signals control and optimization
  • Intelligent parking spot allocation
  • Public transport route planning
  • Air-conditioning energy optimization in smart building
  • Urban water supply system optimization
  • Urban gas supply system optimization
  • Evolutionary computation for emergency evacuation of the crowd
  • Evolutionary computation for internet of things
  • Evolutionary computation for public vehicle routing and planning
  • Other topics in smart city


CEC-32 Special Session on Cooperative Evolutionary Computation


Organized by Mohammed El-Abd, Junfeng Chen, and Shi Cheng

Scope and Topics

Cooperative Evolutionary Computation refers to the area of having multiple evolutionary algorithmic instances cooperating with each other to solve an optimization problem. Cooperation could be classified as implicit or explicit. In implicit decomposition, multiple instances implicitly tackle different areas of the search domain due to different initialization, parameter settings, etc. In explicit decomposition, each instance operates in a dedicated subdomain either by dividing the entire domain between instances or dividing the problem variables (i.e. cooperative coevolution). Moreover, cooperative algorithms could be classified as homogeneous (multiple instances of the same evolutionary algorithm) or heterogeneous (instances of different evolutionary algorithms). Many cooperative search algorithms have produced remarkably effective solutions, with a faster speed of convergence, to continuous, large-scale, discrete, combinatorial and multi-objective problems in many fields.

This special session aims at presenting the latest developments of cooperative evolutionary computation techniques, exchanging new ideas and discussing open research questions and future directions. Original contributions that provide novel theories, frameworks, and applications to this topic are very welcome. Potential topics include, but are not limited to:

  • Theoretical analysis (mathematical modeling, stability, convergence … etc.) of cooperative evolutionary algorithms
  • Control, parameter tuning, and adaptation strategies of cooperative evolutionary algorithms
  • Parallelized/Hardware implementations (clusters, GPUs, FPGAs … etc.) of cooperative evolutionary algorithms
  • Novel cooperative techniques (frameworks, problem decomposition, information exchange, etc.)
  • Hybrid cooperative evolutionary algorithms
  • Different types of optimization problems: constrained and unconstrained, single, multi and many-objective, continuous and discrete optimization, mixed decision variables, dynamic optimization, and large-scale optimization
  • Real-world applications of cooperative evolutionary algorithms


CEC-33 Special Session on Evolutionary Computation for Finance and Economics


Organized by Michael Kampouridis and Fernando Otero

Supported by IEEE CIS Computational Finance and Economics TC

Scope and Topics

Computational Finance and Economics covers a wide area of topics and techniques. The arrival of new computational methods, especially from Evolutionary Computation (EC), continually pushes the boundaries of the field outwards. That, together with the advances in available hardware, have contributed to a growing interest in applying EC techniques to solve different financial and economic problems. This Special Session is dedicated to the application of Evolutionary Computation methodologies to such problems. We welcome papers from any algorithm from the EC field, as well as hybrid EC methods. Applications include (but not limited to):

  • Algorithmic trading
  • Artificial stock markets
  • Agent-based models
  • Digital currencies
  • Financial forecasting
  • Financial engineering
  • Financial networks
  • Insurance
  • Portfolio selection and management
  • Pricing complex financial products
  • Risk management systems


CEC-34 Special Session on Distributed and Advanced Evolutionary Computation in the Smart City Era


Organized by Yuji Sato, Noriyuki Fujimoto, and Toshimichi Saito

Scope and Topics

The smart city concept integrates information and communication technology, and various physical devices connected to the cloud network to optimize the efficiency of city operations and services and connect to citizens. Therefore, most of real-world problems in the smart city are multimodal interface problems and/or multi-objective optimization problems involving several conflicting objectives. On the other hand, cloud systems may even offer tens of thousands of virtual machines, terabytes of memories and exa-bytes of storage capacity. Current trend toward many-core architecture increases the number of cores even more dramatically.

In this special session, we will discuss new parallel and distributed evolutionary computation (EC) in the smart city era, in term of both reduction in execution time and improvements in accuracy of the achieved solutions. Topics of interest include, but are not limited to, EC in the following aspects:

  • Implementation of massively parallel EC in cloud computing systems and/or services
  • Parallel and distributed evolutionary algorithms in the smart city
  • Distributed multi-objective swarm intelligence in the smart city
  • Evolutionary learning for multimodal interface problems
  • Neuro-evolution for multi-task problems in the smart city
  • Distributed multi/many objective evolutionary algorithms involving several conflicting objectives
  • Applications of parallel and EC techniques in the smart city Assistance of human creativity
  • Applications of EC and other bio-inspired paradigms to peer to peer systems, and distributed EC algorithms that use them.


CEC-35 Special Session on Evolutionary Computation for Granular Computing


Organized by Weiping Ding and Gary G. Yen

Supported by IEEE CIS FSTC Task Force on Adaptive and Evolving Fuzzy Systems

Scope and Topics

Granular computing (GC) focuses on the knowledge representation and reasoning with information granules, and fuzzy sets and rough sets are two crucial branches of GC. Evolutionary computation for granular computing emphasizes the utility of different evolutionary algorithms to various facets of granular computing, ranging from theoretical analysis to real-life applications. The main motivation for applying evolutionary algorithms to granular computing tasks in the knowledge reasoning is that they are robust and adaptive search methods, which can perform a global search in the space of candidate solutions. The benefits of exploring the combination of granular computing and evolutionary computation will have an impact in multiple research disciplines and industry domains, including transportation, communications, social network, medical health, and so on.

The goal of this special section aims at providing a specific opportunity to review the state-of-the-art of evolutionary computation for granular computing. We invite researchers to submit their original and unpublished work related to, but not limited to, the following topics:

  • Fuzzy sets method and system with evolutionary algorithm
  • Rough sets method and system with evolutionary algorithm
  • Multi-objective evolutionary algorithm for granular computing
  • Evolutionary fuzzy deep neural network for data classification
  • Evolutionary multimodal optimization for fuzzy system
  • Quantum-inspired evolutionary algorithm for granular computing
  • Co-evolutionary algorithm for granular computing framework
  • Granular data mining for feature learning, classification, regression, and clustering with evolutionary algorithm
  • Granular data mining for multi-task modeling, multi-view modeling and co-learning with evolutionary algorithm
  • Real-world applications using evolutionary granular computing


CEC-36 Special Session on Evolutionary Deep Learning and Applications


Organized by Yanan Sun, Bing Xue, Mengjie Zhang, and Chuan-Kang Ting

Supported by

  • IEEE CIS ISATC Task Force on Evolutionary Deep Learning and Applications
  • IEEE CIS ETTC Task Force on Evolutionary Computation for Feature Selection and Construction
  • IEEE CIS ETTC Task Force on Evolutionary Computer Vision and Image Processing

Scope and Topics

Deep learning has shown significantly promising performance in addressing real-world problems. The achievements of such algorithms owe to its deep structures. However, designing an optimal deep structure requires rich domain knowledge on both the investigated data and the general data analysis domain, which is not necessarily held by the end-users. In addition, the problem of searching for the optimal structure could be non-convex and non-differentiable, and existing accurate methods are incapable of well addressing it.

Evolutionary computation (EC) approaches have shown superiority in addressing real-world problems due largely to their powerful abilities in searching for global optima, and requiring no rich domain knowledge. However, most of the existing EC methods currently work only on relatively shallow structures, and cannot provide satisfactory results in searching for deep structures. In this regard, evolutionary deep learning, would be a great research topic.

The theme of this special session aims to bring together researchers investigating methods and applications in evolutionary deep learning.

  • Representation methods for huge number of parameters
  • Representation methods for variable-length individuals
  • Global and/or local search operators for variable-length individuals
  • New search operators for evolutionary deep learning
  • Large-scale optimization algorithms for deep learning
  • Fast fitness evaluation algorithms in evolving deep learning
  • Multi- and many-objective optimization in evolving deep learning
  • Hybrid methods for evolutionary deep learning
  • Evolutionary deep learning for supervised learning
  • Evolutionary deep learning for unsupervised learning
  • Evolutionary deep learning for reinforcement learning
  • Evolutionary computation for optimizing the structure of the deep neural networks
  • Real-world applications of evolutionary deep learning


CEC-37 Special Session on Dynamic Multi-objective Optimization and its Applications


Organized by Daming Shi, Marde Helbig, and Maysam Orouskhani

Scope and Topics

Many real-world engineering optimization problems not only require the simultaneous optimization of a number of objective functions, but also need to track the changing optimal solutions. These problems are called: Dynamic multi-objective optimization (DMOO) problems. Here, where either the objective functions or the constraints change over time, an optimization algorithm should be able to find, and track the changing set of optimal solutions and approximate the time-varying true Pareto front. Therefore, the DMOO algorithm also has to deal with the problems of a lack of diversity and outdated memory.

EThe main goal of this session is to emphasize the newest techniques in solving dynamic multi-objective optimization problems and handling current issues. Due to the novelty of DMOO, the session more concentrates on combining DMOO with other hot topics, such as deep learning. Therefore, session aims at providing a forum for researchers in the area of DMOO to exchange new ideas and submit their original and unpublished work. Topics of interest include, but are not limited to:

  • Complexity, theoretical analysis, and convergence criterion of DMOO
  • Constraint and noise handling methods for DMOO
  • Benchmarks and performance measures for DMOO
  • Evolutionary dynamic multi-objective optimization
  • Dynamic many-objective optimization
  • Dynamic multi-objective Deep Learning techniques
  • Fuzzy dynamic multi-objective optimization
  • Applications: bio-medical date modeling, Big data, and …


CEC-38 Special Session on Self-Organizing Migrating Algorithm


Organized by Ivan Zelinka, Swagatam Das, and Ponnuthurai Nagaratnam Suganthan

Scope and Topics

This special session is concerned about the Self-Organizing Migrating Algorithm (SOMA), belonging to the class of swarm intelligence techniques. Compare to other prominent swarm intelligence paradigms, as for example Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Firefly, and so on, SOMA is distinguished by competitive-cooperative phases, inherent self-adaptation of movement over the search space, as well as by discrete perturbation mimicking the mutation process known from the classical evolutionary computing techniques. The SOMA perform significantly well in both continuous as well as discrete domains. The SOMA has been used successfully on various tasks as the real-time plasma reactor control, aircraft wings optimisation, chaos control, large scale, combinatorial and permutative optimisation tasks.

This special session is concern about original research papers discussing new results on and with SOMA, as well as its novel improvements tested on widely accepted benchmark tests. This session aims to bring together people from fundamental research, experts from various applications of SOMA to develop mutual intersections and fusion. Also, a discussion of possible hybridisation amongst them as well as real-life experiences with computer applications will be carried out to define new open problems in this interesting and fast-growing field of research. The special session will focus on, but not limited to, the following topics:

  • Theoretical aspects of SOMA
  • SOMA hybridisation with other metaheuristics
  • Performance improvement, testing and efficiency of SOMA
  • SOMA for complex optimisation scenarios
  • SOMA and its parallelisation
  • SOMA for discrete optimisation
  • Randomness, chaos and its impact on SOMA dynamics and algorithm performance
  • SOMA in real-world applications


CEC-39 Special Session on big optimization


Organized by Amir Nakib and El-Ghazali Talbi

Scope and Topics

Most of modern engineering and scientific applications are concerned with big optimization problems in terms of number of variables (more than thousands), objectives, constraints, data, uncertainties and so on. The goal of this special session is to come up with cutting-edge evolutionary and meta-heuristic approaches to deal with big optimization problems such as parallel design and implementation, decomposition methods, model-based optimization, surrogate-based optimization, cross-domain, exascale and ultra-scale optimization, deep learning architectures, optimization under uncertainties, and mixed optimization. This special session focuses on, but not limited to, the following areas:

  • Parallel evolutionary algorithms and metaheuristics for complex problems
  • Big optimization under uncertainties

  • Surrogate-assisted evolutionary algorithms

  • Exascale and ultra-scale optimization
  • Cross-domain optimization

  • Large scale continuous and combinatorial optimization

  • Large scale mixed optimization

  • Expensive optimization problems (engineering design, ...)
  • Multi-disciplinary optimization

  • Complex multi-objective optimization

  • Distributed evolutionary algorithms

  • Co-evolutionary algorithms
  • Decomposition-based evolutionary algorithms
  • Computer vision based on deep learning

  • Image processing based on stochastic optimization


CEC-40 Special Session on Evolutionary Computation on Filtering, Modeling and Data Assimilation


Organized by Toshiharu Hatanaka, Isao Ono, and Setsuya Kurahashi

Scope and Topics

Recently with the development of IoT and high-performance computing, the importance of cyber-physical systems that connect the real and a virtual world is increasing. For example, Japan government promotes "Society 5.0" as a key concept for the future. "Society 5.0" describes a future world where smarter systems work by communicating between cyber and physical spaces. System modeling, signal processing, and filtering are the fundamental techniques in the cyber-physical system and an interaction between the real and a virtual world. Such system techniques should have the adaptability to the nonlinearity of the physical system and time-varying environments. The evolutionary approach will be a successful methodology in this fields.

This special session promotes the theoretical discussion on applications of evolutionary computation to control, modeling and filtering for dynamical systems and cyber-physical systems, developments of novel filtering algorithm using evolutionary computation, and data assimilation methods for simulation studies. The design of experiments by using evolutionary algorithms is also important for this fields to build efficient simulation scenarios.

Authors are invited to submit their original work including the following (but not limited to) topics:

  • Evolutionary particle filters
  • Data assimilation and relative methods by evolutionary computation
  • Evolutionary computation for simulation model design
  • Design of experiments with evolutionary computation
  • Evolutionary approaches to faults detection and diagnosis
  • Evolutionary system identification


CEC-41 Special Session on Advances in Decomposition-based Evolutionary Multi-objective Optimization


Organized by Saúl Zapotecas-Martínez, Bilel Derbel, Ke Li, and Qingfu Zhang

Supported by IEEE CIS Task Force on Decomposition-based Techniques in Evolutionary Computation

Scope and Topics

Decomposition-based Evolutionary Multi-objective Optimization (DEMO) encompasses any technique, concept or framework that takes inspiration from the “divide and conquer” paradigm, by breaking a multi-objective optimization problem into several subproblems. This simple idea, which is somewhat standard in computer science, allows to open up new research perspectives and challenges in both the fundamental level of our understanding of multi-objective problems and concerning designing and implementing new efficient algorithms for solving them. Many different DMOEAs variants have been proposed, studied and applied to various application domains in recent years. However, DMOEAs are still in their very early infancy, since only a few basic design principles have been established compared to the vast body of literature dedicated to other well-established approaches (e.g., Pareto-, indicator-based techniques, etc.). Thus, the topics of interest include (but are not limited to) the following aspects:

  • Analysis and performance assessment of DEMO approaches
  • Experimental and theoretical investigations on decomposition strategies, e.g., scalarizing functions, multiple reference points, etc.
  • Adaptive, self-adaptive, and tuning aspects for the parameter setting of DEMO approaches
  • Design of DEMO approaches dedicated to combinatorial, constrained and/or continuous problems
  • Hybridization of single-objective solvers with DEMO approaches, i.e., plug-and-play algorithms based on single objective meta-heuristics, such as GAs, PSO, ACO, CMA-ES, etc.
  • Adaptation and analysis of DEMO approaches in the context of large-scale and many-objective problem solving
  • Application of DEMO for real-world problem solving
  • Design and implementation of DEMO approaches in massively parallel and large-scale distributed environments (e.g., GPUs, Clusters, etc.)


CEC-42 Special Session on Fireworks Algorithm and Its Applications


Organized by Junqi Zhang and Ying Tan

Supported by IEEE CIS Task Force on Decomposition-based Techniques in Evolutionary Computation

Scope and Topics

Fireworks Algorithm (FWA) is a new swarm-based optimization algorithm which has different cooperation framework and search manner compared to other SI algorithms, such as Particle Swarm Optimization, Ant Colony Optimization, and Genetic Algorithm. Locally, populations called fireworks exploit local landscape by a simple sampling method called explosion operation. Globally, fireworks exchange condensed information and collaboratively decide parameters of their explosion. FWA achieved overwhelming success on both benchmark objective functions and real-world problems. Recent research includes many effective variants and huge amount of successful applications. FWA framework has revealed competitive performance with other SI optimization methods.

The main aim of this special session is to gather both experts’ experience and new-comers’ innovations of firework algorithm and its applications. We are expecting researches on theoretical analysis and improvement of FWA and application of all kinds of practical situations. Full papers are invited on recent advances in the development of FWA. The session seeks to promote the discussion and presentation of novel works related (but not limited) to the following issues:

  • Theoretical analysis of FWA
  • Algorithmic improvement of FWA
  • FWA for single-, multi-, and many-objective optimization
  • FWA for data mining and machine learning
  • FWA for data analysis
  • Parallelized and distributed realizations of FWA
  • Applications of FWA


CEC-43 Special Session on Swarm Intelligence in Operations Research, Management Science, and Decision-Making


Organized by Wei-Chang Yeh, Zhifeng Hao, and Chun-Cheng Lin

Supported by IEEE CIS ISATC Task Force on Intelligent Adaptive Fault Tolerant Control, Reliability, and Optimization

Scope and Topics

Swarm intelligence, as a crucial aspect of the artificial intelligence domain, has become an increasingly important modern computational intelligence method in artificial intelligence and computer science. In swarm intelligence, the nascent collective intelligence of groups of simple agents possess a powerful global search capability, and has been demonstrated to be able to determine the optimal solution within a rational time by numerous study fields using swarm intelligence algorithms, such as GA, MA, ACO, PSO, ABC, SSO, etc. Swarm intelligence algorithms play a paramount role in optimizing the increasing problems in related complex systems. Despite a significant amount of research on Swarm Intelligence, there remain many open issues and intriguing challenges in the field. This special session will provide a cardinal opportunity to present the latest scientific results and methods on the collaboration of Swarm Intelligence in Operations Research, Management Science and Decision Making, to discuss and exchange the latest developments in Swarm Intelligence, and to explore the future directions in Swarm Intelligence. Authors are invited to submit their original and unpublished work in the areas including, but not limited to:

  • Swarm intelligence in operations research, management science or decision-making
  • Advanced models of swarm intelligence
  • Data mining using swarm intelligence
  • Analytical studies that enhance our understanding of the swarm intelligence behaviors
  • Swarm intelligence optimization techniques
  • Knowledge incorporation in swarm intelligence
  • Network design and routing
  • Multi-objective optimization
  • Industrial engineering optimization problems
  • Computer engineering optimization problems
  • Power and energy design problems
  • Optimization under uncertainty
  • Manufacturing design
  • Reliability design problems
  • Wireless sensor networks


CEC-44 Special Session on Smart Logistics


Organized by Jialin Liu, Yi Mei, and Shengxiang Yang

Scope and Topics

Smart logistics refers to the efficient and effective design, planning and control of the supply chain processes though intelligent technologies, such as software to improve the design of networks, software to automate scheduling, routing, and dispatching, material handling systems, etc. Respectively, the relevant research methods involve clustering, stochastic (dual) dynamic programming, planning and optimization. In recent years, evolutionary computation (EC) techniques have been introduced to the area of logistics. Examples include applying single-objective and multi-objective evolutionary algorithms to facility layout decision problems and vehicle routing problems.

This special session aims at presenting the latest research on EC applications to logistics. Real-world applications of EC on logistics are highly recommended. The topics include but are not limited to:

  • Facility (re-)layout decision problems
  • Routing problems
  • Emergency logistics
  • Reverse logistics
  • Crowd logistics
  • Freight transportation
  • Green supply chain
  • Metropolitan/city logistics
  • Uncertainty modelling in planning and control
  • Large-scale evolutionary optimization to logistics
  • Multi-agent system in logistics
  • Internet of things on smart logistics.


CEC-45 Special Session on Evolutionary Computation for Multiple Energy Systems Integration


Organized by Jinghan He, Yin Xu and Ying Chen

Scope and Topics

By bringing together multiple energy systems, including electricity, thermal sources and fuels, and other critical infrastructures, such as transportation, water and communication, we can improve their efficiency, reliability and resiliency. Currently, most energy systems and critical infrastructures are operated independently. Multiple energy systems integration (MESI) focus on the coordination and optimization of those energy systems and critical infrastructures in the operation and planning stages. Various operating conditions, include normal operations, typical interruptions and extreme events, are considered to maximize the value of each unit of energy we use and enhance the ability of those systems and infrastructures to withstand and recover from typical and catastrophic disturbances. Most optimization problems we encounter in MESI could be nonconvex and contain large number of integer variables which cannot be solved efficiently using existing mathematic programming methods. This special session aims to promote the research on Evolutionary Computation methods for their application to MESI.

Topics of interest include, but are not limited to:

  • Optimal operation of integrated electric, thermal and natural-gas systems
  • Coordinated operation of electric power grid and transportation systems
  • Optimal operation of cyber-physical systems
  • Coordinated planning of multiple energy systems
  • Economic dispatch and optimal energy flow for multiple energy systems
  • Energy management of multiple energy systems
  • Optimal emergency resources dispatch considering infrastructure interdependency
  • Service restoration strategies for multiple energy systems and critical infrastructures
  • Emergency operation for multiple energy systems under extreme conditions
  • Reliability and resiliency enhancement


CEC-46 Special Session on Evolutionary Computer Vision and Image Processing


Organized by Pablo Mesejo, Harith Al-Sahaf, and Youssef S.G. Nashed

Supported by IEEE CIS Task Force on Evolutionary Computer Vision and Image Processing

Scope and Topics

The fields of computer vision (CV) and image processing (IP) have tried to automate tasks that the human visual system can do, with the aim of gaining a high-level understanding of images and videos. CV algorithms have been successfully applied to a large number of real-world problems ranging from remote sensing to medical image analysis, video surveillance, human-robot interaction, and computer-aided design. In turn, evolutionary computation (EC) methods have shown to be more efficient than classical optimization approaches for discontinuous, non-differentiable, multimodal and noisy problems.

The aim of this special session is to provide a forum for researchers to exchange the latest advances in theories, technologies, and practice of both research fields (EC and CV/IP). The scope of this special session covers, but is not limited to, the application of EC paradigms to:

  • Image segmentation
  • Image registration
  • Image restoration
  • Image pre-processing
  • Image feature extraction
  • Visual scene analysis
  • Object detection and classification
  • Handwritten digit recognition
  • Object tracking
  • Face detection and identification
  • Texture image analysis
  • Human activity recognition
  • Robot vision
  • 3D scene reconstruction
  • Deep learning-based solutions to CV and IP problems
  • Hybridizations with other computational intelligence and machine learning techniques to solve CV and IP problems


CEC-47 Special Session on Evolutionary Computing Application in Hardware


Organized by Martin Trefzer and Andy Tyrrell

Supported by IEEE CIS Task Force on Evolvable Hardware (http://www-users.york.ac.uk/~mt540/ieee-tf-ehw)

Scope and Topics

Evolvable systems encompass understanding, modelling and applying biologically inspired mechanisms to physical systems. Application areas for bio-inspired algorithms include the creation of novel physical devices/systems, novel or optimised designs for physical systems and for the achievement of adaptive physical systems. Having showcased examples from analogue and digital electronics, antennas, MEMS chips, optical systems, carbon nanotubes as well as quantum circuits in the past, we are looking for papers that apply techniques and applications of evolvable systems to these hardware systems.

Within the scope of this special session are

  • Evolutionary Systems for Semiconductor Design, Simulation and Fabrication.
  • Evolutionary Robotics and Machine Learning.
  • Evolutionary Computing Systems for Artificial Intelligence.
  • Evolutionary Substrates for Unconventional Computing.


Topics include:

Evolvable Systems Techniques

Evolvable Systems Applications

  • Intrinsic/Extrinsic/Mixtrinsic Evolution
  • On-chip Bio-inspired Approaches
  • Autonomous Systems
  • Self-reconfigurable and Adaptive Systems
  • Novel Evolvable Hardware Architectures (e.g. FPGAs, FPAAs)
  • Self-repairing, Fault-tolerant Systems
  • Self-monitoring and Self-testing
  • Electronic Circuit Synthesis and Optimization
  • Artificial Immune Systems
  • Artificial Generative Development
  • Formal Hardware Models
  • Bio-inspired Modeling
  • Many-core Systems
  • Machine Learning and AI
  • Intrinsic Fault-tolerance
  • Sensor Design
  • Antenna Design
  • Hardware System Optimization
  • Analogue & Digital Electronic Design Optimization (Topology & Parameters)
  • Evolutionary Robotics
  • Autonomic and Organic Computing
  • DNA Computing
  • MEMS and Nanotechnology
  • Quantum Computing
  • Machine Vision
  • Medical Diagnosis
  • Mechanical Design Optimization (Bridges, Buildings, Spacecraft, Machines, Lenses, Solar Cells)


CEC-48 Special Session on Diversity Preservation Mechanisms for Population-based Meta-heuristics


Organized by Gara Miranda, Eduardo Segredo, and Carlos Segura

Scope and Topics

During last years, a wide range of population-based meta-heuristics have been proposed with the aim of dealing not only with benchmark optimization problems, but also with real-world applications. Population-based approaches keep a set of solutions with the aim of exploring the search space in an efficient way. Usually, a diverse set of solutions is maintained, meaning that several regions are explored simultaneously. However, one common problem of population-based meta-heuristics is that for some test cases they might exhibit a tendency to converge quickly towards some regions. One of the most frequent problems that these types of meta-heuristics have to deal with is premature convergence, which arises when every member of the population is located at a sub-optimal area of the decision space from where they cannot escape. A significant number of methods have been proposed in order to preserve the diversity in a set of solutions. This special session aims to attract the most relevant advances produced in the following topics, including but not limited to:

  • Restarting mechanisms
  • Variable population size approaches
  • Methods based on mating restrictions
  • Diversity-based operators
  • Niching and crowding mechanisms
  • Management of the diversity in multi-objective evolutionary algorithms in the decision and/or objective space
  • Multi-objective methods for promoting diversity in single-objective optimization
  • Methods based on complex population structures
  • Clustering techniques
  • Management of diversity in memetic algorithms
  • Diversity metrics in combinatorial and continuous spaces
  • Premature convergence detection
  • Real-world applications requiring the application of diversity preservation mechanisms for being successfully solved


CEC-49 Special Session on Evolutionary Optimisation in Advanced Manufacturing Processes


Organized by George Panoutsos, Ashutosh Tiwari, and Rajkumar Roy

Scope and Topics

As an underpinning science/engineering discipline, evolutionary optimisation has contributed significantly to the growth of advanced manufacturing systems globally. Topics such as the ones of multi-objective process optimisation, decision-making, real-time performance optimisation are pivotal for the realisation of the Industry 4.0 vision. Whether the manufacturing application is about digitisation systems, robotics, digital manufacturing or fundamental understanding of advanced processes and complex materials, evolutionary optimisation is ideally placed to offer algorithms and methods to address challenges specific to the manufacturing sector.

In this session, we invite contributions that demonstrate new applications, results, as well as new algorithms that address challenges specific to advanced manufacturing systems. Specific topics of interest include, but not limited to:

  • Application of single and multi-objective evolutionary optimisation for advanced manufacturing processes
  • Application of evolutionary optimisation for near real-time operation in advanced manufacturing
  • Optimisation of manufacturing systems under high uncertainty
  • Decision support for advanced manufacturing systems and processes


CEC-50 Special Session on Quantum and Evolutionary Computing


Organized by Martin Lukac, Wiliam N. Hung, Tomoyuki Araki

Supported by IEEE CIS Task Force on Quantum Computing

Scope and Topics

Quantum computing (QC) represents a broad topic encompassing a large number of approaches, technologies and techniques focusing on the usage, application, design and understanding of quantum computing systems. Evolutionary Computing (EC) has been on several occasions directly linked to quantum computing such as quantum evolutionary computation or evolutionary design for quantum computer design, etc. Because quantum computing evolves in the very large Complex Hilbert space, evolutionary methods are a prime tool for exploration and exploitation of quantum properties.

The aim of this special session on quantum and evolutionary computing is to provide a platform for researchers of various fields to discuss the latest advances in related fields, technologies and approaches linking and using quantum and evolutionary approaches. The scope of this special session covers among others but not limited to the following topics:

  • Quantum evolutionary algorithms
  • Classical evolutionary algorithms for design of quantum computers
  • Evolutionary algorithms for reversible and quantum circuits design
  • Quantum mechanics inspired evolutionary algorithms
  • Entanglement and superposition in evolutionary algorithms
  • Quantum evolution
  • Simulation of quantum systems using evolutionary computing
  • Evolutionary optimization of quantum circuits
  • Evolutionary design of quantum error correction
  • Evolutionary design of hermitian operators
  • Evolutionary design of quantum algorithms


CEC-51 Special Session on Evolutionary Algorithms for Complex Optimization in the Energy Domain


Organized by Joao Soares, Fernando Lezama, Zita Vale, Markus Wagner

Scope and Topics

Research work is welcome concerning complex real-world applications of evolutionary computation (EC) in the energy domain. The problems can be focused on different parts of the energy chain (e.g., heating, cooling, and electricity supply) and different consumer targets (e.g., residential or industrial level). Problems dealing with uncertainty, dynamic environments, many-objectives, and large-scale search spaces are important for the scope of this special session. This special session aims at bringing together the latest applications of EC to complex optimization problems in the energy domain. Besides, this special session is linked to the competition on “Evolutionary Computation in Uncertain Environments: A Smart Grid Application”. Therefore, participants are also welcome to submit the results of their algorithm to our session.

Topics must be related to EC in the energy domain including, but not limited to:

  • Electric and plug-in hybrid vehicles
  • Electricity markets
  • Energy scheduling
  • Heat and electricity joint optimization problems
  • Hydrogen economy problems
  • Multi/many-objective problems in the energy domain
  • Natural gas optimization problems
  • Optimal power flow in distribution and transmission
  • Residential, industrial and district cooling/heating problems
  • Smart grid and micro-grid problems
  • Solar and wind power integration and forecast
  • Super grids problems (continental and trans-continental transmission system)
  • Transportation & energy joint problems
  • Distributed evolutionary approaches in the energy domain


CEC-52 Special Session on Evolutionary Computation in Intelligent Transportation Systems


Organized by Rung-Tzuo Liaw, Chuan-Kang Ting, and Hui Cheng

Supported by IEEE CIS ISATC Task Force on Intelligent Network Systems (TF-INS)

Scope and Topics

Transportation serves as an important task in modern human life and industry activities. Optimization for intelligent transportation systems has shown to be a difficult problem. The worldwide division of labor, the connection of distributed centers, and the increased mobility of individuals, furthermore, lead to an increased demand for efficient solutions to solve the problems in transportation networks. Evolutionary computation plays a significant role and has gained promising results in optimization of transportation networks.

The aim of this special session is to promote research and reflect the most recent advances of evolutionary computation in in intelligent transportation systems. Topics of interest include, but are not limited to:

  • Transportation and supply networks
  • Modeling and traffic management
  • Traffic simulation
  • Individual and public transportation
  • Freight and passenger services
  • Pickup and delivery
  • Flight and crew scheduling
  • Tracking and tracing
  • Fleet and order management
  • Inventory optimization
  • Routing and scheduling


CEC-53 Special Session on Computational Intelligence in Aerospace Science and Engineering


Organized by Massimiliano Vasile, Annalisa Riccardi, Peter Korošec

Supported by IEEE CIS ETTC Task Force on Aerospace Science

Scope and Topics

In Space and Aerospace Science and Engineering, many applications require the solution of global single and/or multi-objective optimization problems, including mixed variables, multi-modal and non-differentiable quantities. From global trajectory optimization to multidisciplinary aircraft and spacecraft design, from planning and scheduling for autonomous vehicles to the synthesis of robust controllers for airplanes or satellites, computational intelligence (CI) techniques have become an important – and in many cases inevitable – tool for tackling these kinds of problems, providing useful and non-intuitive solutions. This special session intends to collect many, diverse efforts made in the application of computational intelligence techniques, or related methods, to aerospace problems. In particular, evolutionary methods specifically devised, adapted or tailored to address problems in space and aerospace applications or evolutionary methods that were demonstrated to be particularly effective at solving aerospace related problems are welcome.

  • Global trajectory optimization
  • Multidisciplinary design for space missions
  • Formation and constellation design and control
  • Optimal control of spacecraft and rovers
  • Planning and scheduling for autonomous systems in space
  • Multiobjective optimization for space applications
  • Resource allocation and programmatics
  • Evolutionary computation and AI for Concurrent Engineering
  • Distributed global optimization
  • Mission planning and control
  • Robust Mission Design under Uncertainties
  • Intelligent search and optimization methods in aerospace applications
  • Emerging topics such as AI or Swarm Intelligence on future space research
  • Intelligent algorithms for control, fault identification, diagnosis and repair
  • Multi-agent systems approach and bio-inspired solutions for system design and control
  • Advances in machine learning for space applications
  • Knowledge Discovery, Data Mining and presentation of large data sets


CEC-54 Special Session on Distributed Evolutionary Computation and Its Applications


Organized by Zhi-Hui Zhan and Yu-Zhen Zhao

Supported by IEEE CIS ETTC

Scope and Topics

Evolutionary computation (EC) algorithms have aroused great attentions from both the academic and industrial communities in recent years due to their promising performance in many real-world optimization problems. However, in the era of cloud computing and big data, many optimization problems face the challenges of large scale & dynamic/uncertain, multimodal & many-objective, and complexity & expensive fitness, which make traditional centralized EC algorithms based on a single computer/computing resource result in low solution accuracy, slow convergence speed, and long running time. In order to promote traditional centralized EC algorithms to solve the complicated optimization problems in big data era, using distributed technology to enhance EC algorithms is a promising approach.

Distributed EC (DEC) algorithms pose several new challenges: the design of DEC algorithms, the selection of distributed architectures, distributed resource scheduling method, and the deployment of the EC algorithms on distributed computing platform. This Special Session is to draw the attentions of researchers in both the communities of distributed technology and EC to exchange their latest advances in theories and technologies of EC, distributed technology, and the works on extending DEC approaches to real-world applications. Authors are invited to submit their original and unpublished work with the topics including, but not limited to:

  • Design of DEC algorithm architectures
  • Design of distributed architectures based on real-world application problems
  • Parameters research on DEC
  • Topology research on DEC
  • Approaches for distributed computing resource scheduling for DEC
  • Development of DEC algorithms on distributed resources
  • Theoretical analysis of DEC algorithms
  • Real-world applications of DEC algorithms


CEC-55 Special Session on Large Scale Global Optimization


Organized by Daniel Molina Cabrera and Antonio LaTorre

Supported by IEEE CIS ETTC Task Force on Large Scale Global Optimization

Scope and Topics

In the past two decades, many evolutionary algorithms have been developed and successfully applied for solving a wide range of optimization problems. Although these techniques have shown excellent search capabilities when applied to small or medium sized problems, they still encounter serious challenges when applied to large scale problems, i.e., problems with several hundreds to thousands of variables. This is due to the Curse of dimensionality, as the size of the solution space of the problem grows exponentially with the increasing number of decision variables, there is an urgent need to develop more effective and efficient search strategies to better explore this vast solution space with limited computational budgets. In recent years, research on scaling up EAs to large-scale problems has attracted significant attention, including both theoretical and practical studies. Existing work on tackling the scalability issue is getting more and more attention in the last few years.

This special session is devoted to highlight the recent advances in EAs for handling large-scale global optimization (LSGO) problems, involving single objective or multiple objectives, unconstrained or constrained, binary/discrete or real, or mixed decision variables. More specifically, we encourage interested researchers to submit their original and unpublished work on:

  • Theoretical and experimental analysis on the scalability of EAs;
  • Novel approaches and algorithms for scaling up EAs to large-scale optimization problems;
  • Applications of EAs to real-world large-scale optimization problems;
  • Novel test suites that help researches to understand large-scale optimization problems characteristics.


CEC-56 Special Session on Differential Evolution: Past, Present and Future


Organized by Kai Qin, Swagatam Das, and Rammohan Mallipeddi

Supported by IEEE CIS ETTC Task Force on Collaborative Learning and Optimization

Scope and Topics

Differential evolution (DE) is one of the most promising research areas in evolutionary computation. Over the past decades, DE-related algorithms have frequently demonstrated superior performance in various challenging tasks. Meanwhile, the remarkable efficacy of DE in real-world applications significantly boosts its popularity. However, the lack of systematic benchmarking of the DE-related algorithms in different problem domains, the existence of many open problems in DE, and the emergence of new application areas call for an in-depth investigation of DE.

This special session aims at bringing together researchers and practitioners to review and re-analyze past achievements, to report and discuss latest advances, and to explore and propose future directions in this research area. Authors are invited to submit their original and unpublished work in the areas including but not limited to:

  • New DE variants for continuous, discrete, mixed-variable, single-objective, multi-objective, many-objective, constrained, large-scale, multiple optima seeking (niching), dynamic and uncertain optimization
  • Review, comparison and analysis of DE in different problem domains
  • Experimental design and empirical analysis of DE
  • DE-variants for handling mixed-integer, discrete, and binary optimization problems
  • Study on initialization, reproduction and selection strategies in DE
  • Study on control parameters (e.g., scale factor, crossover rate, and population size) in DE
  • Self-adaptive and tuning-free DE
  • Parallel and distributed DE
  • Theoretical analysis and understanding of DE
  • Synergy of DE with neuro-fuzzy and machine learning techniques
  • DE for expensive optimization problems
  • Hybridization of DE with other optimization techniques
  • Interactive DE
  • DE for deep learning
  • Application of DE to real-world problems


CEC-57 Special Session on Evolutionary Computation for Multi-Agent Systems


Organized by Xingguang Peng, Yaqing Hou, and Yew-Soon Ong

Scope and Topics

Multi-agent systems (MAS) are computerized systems composing of multiple interacting and autonomous agents within a common environment of interest for problem-solving. The development of intelligent agents that are capable of adapting to the complex or dynamic environment has attracted increasing attentions over the past decades. In computational intelligence, evolutionary computation (EC), in particular, has been shown to provide a reliable and flexible contender over traditional mathematical approaches for solving complex optimization problems, especially if near global optimum solutions are sought. According to the recent studies, EC based techniques, including evolutionary algorithms, swarm intelligence, evolutionary reinforcement and transfer learning, are already starting to show up in developing more significant intelligence among multiple agents in MAS. Particularly, the intrinsic parallelism of natural evolution and the errors which are introduced due to the physiological limits of the agents’ ability to perceive differences, could generate the “growth” and “variation” of knowledge that agents have of the world, thus exhibiting high adaptivity capabilities on solving complex and non-trivial problems.

Topics of interest include, but are not limited to:

  • EC based mission planning and task allocation for multi-agent systems
  • Co-evolution and the evolution of collaborative behavior of multiple agents
  • Evolutionary reinforcement learning for multi-agent systems
  • Evolutionary transfer learning for multi-agent systems
  • Evolution of neural controllers for self-organized mobile robots
  • Discovery of emergency of swarm agents
  • Swarm intelligence (such as PSO, ACO, etc.) inspired multi-agent systems
  • Memetic automaton and meme-centric multi-agent system
  • EC based human–machine interaction for multi-agent systems
  • Real-world applications of EC based multi-agent systems


CEC-58 Special Session on Evolutionary Computation for Actionable Knowledge Discovery


Organized by Chun-Hao Chen, Mu-En Wu, and Tzung-Pei Hong

Scope and Topics

Actionable Knowledge Discovery (AKD) is an importance task for data analysis in real-world applications. To reach that, multiple aspects, e.g., meta knowledge, domain knowledge, technique and business criteria, should be considered in algorithms, and hence the AKD in applications are optimization problems. Evolutionary Computation (EC) already shows its powerful ability for dealing with optimization problems in various fields and searching the global optimal solution. The aim of this special session is to provide a forum to disseminate and discuss recent and significant research effort on computational intelligence and other intelligence techniques for the AKD. This session is open to any high quality submission from researchers who work on mainly computational intelligence methods for the AKD. The scope of this section includes, but is not limited to the following topics:

  • AKD-based evolutionary computation for market data analysis (e.g., association rules, utility mining)
  • AKD-based evolutionary computation for financial data analysis (e.g., stock portfolio, trading strategy, capital management)
  • AKD-based evolutionary computation for time series data analysis (e.g., temporal mining, spatial mining)
  • AKD-based evolutionary computation for features selection
  • AKD-based evolutionary computation classification systems
  • Applications of AKD-based evolutionary computation
  • Other new evolutionary computation approaches to the AKD


CEC-59 Special Session on Computational Intelligence for Cybersecurity


Organized by Harith Al-Sahaf, Ian Welch, Zhen Ni, and Wanlei Zhou

Supported by IEEE CIS ISATC

Scope and Topics

Cybersecurity aims at preventing and detecting cyber attacks on Internet-connected systems which include data, software, and hardware, in order to maintain the confidentiality, integrity, and availability of those assets. Utilizing various evolutionary computation (EC) and machine learning techniques to tackle numerous problems related to cybersecurity have received increasing attention due to the success of such techniques to tackle problems in many other domains.

This interdisciplinary special session aims at providing a focused discussion forum for utilizing EC based techniques to automatically tackle different cybersecurity-related problems and other types of network-based attacks. It also aims at promoting both practical applications and theoretical development of EC techniques for information and network security domains. The scope of this special session covers, but not limited to, the following topics:

  • Evolutionary Computation techniques
    • Data mining in cybersecurity
    • Evolutionary transfer learning in cybersecurity
    • EC techniques for feature extraction, selection and construction in cybersecurity
    • White-box and black-box attacks
    • Adversarial machine learning
    • Online learning
    • Measurement and ground truth acquisition
    • Creation of synthesized training and test sets
    • Learning in games
  • Security applications
    • Automated vulnerability and penetration testing
    • Ransomware, spam and phishing detection
    • Behavioral-based anomaly detection
    • DDoS prediction and detection
    • Authorship identification
    • EC methods for Intrusion prevention and response
    • Keystroke and other biometric dynamics
    • Botnet detection


CEC-60 Special Session on Evolutionary Computation for Communication Networks


Organized by Hui Cheng, Chuan-Kang Ting, and Shengxiang Yang

Supported by IEEE CIS ETTC Task Force on Intelligent Network Systems (TF-INS)

Scope and Topics

The impact of optimization in communication networks, such as Internet and mobile wireless networks, on the modern economy and society has been growing steadily. At the present, new technologies like 5G cellular mobile radio systems, optical Internet, and network virtualization and automation are in widespread use, allowing fast data communications, new services and applications. With the advent of computer systems, computational intelligence approaches have been developed for systematic design, optimization, and improvement of different communication network systems.

The aim of the special session is to promote research and reflect the most recent advances of evolutionary computation, including evolutionary algorithms, deep learning, neural network, fuzzy systems, metaheuristic techniques and other intelligent methods, in the solution of problems in communication networks. Topics of interest include, but are not limited to:

  • Communication network systems:

    telecommunications; mobile, satellite, and optical communications; switching and routing; network functions virtualization (NFV)and software-defined networking (SDN); communication systems simulation; station and antenna design; frequency and channel assignment; information and speech processing; intrusion detection; error control coding; compression and cryptography; propagation and channel modeling, protocol design, etc.

  • General network problems:

    parallel and distributed systems; networks and graph problems; unconstrained and constrained network design problems; structural and computational complexity; adaptability to environmental variations; robustness to network changes and failures; effectiveness and scalability of performance; location and link design; reliability and failure; location placement; network physical and software architecture; network hardware and software technologies; operations, maintenance, and management; signaling and control; active networks; network services and applications, etc.



CEC-61 Special Session on Evolutionary Algorithms for Nonlinear Equations Systems


Organized by Yong Wang (ywang@csu.edu.cn), Wenyin Gong, and Crina Grosan

Scope and Topics

Nonlinear equation systems (NESs) frequently arise in many physical, electronic, and mechanical processes. Very often, a NES may contain multiple roots. Since all these roots are important for a given NES in the real-world applications, it is desirable to simultaneously locate them in a single run, such that the decision maker can select one final root which matches at most his/her preference. For solving NESs, several classical methods, such as Newton-type methods, have been proposed. However, these methods have some disadvantages in the sense that they are heavily dependent on the starting point of the iterative process, can easily get trapped in a local optimal solution, and require derivative information. Moreover, these methods tend to locate just one root rather than multiple roots when solving NESs.

Solving NESs by EAs is a very important area in the community of evolutionary computation, which is challenging and of practical interest. However, systematic work in this area is still very limited. The aim of special session is to facilitate the development of EAs for locating multiple roots of NESs. Topics include:

  • Theoretical and experimental analyses of the roots in NESs
  • Novel search engines in evolutionary computation for NESs
  • Novel techniques for transforming a NES into a kind of optimization problems
  • Locating multiple roots of NESs by multiobjective optimization-based methods
  • Locating multiple roots of NESs by repulsion-based techniques
  • Real-world applications


CEC-62 Special Session on Evolutionary Computation for Bilevel Optimization


Organized by Jingxuan Wei, Ankur Sinha, Kalyanmoy Deb, Hecheng Li, and Mengjie Zhang

Scope and Topics

Bilevel programming problems (BLPPs) are non-convex optimization problems with two levels, namely upper level and lower level. For such hierarchical structure, we need to fix an upper decision variable as a parameter and to solve the lower optimization problem. Such requirements make the bilevel optimization problems difficult to solve and time consuming. The majority of existing work on BLPPs is concentrated on linear BLPPs and some special nonlinear BLPPs in which all of the functions involved are convex and twice differentiable. In the context of multi-objective bilevel optimization problems, there does not exist too many studies. Most of the existing algorithms focus on approximate solution strategies and K-K-T conditions. However, these algorithms are very time consuming and strongly problem dependent. In order to handle such problems efficiently and effectively, there is a need for theoretical as well as methodology advancements to solve single bilevel and multi-objective bilevel optimization problems.

This special session on will bring together researchers working on the following topics:

  • Algorithms for single bilevel-optimization problems
  • Algorithms for bilevel multi-objective optimization problems
  • Surrogate procedures to handle bilevel optimization problems
  • Approximate approaches to handle bilevel optimization problems
  • Memetic approaches to handle bilevel optimization problems
  • Theoretical results on bilevel optimization problems
  • Bilevel applications
  • Approximate procedures to handle bilevel optimization problems


CEC-63 Special Session on Evolutionary Computation for Creativity, Manufacture and Engineering Management in the Industry 4.0 Era


Organized by Leo Yi Chen, Hongnian Yu, Yun Li, and Chuan-Kang Ting

Scope and Topics

This special session solicits original research papers or reviews that would shape and advance design, manufacture and engineering management in the Industry 4.0 era. Computational intelligence (CI) utilises a set of nature-inspired modelling and optimisation approaches to complex real-world problems. Papers addressing how to create designs and build machines smartly, thereby leading to a step improvement in manufacturing autonomy and industrial efficiency, performance and competitiveness, would be particularly welcome.

Topics include, but are not limited to:

  • CI automated design
  • AI-driven engineering design and product creation
  • AI-guided simulation and modelling
  • High performance computing for smart design
  • Cyber-physical systems with CI
  • Industry 4.0 with CI
  • CI for Industry 4.0 in a cloud and big data environment
  • CI and data science for marketing in an Industry 4.0 value chain
  • Evolutionary learning techniques for Industry 4.0 business informatics
  • CI and data science applications to marketing for design;
  • Evolutionary distributed or cloud computing for interactive product design and marketing;
  • High-volume industrial products for industry 4.0 customisation and innovation
  • Intelligent machinery and smart manufacturing
  • CI for sensor technology in Industry 4.0
  • Evolutionary computation for scheduling, layout and process optimisation in Industry 4.0
  • Multi-objective optimisations for design and manufacture
  • Hardware and software platforms for smart design automation
  • Intelligent manufacturing system design, optimisation, control and operation
  • Evolutionary computation in industrial computer vision and robotics
  • Human-machine interface and integration in an industrial environment
  • Robotics-related computer hardware, software, and architectures
  • Robotics in manufacturing and flexible automation
  • Autonomous design and manufacturing
  • Intelligent operational research and management


CEC-64 Special Session on Gene Expression Programming and Its Applications


Organized by Jinghui Zhong, Liang Feng, and Yi Mei

Scope and Topics

Gene Expression Programming (GEP) is a popular evolutionary algorithm for automatic generation of computer programs. Over the past decades, GEP has undergone rapid advancements and developments. A number of enhanced GEPs have been proposed to date, such as Parallel GEP, Cooperative Co-evolutionary GEP, and Multi-task GEP. The real-world applications of GEP are also multiplying fast, including regression, classification, combinatorial optimization, data mining and knowledge discovery.

The aim of this special session is to provide a forum for researchers in this field to exchange the latest advances in theories, technologies, and practice of Gene Expression Programming. Topics of interest include, but are not limited to, GEP in the following aspects:

  • Gene Expression Programming for Symbolic Regression
  • Gene Expression Programming for Classification
  • Gene Expression Programming for Combinatorial Optimization
  • Parallel Gene Expression Programming
  • Gene Expression Programming with Feature Selection
  • Gene Expression Programming with Transfer Learning
  • Multi-objective Gene Expression Programming
  • Semantic-based Gene Expression Programming
  • Cooperative Co-evolutionary Gene Expression Programming
  • Theoretical analysis of Gene Expression Programming
  • Real-world Applications of Gene Expression Programming
  • Multi-task Gene Expression Programming


CEC-65 Special Session on Probability Distribution Based Evolutionary Algorithms


Organized by Wei-Neng Chen, Jinghui Zhong, and Zhi-Hui Zhan

Scope and Topics

Estimation of Distribution Algorithm (EDA) is a special kind of evolutionary algorithm that works by constructing a probability model to estimate the distribution of the predominant individuals in the population. In a border sense, there are also some other evolutionary computation (EC) or swarm intelligence (SI) algorithms that work by implicitly constructing a probability distribution in the solution space. For example, in ant colony optimization (ACO), ants deposit pheromone on paths, which can be seen as an implicit probability model. Such implicit probability distribution construction behavior provides a more feasible way to build promising probability distribution models, and thus further extends the concept of Probability Distribution Based Evolutionary Algorithms. There are a lot of applications in probability distribution based evolutionary algorithms, for example, task scheduling, routing, mixed-variable optimization, etc. Constructing suitable probability distribution models and studying the theory behind the probability distribution are important for the research of probability distribution based evolutionary algorithms, which are promising in solving such real-world applications.

The aim of this special session is to promote the research on theories and applications in this filed. Topics of interest include, but are not limited to:

  • Estimation of distribution algorithms (EDAs)
  • Bayesian optimization
  • Construction methods of explicit and implicit probability distribution
  • Basic theories of probability distribution based evolutionary algorithms
  • Applications of probability distribution based evolutionary algorithms
  • Distributed and parallel probability distribution based evolutionary algorithms
  • Probability distribution based evolutionary algorithms in optimization under uncertainty
  • Multi-objective probability distribution based evolutionary algorithms
  • Probability distribution based evolutionary algorithms for mixed variable optimization


CEC-66 Special Session on Search-based and Machine Learning Methods in Software Engineering


Organized by Fuyuki Ishikawa, Paolo Arcaini, Shaukat Ali, Daniel Rodriguez

Scope and Topics

This session aims to bring together both theoretical developments and applications of Computational Intelligence to software engineering (SE), i.e. management, design, the development, operation, maintenance, and testing of software. All bio-inspired computational paradigms and machine learning techniques are welcome, such as genetic and evolutionary computation, including multi-objective approaches, fuzzy logic, intelligent agent systems, neural networks, cellular automata, artificial immune systems, swarm intelligence, and others, including machine learning techniques.

This special session aims to provide a forum for the presentation of the latest data, results, and future research directions on evolutionary methods and machine learning in software engineering. The special session invites submissions in any of the following areas:

  • Search-based Software Engineering
  • Requirements engineering (e.g., requirements prioritization, requirements selection)
  • Automated design and development of software
  • Genetic improvement of software
  • Software design (e.g., software configuration)
  • Software development (e.g., code optimization)
  • Software testing (e.g., test case generation, test case optimization, model-based testing)
  • Software maintenance and self-repair
  • Software effort estimation and fault prediction
  • Software reliability, testing, and security with data-mining or meta-heuristic techniques
  • Project management, planning, and scheduling
  • Software product lines
  • Studies, applications, and tools to extract information from software repositories
  • Dealing with data problems in software repositories (noise, imbalance, outliers, etc.) when applying ML or meta-heuristics
  • Process mining
  • Mining mobile application repositories (AppStore and Google Play)
  • Tools based on evolutionary or ML methods in SE
  • Real world applications of the above
  • Empirical evaluations
  • Theoretical aspects


CEC-67 Special Session on Biologically-inspired Intelligence and Evolutionary Computation for Robotics and Mechatronics


Organized by Chaomin Luo

Scope and Topics

Original research papers are solicited in related areas of biologically-inspired algorithm based evolutionary computation for robotics. Submissions to the special session should be focused on theoretical results or innovative applications of biologically-inspired algorithms associated with evolutionary computation for robot and vehicle systems.

Specific topics for the special session include but are not limited to:

  • Biologically-inspired neural networks and evolutionary computation for robotics
  • Deep neural networks, learning systems and evolutionary computation for robotics such as motion planning, navigation, mapping, localization, and image processing, etc.
  • Bio-inspired system based evolutionary computation on computer vision and image progressing for robotics
  • Human-like learning based evolutionary computation for robotics
  • Neuro-dynamics based evolutionary computation models for robot and vehicle systems
  • Evolutionary optimization for robot and vehicle systems
  • Brain-inspired neural networks based evolutionary computation for robotics
  • Swarm intelligence based evolutionary computation for robotics
  • Evolutionary neuro-fuzzy for robot and vehicle systems
  • Cellular automata for robotics
  • Immune systems for robotics
  • Ant colony optimization algorithms (ACO) for robotics
  • Bee colony optimization algorithms (BCO) for robotics


CEC-68 Special Session on Adaptive Swarm Intelligence Algorithms


Organized by Kyle R. Harrison, Beatrice Ombuki-Berman, and Andries P. Engelbrecht

Scope and Topics

Swarm Intelligence (SI) algorithms consist of a population of semi-autonomous agents coupled with a social interaction mechanism. Despite the characteristically-simple rules governing each individual agent, an intelligent collective behaviour emerges as a result of the social interactions among agents. Often, the emergence of such collective intelligence is contingent upon employing an appropriate configuration of the algorithm. However, the optimal configuration(s) for the algorithms are typically problem dependent and may change throughout the search process. Thus, determining an appropriate configuration a priori may lead to sub-optimal performance. To address the shortcomings of a priori configuration, adaptive SI algorithms aim to modify their configurations during the search process based on various observations.

The purpose of this special session is to provide a forum for researchers to disseminate their original research in the field of adaptive swarm intelligence algorithms. Topics of interest include, but are not limited to, adaptive swarm intelligence algorithms in the following aspects:

  • Adaptive variants of swarm intelligence algorithms (such as particle swarm optimization, ant colony optimization, swarm robotics, bee algorithms, firefly algorithms, bat algorithms, bacterial foraging optimization, stochastic diffusion search)
  • New self-adaptive schemes
  • Empirical analysis of adaptive algorithms
  • Analysis of convergence behavior
  • Sensitivity analysis of control parameters
  • Adaptive algorithms in dynamic environments
  • Adaptive multi-objective algorithms
  • Automated cooperation/competition mechanisms
  • Algorithmic state categorization
  • Automated population sizing and structuring
  • Adaptive inter-agent communication mechanisms


CEC-69 Special Session on Evolutionary Computation for Sensors and UAV Applications


Organized by Patryk Kot, Andy Shaw, and Thar Baker

Scope and Topics

Extensive research has been developed in computational intelligence and evolutionary computing, ranging from theoretical foundations, principles, to practical applications across various domains including medical, industry and education. It has been widely recognized that the use of Sensor technologies and UAV Platforms is increasing among researchers and developers. It is required that sensors can perform a rapid assessment and analysis of collected data to provide real time feedback to the end users. UAVs are required to perform autonomous paths optimization for different research purposes. Researchers are exploring potential novel evolutionary computation solutions for real time analysis.

The proposed session aims at demonstrating the latest research and development on evolutionary computation and their applications in sensors development and unmanned aerial vehicle UAV platform optimization. List of main topics include but not limited to:

  • Evolutionary Computation for 3D digitalization of Cultural heritage
  • Evolutionary Computation for 3D architecture
  • Evolutionary Computation for real-time sensor measurements
  • Evolutionary Computation for medical sensor applications
  • Evolutionary Computation for real-time public health quality assurance sensors
  • Evolutionary Computation for UAV platform development and optimization
  • Evolutionary Computation for SLAM and SFM Applications


CEC-70 Special Session on Speciation


Organized by Gary Parker and Peter Whigham

Scope and Topics

Although Evolutionary Algorithms are very good at mimicking adaptation within a species to optimize solutions for difficult problems, creating algorithms that can mimic the development of two or more species from a common ancestor has been a challenge. There are versions of Evolutionary Algorithms that have some characteristics of speciation, but none that match natural processes. Such algorithms would be a good step in the development of a general purpose Evolutionary Algorithm and would help in understanding the principles of evolution. In regards to this research, we consider a population to be distinct (and a separate species) if it is made up of individuals that are unable to produce viable offspring with individuals from the other population or if offspring are produced, they are sterile. The short term goal, which is reasonable for this special session, is to have individuals of differing species choose not to mate and if they do produce offspring, the offspring do not continue to reproduce. In this way, the gene pools for each of the species will be isolated.

The purpose of this special session is to bring together people working on Evolutionary Algorithms that tend toward or have the potential for speciation. Some possible topics of interest include:

  • Evolutionary algorithms mimicking allopatric or sympatric speciation
  • Environments for research in natural speciation
  • Biologically-inspired models of interactive agents
  • Spatially-structured populations
  • Niching
  • Island models
  • Use of topology in populations
  • Formation of sub-populations
  • Selection criteria in evolutionary algorithms
  • Co-evolution
  • Multi-agent systems
  • Multimodal function optimization


CEC-71 Special Session on Hybrid Metaheuristics for Automatic Data Clustering and Analysis


Organized by Siddhartha Bhattacharyya

Scope and Topics

Of late, scientists have stressed upon the hybrid metaheuristics, which being a judicious combination of several other metaheuristics, algorithms from mathematical programming, constraint programming, or machine learning algorithms, have been found to be more robust and failsafe. The advent of the quantum computing paradigm has also given an impetus to evolving time efficient hybrid metaheuristics, where the conjoined principles of quantum mechanics successfully enhance the real time performance of the hybrid metaheuristics. Clustering or cluster analysis partitions a dataset into a meaningful group of similar objects. However, the existing methods require an a priori knowledge about the number of clusters present in the dataset. Automatic clustering, on the other hand, aims to find out the optimal number of clusters from a dataset without having any prior knowledge about the number of clusters.

This special session aims to bring together recent advances in methodological approaches and applied techniques related to the use of hybrid metaheuristics for automatic clustering of data and its analysis. We are soliciting contributions on (but not limited to) the following:

  • Hybrid metaheuristics
  • Memetic algorithms
  • Parallel metaheuristics
  • Tabu search and simulated annealing
  • Novel nature inspired metaheuristics
  • Variable neighborhood search and memory-based optimization
  • Quantum inspired hybrid metaheuristics
  • Multi-valued quantum logic based quantum metaheuristics
  • Quantum entanglement enhanced metaheuristics
  • Single objective solutions for linearly separable clusters
  • Multi-objective incarnations for non-linearly separable clusters
  • Cluster analysis indices
  • Image processing and pattern recognition
  • Medical Image Analysis
  • Remote Sensing Applications
  • Big Data Analysis
  • Portfolio Optimization
  • Bioinformatics


CEC-72 Special Session on Design of New Nanomaterials Using Evolutionary Optimization


Organized by Pavel Osmera, Daniel Zuth, and Tomas Marada

Scope and Topics

The aim of this special session is designing a multi-disciplinary program for automated design of new materials requiring knowledge of physical chemistry, evolutionary optimization (grammatical evolution), Python programming, 3D graphics and mathematics for calculating fitness functions and 3D positions and energies of individual atoms. The prediction of new nanostructures requires knowledge of physical chemistry and the ability to select a suitable method of evolutionary optimization. The first such predictor was designed by Organov (USPEX), which combines the knowledge of quantum physics and evolutionary optimization. Since quantum physics does not contain a structural description of atoms, this predictor is capable of designing structures with hundreds of atoms on supercomputers. The combination of the structural description of atomic nuclei and grammatical evolution does not have this limitation.

The topics of this special session include:

  • Introductory work in this perspective area
  • Various disciplines (physical chemistry, evolutionary optimization, programming, 3D graphics, position calculations and atom energies) that can support and engage in this challenging goal
  • Linking the necessary scientific multidisciplinary areas in design of new material models
  • Computer designs of new nanomaterial models
  • Ring patterns of atoms, molecules and their magnetic moments (a structural description)
  • Grammatical evolution for the design of new nanomaterial models
  • Verification of computer models using appropriate experiments


CEC-73 Special Session on Evolutionary and Machine Learning Algorithms in Crowdsourcing


Organized by Anirban Mukhopadhyay and Ujjwal Maulik

Scope and Topics

Crowdsourcing refers to the practice of involving a crowd or group of people for accomplishing some large-scale task in an efficient or innovative way. Due to involvement of malicious crowd workers, it is sometimes difficult to utilize the crowdsourced opinions in decision making. Different evaluation criteria such as cost, time and accuracy are to be optimized to build an effective crowdsourcing framework. Therefore, evolutionary and other metaheuristic optimization techniques can be used in solving these complex problems. Moreover, machine learning techniques like deep neural networks, support vector machines, random forest, Bayesian learning, Markov chains, and probabilistic graphical models can be employed in different problems like aggregating crowd opinions, classifying crowd workers, performing fusion of crowdsourced solutions, etc. Thus combination of evolutionary algorithms and machine learning methods can solve various crowdsourcing problems in different domains, including recommender systems, social networks, education, e-commerce and healthcare.

This special session aims to bring together researchers from both academia and industry to share the ideas of the application of machine learning techniques and evolutionary computation in real-life problems that employ crowdsourcing. The potential topics of interest include, but not limited to:

  • Group decision making from crowdsourcing
  • Information fusion of crowdsourced solutions
  • Judgment analysis of crowdsourced opinions
  • Collaborative and competitive crowdsourcing
  • Multi-objective optimization in crowdsourcing based decision making
  • Missing response estimation for better judgment analysis
  • Task assignment in crowdsourcing
  • Entity-resolution based on crowdsourcing
  • Crowdsourcing in healthcare and bioinformatics
  • Crowdsourcing in recommender systems
  • Crowdsourcing for social good
  • Crowdsourcing in learning and education


CEC-74 Special Session on Benchmarking of Evolutionary Algorithms for Discrete Optimization


Organized by Markus Wagner, Thomas Weise, and Aleš Zamuda

Scope and Topics

Evolutionary Computation (EC) is a huge and expanding field, attracting more and more interests from both academia and industry. For the discrete domain and application scenarios, we want to pick the best algorithms. Actually, we want to do more, we want to improve upon the best algorithm. This requires a deep understanding of the problem at hand, the performance of the algorithms we have for that problem, the features that make instances of the problem hard for these algorithms, and the parameter settings for which the algorithms perform the best. Benchmarking is the engine driving research in the fields of EAs for decades, while its potential has not been fully explored.

The goal of this special session is to solicit original works on the research in benchmarking: Works which contribute to the domain of benchmarking of discrete algorithms from the field of Evolutionary Computation, by adding new theoretical or practical knowledge. Papers which only apply benchmarking are not in the scope of the special session.

This special session wants to bring together experts on benchmarking, evolutionary computation algorithms, and discrete optimization.

  • Modelling of algorithm behaviors and performance
  • Visualizations of algorithm behaviors and performance
  • Statistics for performance comparison (robust statistics, PCA, ANOVA, statistical tests, ROC, …)
  • Evaluation of real-world goals such as algorithm robustness, and reliability
  • Theoretical results for algorithm performance comparison
  • Comparison of theoretical and empirical results
  • New benchmark problems
  • Comparison of algorithms in non-traditional scenarios
  • Comparative surveys with new ideas


CEC-75 Special Session on 100-Digit Challenge on Single Objective Numerical Optimization


Organized by P N Suganthan, K. V. Price, and Mostafa Z Ali

Scope and Topics

Research on single objective optimization algorithms often forms the foundation for more complex scenarios, such as niching algorithms and both multi-objective and constrained optimization algorithms. Traditionally, single objective benchmark problems are also the first test for new evolutionary and swarm algorithms. Additionally, single objective benchmark problems can be transformed into dynamic, niching composition, computationally expensive and many other classes of problems. It is with the goal of better understanding the behavior of swarm and evolutionary algorithms as single objective optimizers that we are introducing the 100-Digit Challenge. The SIAM 100-Digit Challenge was developed in 2002 by Nick Trefethen in conjunction with the Society for Industrial and Applied Mathematics (SIAM) as a test for high-accuracy computing. Specifically, the challenge was to solve 10 hard problems to 10 digits of accuracy. One point was awarded for each correct digit, making the maximum score 100, hence the name. Contestants were allowed to apply any method to any problem and take as long as needed to solve it. Out of the 94 teams that entered, 20 scored 100 points and 5 others scored 99. In a similar vein, we propose the 100-Digit Challenge. In contrast to the SIAM version, this 100-Digit Challenge asks contestants to solve all ten problems with one algorithm, although limited control parameter “tuning” for each function will be permitted to restore some of the original contest’s flexibility. Another difference is that the score for a given function is the average number of correct digits in the best 25 out of 50 trials. All population-based methods are acceptable.