An improved co-evolution genetic algorithm for combinatorial optimization problems

Authors:
Nan Li;Yi Luo
Affiliations:
School of Control and Computer Engineering, North China Electric Power University, Beijing, China;School of Control and Computer Engineering, North China Electric Power University, Beijing, China
Venue:
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
Year:
2011

Citing 5
Cited 0

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Bayesian optimization algorithm: from single level to hierarchy

Bayesian optimization algorithm: from single level to hierarchy
Kinematics control of redundant manipulators using a CMAC neural network combined with a genetic algorithm

Robotica
A multiagent evolutionary algorithm for combinatorial optimization problems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an improved co-evolution genetic algorithm (ICGA), which uses the methodology of game theory to solve the mode deception and premature convergence problem. In ICGA, groups become different players in the game. Mutation operator is designed to simulate the situation in the evolutionary stable strategy. Information transfer mode is added to ICGA to provide greater decision-making space. ICGA is used to solve large-scale deceptive problems and an optimal control problem. Results of numerical tests validate the algorithm's excellent performance.