Genetic algorithms - variable size populations of chromosomes. An adaptive approach
R Maniu · Scientific Bulletin of Naval Academy · 2018
The size of the chromosome population is an essential parameter of genetic algorithms. A large population involves a large amount of calculations but provides a complete scroll of the search space and the increased probability of generating a global optimum. A small population size, through the small number of operations required, causes a quick run of the algorithm, with increasing the probability of detecting a local optimum to the detriment of the global one. This paper proposes the use of an adaptive, variable size of chromosome population. We will demonstrate that this approach leads to an acceleration of the algorithm operation, without having a negative impact on the quality of provided solutions.