Sciweavers

669 search results - page 113 / 134
» An evolutionary method for complex-process optimization
Sort
View
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
15 years 6 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
114
Voted
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
15 years 6 months ago
Genetic algorithms using low-discrepancy sequences
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
Shuhei Kimura, Koki Matsumura
GECCO
2010
Springer
200views Optimization» more  GECCO 2010»
15 years 5 months ago
Multivariate multi-model approach for globally multimodal problems
This paper proposes an estimation of distribution algorithm (EDA) aiming at addressing globally multimodal problems, i.e., problems that present several global optima. It can be r...
Chung-Yao Chuang, Wen-Lian Hsu
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
15 years 4 months ago
Aspects of adaptation in natural and artificial evolution
This work addresses selected aspects of natural evolution, especially of the field of population genetics, that are considered to be meaningful for algorithmic further development...
Michael Affenzeller, Stefan Wagner 0002, Stephan M...
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 4 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....