A pseudo genetic algorithm

作者：Chen Qijian^*; Zhong Yuanchang; Zhang Xiaohong

来源：Neural Computing & Applications, 2010, 19(1): 77-83.

DOI：10.1007/s00521-009-0237-3

• Pseudo genetic algorithm
• Complementaryparent strategy
• Dynamically complementary parents
• Statically complementary parents
• Population diversity
• Search ability
• Computation complexity
• Homogeneous individuals

Random individual initialization tends to generate too many eccentric and homogeneous individuals which cause slow and premature convergence. It needs many operations (selection strategy, incest prevention and mutation) to fix, which consume too much computation and lose many good genes. The proposed complementary-parent strategy initializes every other pair of parents with dynamically or statically complementary chromosomes (such as 010101aEuro broken vertical bar 0101 and 101010aEuro broken vertical bar 1010). Crossover of every generation is only performed between the offspring from the same parents, during which the parents are completely replaced by their own children. Higher population diversity is got without gene lost at all, by which search ability is enhanced. Incest prevention, selection strategies and mutation are unnecessary and consequently cancelled (so it is named pseudo genetic algorithm). As indicated by the simulation results, the speed of elitist search is accelerated greatly and computation complexity is reduced by half.

• 出版日期2010-2
• 单位重庆大学