Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...
Ivan De Falco, Renato Del Balio, Ernesto Tarantino...
In this Chapter we present the modification of a Differential Evolution algorithm to solve constrained optimization problems. The changes include a deterministic and a self-adapti...
The dynamic optimization problem concerns finding an optimum in a changing environment. In the tracking problem, the optimizer should be able to follow the optimum’s changes ov...
Claudio Rossi, Antonio Barrientos, Jaime del Cerro
Versioning systems such as CVS exhibit a large potential to investigate and understand the evolution of large software systems. Bug Reporting systems such as Bugzilla help to unde...
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...