Population sizing of cellular evolutionary algorithms
| Autor: | Juan Luis Jiménez Laredo, Juan J. Merelo, Nuno Fachada, Carlos M. Fernandes, Agostinho Rosa |
|---|---|
| Přispěvatelé: | Université de Lisbonne, Equipe Réseaux d'interactions et Intelligence Collective (RI2C - LITIS), Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes (LITIS), Institut national des sciences appliquées Rouen Normandie (INSA Rouen Normandie), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Université de Rouen Normandie (UNIROUEN), Normandie Université (NU)-Université Le Havre Normandie (ULH), Normandie Université (NU)-Institut national des sciences appliquées Rouen Normandie (INSA Rouen Normandie), Normandie Université (NU), Lusófona University [Lisbon], Universidad de Granada (UGR) |
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Random graph
education.field_of_study General Computer Science Computer science General Mathematics Population size Cumulative distribution function 05 social sciences Crossover Population Evolutionary algorithm 050301 education 02 engineering and technology Evolutionary computation [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI] Statistics 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing education 0503 education ComputingMilieux_MISCELLANEOUS Statistical hypothesis testing |
| Zdroj: | Swarm and Evolutionary Computation Swarm and Evolutionary Computation, Elsevier, 2020, 58, pp.100721. ⟨10.1016/j.swevo.2020.100721⟩ |
| ISSN: | 2210-6502 |
| Popis: | Cellular evolutionary algorithms (cEAs) are a particular type of EAs in which a communication structure is imposed to the population and mating restricted to topographically nearby individuals. In general, these algorithms have longer takeover times than panmictic EAs and previous investigations argue that they are more efficient in escaping local optima of multimodal and deceptive functions. However, most of those studies are not primarily concerned with population size, despite being one of the design decisions with a greater impact in the accuracy and convergence speed of population-based metaheuristics. In this paper, optimal population size for cEAs structured by regular and random graphs with different degree is estimated. Selecto-recombinative cEAs and standard cEAs with mutation and different types of crossover were tested on a class of functions with tunable degrees of difficulty. Results and statistical tests demonstrate the importance of setting an appropriate population size. Event Takeover Values (ETV) were also studied and previous assumptions on their distribution were not confirmed: although ETV distributions of panmictic EAs are heavy-tailed, log-log plots of complementary cumulative distribution functions display no linearity. Furthermore, statistical tests on ETVs generated by several instances of the problems conclude that power law models cannot be favored over log-normal. On the other hand, results confirm that cEAs impose deviations to distribution tails and that large ETVs are less probable when the population is structured by graphs with low connectivity degree. Finally, results suggest that for panmictic EAs the ETVs’ upper bounds are approximately equal to the optimal population size. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect