This paper analyzes some technical and practical issues concerning the heterogeneous execution of parallel genetic algorithms (PGAs). In order to cope with a plethora of different operating systems, security restricti...
详细信息
This paper analyzes some technical and practical issues concerning the heterogeneous execution of parallel genetic algorithms (PGAs). In order to cope with a plethora of different operating systems, security restrictions, and other problems associated to multi-platform execution. we use Java to implement a distributed PGA model. The distributed PGA runs at the same time on different machines linked by different kinds of communication networks. This algorithm benefits from the computational resources offered by modern LANs and by Internet, therefore allowing researchers to solve more difficult problems by using a large set of available machines. We analyze the way in which such heterogeneous systems affect the genetic search for two problems. Our conclusion is that super-linear performance can be achieved not only in homogeneous but also in heterogeneous clusters of machines. In addition, we study some special features of the running platforms for PGAs, and basically find out that heterogeneous computing can be as efficient or even more efficient than homogeneous computing for parallel heuristics. (C) 2002 Elsevier Science (USA)
Multicore processors are becoming common whereas current genetic algorithm-based implementation techniques for synthesizing Field Programmable Gate Array (FPGA) circuits do not fully exploit this hardware trend. Genet...
详细信息
ISBN:
(纸本)9781618397867
Multicore processors are becoming common whereas current genetic algorithm-based implementation techniques for synthesizing Field Programmable Gate Array (FPGA) circuits do not fully exploit this hardware trend. genetic Algorithm (GA) based techniques are known to optimize multiple objectives, and automate the process of digital circuit design. In this paper, parallel GA algorithms are proposed for the synthesis of digital circuits for LUT-based FPGA architectures. parallel modes of the GA such as Master-Slave and the Island model are compared to see which scheme results in better speedup and quicker convergence for effective utilization of current multicore hardware. Speedup of about five over the sequential single-threaded implementation is achieved with both the schemes on a six-core machine. Convergence is also found in fewer number of generations. The methods described here-in can be employed in Evolvable Hardware Systems as well as FPGA CAD tools.
Making geneticalgorithms (GAs) distributed in an on demand fashion involves different phases from resources allocation to actual deployment and execution. We propose a cloud architecture with a conceptual workflow ab...
详细信息
ISBN:
(纸本)9781450343237
Making geneticalgorithms (GAs) distributed in an on demand fashion involves different phases from resources allocation to actual deployment and execution. We propose a cloud architecture with a conceptual workflow able to cover each GAs distribution phase.
Designing a fuzzy system involves defining membership functions and constructing rules. Carrying out these two steps manually often results in a poorly performing system. geneticalgorithms (GAs) has proved to be a us...
详细信息
ISBN:
(纸本)0819428396
Designing a fuzzy system involves defining membership functions and constructing rules. Carrying out these two steps manually often results in a poorly performing system. geneticalgorithms (GAs) has proved to be a useful tool for designing optimal fuzzy controller. In order to increase the efficiency and effectiveness of their application, parallel GAs (PAGs), evolving synchronously several populations with different balances between exploration and exploitation, have been implemented using a SIMD machine (APE100/Quadrics). The parameters to be identified are coded in such a way that the algorithm implicitly provides a compact fuzzy controller, by finding only necessary rules and removing useless inputs from them. Early results, working on a fuzzy controller implementing the wall-following task for a real vehicle as a test case, provided better fitness values in less generations with respect to previous experiments made using a sequential implementation of GAs.
This paper describes a framework for developing parallel genetic algorithms (GAs) on the Hadoop platform, following the paradigm of MapReduce. The framework allows developers to focus on the aspects of GA that are spe...
详细信息
ISBN:
(纸本)9781450331968
This paper describes a framework for developing parallel genetic algorithms (GAs) on the Hadoop platform, following the paradigm of MapReduce. The framework allows developers to focus on the aspects of GA that are specific to the problem to be addressed. Using the framework a GA application has been devised to address the Feature Subset Selection problem. A preliminary performance analysis showed promising results.
elephant56 is an open source framework for the development and execution of single and parallel genetic algorithms (GAs). It provides high level functionalities that can be reused by developers, who no longer need to ...
详细信息
ISBN:
(纸本)9781450343237
elephant56 is an open source framework for the development and execution of single and parallel genetic algorithms (GAs). It provides high level functionalities that can be reused by developers, who no longer need to worry about complex internal structures. In particular, it offers the possibility of distributing the GAs computation over a Hadoop MapReduce cluster of multiple computers. In this paper we describe the design and the implementation details of the framework that supports three different models for parallel GAs, namely the global model, the grid model and the island model. Moreover, we provide a complete example of use.
Groundwater resource management is a challenging problem faced by almost all the countries. Mathematical models of these problems often turn out to be illdefined subject to several variables and constraints. Sophistic...
详细信息
ISBN:
(纸本)9781424450534
Groundwater resource management is a challenging problem faced by almost all the countries. Mathematical models of these problems often turn out to be illdefined subject to several variables and constraints. Sophisticated algorithms are needed in order to deal efficiently with such problems. In the past few decades much attention has been paid to heuristic techniques like geneticalgorithms etc which can easily solve such problems. Further, in order to tackle the large number of involved parameters in these problems parallel version of GAs is more effective than the basic GAs. In this paper an attempt is made to review the application of PGA on groundwater management problems.
We explore several different techniques in our quest to improve the overall model performance of a genetic algorithm calibrated probabilistic cellular automata. We use the Kappa statistic to measure correlation betwee...
详细信息
ISBN:
(纸本)1595930108
We explore several different techniques in our quest to improve the overall model performance of a genetic algorithm calibrated probabilistic cellular automata. We use the Kappa statistic to measure correlation between ground truth data and data predicted by the model. Within the genetic algorithm, we introduce a new evaluation function sensitive to spatial correctness and we explore the idea of evolving different rule parameters for different subregions of the land. We reduce the time required to run a simulation from 6 hours to 10 minutes by parallelizing the code and employing a 10-node cluster. Our empirical results suggest that using the spatially sensitive evaluation function does indeed improve the performance of the model and our preliminary results also show that evolving different rule parameters for different regions tends to improve overall model performance.
This paper develops a method to compute the Stackelberg equilibria in sequential games. We construct a normal form game which is interactively played by an artificially intelligent leader, GAL, and a follower, GA(F). ...
详细信息
This paper develops a method to compute the Stackelberg equilibria in sequential games. We construct a normal form game which is interactively played by an artificially intelligent leader, GAL, and a follower, GA(F). The leader is a genetic algorithm breeding a population of potential actions to better anticipate the follower's reaction. The follower is also a genetic algorithm training on-line a suitable neural network to evolve a population of rules to respond to any move in the leader's action space. When GAs repeatedly play this game updating each other synchronously, populations converge to the Stackelberg equilibrium of the sequential game. We provide numerical examples attesting to the efficiency of the algorithm. (C) 2002 Elsevier Science B.V. All rights reserved.
geneticalgorithms (GAs) have been widely and successfully used for solving complex optimisation problems. This paper presents the research being conducted under the ESPRIT III PAPAGENA project which aims to establish...
详细信息
暂无评论