An improved co-evolution genetic algorithm for combinatorial optimization problems

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Li, N., & Luo, Y. (2011). An improved co-evolution genetic algorithm for combinatorial optimization problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6728 LNCS, pp. 506–513). https://doi.org/10.1007/978-3-642-21515-5_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free