We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Immune Algorithms have been used widely and successfully in many computational intelligence areas including optimization. Given the large number of variants of each operator of thi...
Vincenzo Cutello, Giuseppe Nicosia, Mario Romeo, P...
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
Abstract. This paper introduces a new technique called adaptive elitistpopulation search method for allowing unimodal function optimization methods to be extended to efficiently lo...
Multiobjective optimization problems with many local Pareto fronts is a big challenge to evolutionary algorithms. In this paper, two operators, biased initialization and biased cr...
Aimin Zhou, Qingfu Zhang, Yaochu Jin, Bernhard Sen...