Divide to Coordinate: Coevolutionary Problem Solving
نویسندگان
چکیده
Optimization of systems with many connicting constraints arises in numerous settings. Common optimization procedures seek to improve performance of the system as a whole. We show that coevolutionary problem solving, in which a system is partitioned into subsystems each of which sellshly optimizes, can lead to enhanced performance as a collective emergent property. Optimally partitioned systems often lie near a transition from order to chaos.
منابع مشابه
Evolving Neural Networks with Collaborative Species
We present a coevolutionary architecture for solving decomposable problems and apply it to the evolution of artificial neural networks. Although this work is preliminary in nature it has a number of advantages over non-coevolutionary approaches. The coevolutionary approach utilizes a divide-and-conquer technique in which species representing simpler subtasks are evolved in separate instances of...
متن کامل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 anothe...
متن کاملDivide-and-Coordinate by Egalitarian Utilities: Turning DCOPs into Egalitarian Worlds
A Distributed Constraint Optimization Problem (DCOP) [7, 6] is a formal framework that can model many cooperative multi-agents domains. The Divide-and-Coordinate (DaC) framework [11] is one of the few general frameworks for solving DCOPs that provides bounds on solution quality for incomplete algorithms. In this paper, we formulate a novel DaC algorithm, the so-called Egalitarian Utilities Divi...
متن کامل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...
متن کاملDeQED: An Efficient Divide-and-Coordinate Algorithm for DCOP
This paper presents a new DCOP algorithm called DeQED (Decomposition with Quadratic Encoding to Decentralize). DeQED is based on the Divide-and-Coordinate (DaC) framework, where the agents repeat solving their updated local sub-problems (the divide stage) and exchanging coordination information that causes to update their local sub-problems (the coordinate stage). Unlike other DaC-based DCOP al...
متن کامل