Parallel Implementations of Evolutionary Strategies
نویسندگان
چکیده
Evolutionary algorithms can eeciently solve a diverse set of optimization problems. The convergence rate of these techniques improve with larger population sizes but at the expense of an increased in computation time per generation. This paper presents an evolutionary algorithm which uses a large population for rapid convergence but a parallel implementation to minimize overall computation time. An instance of the preventive maintenance problem is used to evaluate this parallel implementation.
منابع مشابه
Adaptive integration using evolutionary strategies
Multivariate integration problems arising in the real world often lead to computationally intensive numerical solutions. If the singularities and/or peaks in the integrand are not known a priori, the use of adaptive methods is recommended. The eeciency of adaptive methods depends heavily on focusing on the sub-regions that contain singularities or peaks in the integrands. In this paper, we pres...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملDISPAR-Tournament: A Parallel Population Reduction Operator That Behaves Like a Tournament
This paper presents an experimental study of different variants of tournament selection, and proposes a new DISPAR-tournament (Disjoint Sets Parallel tournament) operator for population reduction to be used in parallel implementations of evolution strategies and other evolutionary algorithms.
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملAn MPI Implementation of the Fast Messy Genetic Algorithm
The fast messy genetic algorithm fmGA belongs to a class of algorithms inspired by the principles of evolution known appropriately as evolutionary algorithms EAs These techniques operate by applying biologically inspired operators such as recom bination mutation and selection to a population of individuals EAs are frequently applied as optimum seeking techniques by way of analogy to the princip...
متن کامل