Function Optimization with Coevolutionary Algorithms
نویسندگان
چکیده
The problem of parallel and distributed function optimization with coevolutionary algorithms is considered. Two coevolutionary algorithms are used for this purpose and compared with sequential genetic algorithm (GA). The first coevolutionary algorithm called a loosely coupled genetic algorithm (LCGA) represents a competitive coevolutionary approach to problem solving and is compared with another coevolutionary algoritm called cooperative coevolutionary genetic algorithm (CCGA). The algorithms are applied for parallel and distributed optimization of a number of test functions known in the area of evolutionary computation. We show that both coevolutionary algorithms outperform a sequential GA. While both LCGA and CCGA algorithms offer high quality solutions, they may compete to outperform each other in some specific test optimization problems.
منابع مشابه
Parallel and Distributed Computing with Coevolutionary Algorithms
The problem of parallel and distributed function optimization is considered. Two coevolutionary algorithms with different degrees of parallelism and different levels of a global coordination are used for this purpose and compared with sequential genetic algorithm (GA). The first coevolutionary algorithm called a loosely coupled genetic algorithm (LCGA) represents a competitive coevolutionary ap...
متن کاملExploring the Explorative Advantage of the Cooperative Coevolutionary (1+1) EA
Using a well-known cooperative coevolutionary function optimization framework, a very simple cooperative coevolutionary (1+1) EA is defined. This algorithm is investigated in the context of expected optimization time. The focus is on the impact the cooperative coevolutionary approach has and on the possible advantage it may have over more traditional evolutionary approaches. Therefore, a system...
متن کاملOn the improvement of coevolutionary optimizers by learning variable interdependencies
During the last years, cooperating coevolutionary algorithms could improve convergence of several optimization benchmarks significantly by placing each dimension of the search space in its own subpopulation. Though, their general applicability is restricted by problems with epistatic links between problem dimensions – a major obstacle in cooperating coevolutionary function optimization. This wo...
متن کاملPareto Optimality in Coevolutionary Learning
We develop a novel coevolutionary algorithm based upon the concept of Pareto optimality. The Pareto criterion is core to conventional multi-objective optimization (MOO) algorithms. We can think of agents in a coevolutionary system as performing MOO, as well: An agent interacts with many other agents, each of which can be regarded as an objective for optimization. We adapt the Pareto concept to ...
متن کاملThe Cooperative Coevolutionary (1+1) EA
Coevolutionary algorithms are variants of traditional evolutionary algorithms and are often considered more suitable for certain kinds of complex tasks than noncoevolutionary methods. One example is a general cooperative coevolutionary framework for function optimization. This paper presents a thorough and rigorous introductory analysis of the optimization potential of cooperative coevolution. ...
متن کامل