2018-05-102018-05-102008CAMILO JÚNIOR, Celso G.; YAMANAKA, Keiji. Algoritmo auxiliar paralelo para melhorar a performance dos algoritmos genéticos com codificação binária. Learning and Nonlinear Models, Curitiba, v. 6, n. 2, p. 121-141, 2008.e- 1676-2789http://repositorio.bc.ufg.br/handle/ri/14876Some techniques are applied in the optimization problems, however, just a few achieve satisfactory performance when the problem is complex, for example, multimodal or multiobjective. The metaheuristics, although not guaranteeing a global optimum, have good results and, hence, are quite used to these scenarios. Among the metaheuristics, the evolutionary algorithms, especially the Genetic Algorithms (GA), have great results and, hence, one of the most popular. However, the process of improving the solution of an AG may be slow, especially in cases of great complexity. Hence, some papers are developed to improve the performance of the AG. However, when it speeds up the process of evolution in evolutionary algorithms, normally increases the risk of premature convergence, which can negatively influence the population to maximum and minimum locations. Therefore, this work suggests the Assistant Parallel Algorithm (AAP), an algorithm to assist the evolution process of binary encoding GAs. The proposed algorithm is a module attached to the AGs that feeds the population of good individuals. Four operators were created for the AAP: AR, EAR-T, EAR-P and EAR-N, all functionally independent. Experiments were done to measure the efficiency of the AAP and its operators. The results show that the AAP reach the objective of assist the good evolution without using specifics knowledges about the problem.porAcesso AbertoAlgoritmos genéticosConvergência prematuraVelocidade de convergênciaComputação evolucionáriaMetaheurísticaGenetic algorithmsPremature convergenceConvergence speedEvolutionary computationMetaheuristicsArtigo