94 search results - page 7 / 19 » On the usefulness of infeasible solutions in evolutionary se... |
GECCO
2008
Springer
13 years 7 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
AE
2007
Springer
14 years 27 days ago
2007
Springer
Abstract. How has a stack of n blocks to be arranged in order to maximize its overhang over a table edge while being stable? This question can be seen as an example application for...
GECCO
2006
Springer
13 years 10 months ago
2006
Springer
Genetic Algorithm (GA) is known as a potent multiobjective optimization method, and the effectiveness of hybridizing it with local search (LS) has recently been reported in the li...
GECCO
2010
Springer
13 years 10 months ago
2010
Springer
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...
AISB
1994
Springer
13 years 10 months ago
1994
Springer
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...