FOGA
2011
13 years 2 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
PPSN
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
CORR
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. This paper presents two different efficiency-enhancement techniques for probabilistic model building genetic algorithms. The first technique proposes the use of a mutatio...
AMC
2007
13 years 11 months ago
2007
Abstract–A new evolutionary programming algorithm (NEP) using the non-uniform mutation operator instead of Gaussian or Cauchy mutation operators is proposed. NEP has the merits o...
CEC
2010
IEEE
14 years 16 days ago
2010
IEEE
The performance of Evolutionary Programming (EP) is affected by many factors (e.g. mutation operators and selection strategies). Although the conventional approach with Gaussian mu...
EUSFLAT
2003
14 years 25 days ago
2003
Since the advent of evolution strategies many attempts have been done to improve the mutation operator [7]. The first enhancement could be seen in the
GECCO
2006
Springer
14 years 3 months ago
2006
Springer
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
ICTAI
2006
IEEE
14 years 5 months ago
2006
IEEE
We propose a novel algorithm called GA-MDP for solving the frequency assigment problem. GA-MDP inherits the spirit of genetic algorithms with an adaptation of Markov Decision Proc...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
Evolution strategy (ES) and particle swarm optimization (PSO) are two of the most popular research topics for tackling real-parameter optimization problems in evolutionary computa...