Clustering-Based Adaptive Crossover and Mutation Probabilities for Genetic Algorithms

  title={Clustering-Based Adaptive Crossover and Mutation Probabilities for Genetic Algorithms},
  author={Jun Zhang and Henry Shu-hung Chung and Wai Lun Lo},
  journal={IEEE Transactions on Evolutionary Computation},
Research into adjusting the probabilities of crossover and mutation pm in genetic algorithms (GAs) is one of the most significant and promising areas in evolutionary computation. px and pm greatly determine whether the algorithm will find a near-optimum solution or whether it will find a solution efficiently. Instead of using fixed values of px and pm , this paper presents the use of fuzzy logic to adaptively adjust the values of px and pm in GA. By applying the K-means algorithm, distribution… 

Figures and Tables from this paper

Improvement of Genetic Algorithm Using a Fuzzy Control Combined with Coevolutionary Algorithm

In order to achieve the best performance in genetic algorithm, proper determination of parameters is necessary. This paper addresses the intelligent determination of the crossover probability between

Index-based genetic algorithm for continuous optimization problems

The results show that the index-based strategy and the OLS in IndexGA significantly enhance the performance of GAs in terms of both convergence rate and solution accuracy.

Adaptive control of acceleration coefficients for particle swarm optimization based on clustering analysis

The proposed method has been applied to optimize multidimensional mathematical functions, and the simulation results demonstrate that the proposed method performs with a faster convergence rate and better solutions when compared with the methods with fixed values of c1 and c2.

Enhancing the performance of evolutionary algorithms: A novel maturity-based adaptation strategy

Experimental results on eight benchmark functions show that the proposed maturity-based adaptation strategy for EAs can bring significant improvements in search speed, solution accuracy and robustness.

Adaptive genetic algorithm based on density distribution of population

A parameter adaptation strategy which aims at evaluating the density distribution of population as well as both the fitness values comprehensively, and adapting the parameters accordingly is proposed.

Differential evolution algorithm with PCA-based crossover

This paper proposes to use the principal component analysis (PCA) technique to rebuild a coordinate system so that the correlations among variables are decreased for the crossover operation of DE.

A Selection Process for Genetic Algorithm Using Clustering Analysis

This article presents a newly proposed selection process for genetic algorithms on a class of unconstrained optimization problems. The k-means genetic algorithm selection process (KGA) is composed of

A mutation operator based on a Pareto ranking for multi-objective evolutionary algorithms

A new mutation operator is presented in the context of Multi-Objective Evolutionary Algorithms, MOEA’s, which makes use of the definition of Pareto optimality and manages the maximal amplitude or maximal step size of the mutation according to the Pare to layer of the individual and also of the iteration number.

AMCPA: A Population Metaheuristic With Adaptive Crossover Probability and Multi-Crossover Mechanism for Solving Combinatorial Optimization Problems

The presented AMCPA changes the philosophy of the basic GAs, giving priority to the mutation phase and providing dynamism to the crossover probability, to prevent the premature convergence.



Adaptive probabilities of crossover and mutation in genetic algorithms

An efficient approach for multimodal function optimization using genetic algorithms (GAs) and the use of adaptive probabilities of crossover and mutation to realize the twin goals of maintaining diversity in the population and sustaining the, convergence capacity of the GA are described.

Are Genetic Algorithms Function Optimizers?

It is argued that a proper under­ standing of GAs in this broader adaptive systems context is a necessary prerequisite for understanding their potential application to any problem domain and insights are used to better understand the strengths and limitations ofGAs as function optimizers.

A Parallel Genetic Algorithm for Automated Electronic Circuit Design

A parallel GA and its use in automated high-level circuit design and discussion of one such circuit-construction programming language and how evolution can generate useful analog circuit designs are discussed.

Optimization of Control Parameters for Genetic Algorithms

  • J. Grefenstette
  • Computer Science
    IEEE Transactions on Systems, Man, and Cybernetics
  • 1986
GA's are shown to be effective for both levels of the systems optimization problem and are applied to the second level task of identifying efficient GA's for a set of numerical optimization problems.

Evolutionary Computation: Towards a New Philosophy of Machine Intelligence

In-depth and updated, Evolutionary Computation shows you how to use simulated evolution to achieve machine intelligence and carefully reviews the "no free lunch theorem" and discusses new theoretical findings that challenge some of the mathematical foundations of simulated evolution.

Genetic Algorithms + Data Structures = Evolution Programs

  • Z. Michalewicz
  • Computer Science, Economics
    Springer Berlin Heidelberg
  • 1996
GAs and Evolution Programs for Various Discrete Problems, a Hierarchy of Evolution Programs and Heuristics, and Conclusions.

An Analysis of Multi-Point Crossover

Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons

This paper examines recent developments in the field of evolutionary computation for manufacturing optimization with a wide range of problems, from job shop and flow shop scheduling, to process planning and assembly line balancing.