AbstractFor the problem that interactive genetic algorithms lack a way of measuring the uncertainty of evaluation, a method with grey level for discrete fitness is proposed to deal with this problem. Through analyzing the grey level of discrete fitness, information reflecting the distribution of an evolutionary population is abstracted. Based on these, the adaptive probabilities of crossover and mutation operation of an evolutionary individual are proposed. The algorithm is applied to a fashion evolutionary design system, the simulation results indicate that the algorithm can effectively resolve human fatigue and improve the performance of optimization
A formalism is presented for modelling the evolutionary dynamics of a population of gene sequences. ...
Genetic programming (GP) is an automated method for creating a working computer program from a high-...
Proceeding of: EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and...
Abstract. Traditional interactive genetic algorithms often have a small population size because of a...
Interactive genetic algorithms (IGAs), proposed in mid 1980s, are effective methods to solve an opti...
Interactive genetic algorithms (IGAs), proposed in mid 1980s, are effective methods to solve an opti...
Abstract—Interactive genetic algorithms (IGAs) are effective methods to solve an optimization proble...
Genetic Algorithms (GAs) are a popular and robust strategy for optimisation problems. However, these...
This paper investigates a methodology for adaptation of the mutation factor within an evolutionary a...
Abstract: Genetic algorithms are search and optimization techniques which have their origin and insp...
Genetic Algorithms (GAs) are commonly used today worldwide. Various observations have been theorized...
In this paper we introduce an adaptive, \u27self-contained\u27 genetic algorithm (GA) with steady-st...
Adaptive Genetic Algorithms extend the Standard Gas to use dynamic procedures to apply evolutionary ...
This book is intended as a reference both for experienced users of evolutionary algorithms and for r...
Abstract. Nowadays the possibilities of evolutionary algorithms are widely used in many optimization...
A formalism is presented for modelling the evolutionary dynamics of a population of gene sequences. ...
Genetic programming (GP) is an automated method for creating a working computer program from a high-...
Proceeding of: EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and...
Abstract. Traditional interactive genetic algorithms often have a small population size because of a...
Interactive genetic algorithms (IGAs), proposed in mid 1980s, are effective methods to solve an opti...
Interactive genetic algorithms (IGAs), proposed in mid 1980s, are effective methods to solve an opti...
Abstract—Interactive genetic algorithms (IGAs) are effective methods to solve an optimization proble...
Genetic Algorithms (GAs) are a popular and robust strategy for optimisation problems. However, these...
This paper investigates a methodology for adaptation of the mutation factor within an evolutionary a...
Abstract: Genetic algorithms are search and optimization techniques which have their origin and insp...
Genetic Algorithms (GAs) are commonly used today worldwide. Various observations have been theorized...
In this paper we introduce an adaptive, \u27self-contained\u27 genetic algorithm (GA) with steady-st...
Adaptive Genetic Algorithms extend the Standard Gas to use dynamic procedures to apply evolutionary ...
This book is intended as a reference both for experienced users of evolutionary algorithms and for r...
Abstract. Nowadays the possibilities of evolutionary algorithms are widely used in many optimization...
A formalism is presented for modelling the evolutionary dynamics of a population of gene sequences. ...
Genetic programming (GP) is an automated method for creating a working computer program from a high-...
Proceeding of: EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and...