669 search results - page 110 / 134 » An evolutionary method for complex-process optimization |
121
Voted
CEC
2007
IEEE
15 years 19 days ago
2007
IEEE
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...
COR
2007
15 years 13 days ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
84
Voted
CORR
2004
Springer
15 years 9 days ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
94
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which d...
119
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...