Evolutionary programming

Evolutionary programming is an evolutionary algorithm, where a share of new population is created by mutation of previous population without crossover.[1][2] Evolutionary programming differs from evolution strategy ES() in one detail.[1] All individuals are selected for the new population, while in ES(), every individual has the same probability to be selected. It is one of the four major evolutionary algorithm paradigms.[3]

  1. ^ a b Slowik, Adam; Kwasnicka, Halina (1 August 2020). "Evolutionary algorithms and their applications to engineering problems". Neural Computing and Applications. 32 (16): 12363–12379. doi:10.1007/s00521-020-04832-8. ISSN 1433-3058.
  2. ^ Abido, Mohammad A.; Elazouni, Ashraf (30 November 2021). "Modified multi-objective evolutionary programming algorithm for solving project scheduling problems". Expert Systems with Applications. 183: 115338. doi:10.1016/j.eswa.2021.115338. ISSN 0957-4174.
  3. ^ Brameier, Markus (2004). "On Linear Genetic Programming". Dissertation. Retrieved 27 December 2024.

© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search