A weight based compact genetic algorithm

ABSTRACT

In order to improve the performance of the compact Genetic Algorithm (cGA) to solve difficult optimization problems, an improved cGA which named as the weight based compact Genetic Algorithm (wcGA) is proposed. In the wcGA, S individuals are generated from the probability vector in each generation, when the winner competing with the other S-1 individuals to update the probability vector, different weights are multiplied to each solution according to the sequence of the solution ranked in the S-1 individuals. Experimental results on three kinds of Benchmark functions show that the proposed algorithm has higher optimal precision than that of the standard cGA and the cGA simulating higher selection pressures.

REFERENCES

• 1: Harik, G. R., Lobo, F. G.,and Goldberg ,D. E. 1999 The compact Genetic Algorithm. IEEE Transactions on Evolutionary Computation, 3(4):287--297.
• 2: Larrañaga, P., Lozano,J,A. 2002 Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers.
• 3: Gallagher, J. C., Vigraham, S.,and Kramer, G. R. 2004. A family of compact Genetic Algorithms for intrinsic evolvable hardware. IEEE Transactions on Evolutionary Computation, 8(2):111--126.
• 4: Erick Cantú-Paz, Feature Subset Selection By Estimation Of Distribution Algorithms, Proceedings of the Genetic and Evolutionary Computation Conference, p.303-310, July 09-13, 2002
• 5: Baraglia, R., Hidalgo, J. I., and Perego, R. 2001 A hybrid heuristic for the traveling salesman problem. IEEE Transactions on Evolutionary Computation ,5:613--622.
• 6: Ahn, C.W., Ramakrishna, R.S. 2003 Elitism-based compact genetic algorithms. IEEE Transactions on Evolutionary Computation, 7(4):367--385.

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.8 Problem Solving, Control Methods, and Search

General Terms:
Algorithms, Experimentation, Performance

Keywords:
compact genetic algorithm, selection pressure, weight