Introduction - If you have any usage issues, please Google them yourself
* here is the procedure of genetic algorithm for the core framework of genetic algorithm:
* the algorithm description of the core part of genetic algorithm
* algorithm steps:
* 1. Initialization
* 1.1 generate initial population coding
* 1.2. Calculate the appropriate value of each individual.
* 1.3, record the current optimal match value and the optimal individual
* 2, selection and inheritance,
* 2.0, if the current optimal match value is often less than the optimal matching value (or not so different) many times, or the number of times of evolution exceeds the set limit, then 4.
* 2.1 the number of individuals and the number of the original population will be selected and copied in proportion to the appropriate value of each individual.
* 2.2, (it is better to disrupt the individual order of the cloned population first) to pair the individual with two pairs of pairs, and generate the same number of offspring.
* 2.3 variation of the next generation population according to a certain probability
* 2.4. Calculate the appropriate value of each individual.
* 2.5, record the current optimal match value and the optimal individual
* 2.6, turn 2
* 3, returns the current optimal match value and its corresponding encoding, and ends.
Packet : 117143201yichuan.rar filelist
yichuan.txt