Feature Subset Selection By Estimation Of Distribution Algorithms
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
IEEE Transactions on Evolutionary Computation
A hybrid heuristic for the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Elitism-based compact genetic algorithms
IEEE Transactions on Evolutionary Computation
A family of compact genetic algorithms for intrinsic evolvable hardware
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
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.