Hybrid model of genetic algorithm and cultural algorithms for optimization problem

Authors:
Fang Gao;Hongwei Liu;Qiang Zhao;Gang Cui
Affiliations:
School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China;School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China;School of Traffic Transportation Engineering, Northeast Forestry University, Harbin, P.R. China;School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China
Venue:
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Year:
2006

Citing 4
Cited 1

Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
A real-coded genetic algorithm for training recurrent neural networks

Neural Networks
Culturizing Differential Evolution for Constrained Optimization

ENC '04 Proceedings of the Fifth Mexican International Conference in Computer Science
Optimal placement of active members for truss structure using genetic algorithm

ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II

A hybrid co-evolutionary cultural algorithm based on particle swarm optimization for solving global optimization problems

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

To solve constrained optimization problems, we propose to integrate genetic algorithm (GA) and cultural algorithms (CA) to develop a hybrid model (HMGCA). In this model, GA's selection and crossover operations are used in CA's population space. A direct comparison-proportional method is employed in GA's selections to keep a certain proportion of infeasible but better (with higher fitness) individuals, which is beneficial to the optimization. Elitist preservation strategy is also used to enhance the global convergence. GA's mutation is replaced by CA based mutation operation which can attract individuals to move to the semi-feasible and feasible region of the optimization problem to improve search direction in GA. Thus it is possible to enhance search ability and to reduce computational cost. A simulation example shows the effectiveness of the proposed approach.