Documentação de convênios
URI permanente desta comunidadehttps://rigalileo.itegam.org.br/handle/123456789/173
Trabalhos ténico-científico oriundos de convênios com universidades para oferta de turmas de mestrado e doutorados no Estado do Amazonas
Navegar
3 resultados
Resultados da Pesquisa
Item Algoritmo Memético Cultural para Otimização de Problemas de Variáveis Reais(Universidade Federal do Pará, 2019) FREITAS, Carlos Alberto Oliveira de; OLIVEIRA, Roberto Célio Limão de; SILVA, Deam James Azevedo daTechnology has made great strides in recent years, but computing resources for certain applications need optimization so that the costs involved in solving some problems are not high. There is a very broad area of research for the development of efficient algorithms for multimodal optimization problems. This thesis analyzes the behavior of the Cultural Algorithm, with populations evolved by the Genetic Algorithm, when local search heuristics are used: Tabu Search, Beam Search, Climbing, and Simulated Annealing. One of the contributions of this work was the updating of the topographic knowledge of the cultural algorithm by the use of the triangular area defined by the best results found in the local search. For the analysis, a Memetic Algorithm was developed by hybridizing the Cultural Algorithm with the local search heuristics mentioned, applied one at a time. The evaluations were carried out using multimodal benchmark functions and real constrained optimization problems in engineering areas. The results showed that the developed Cultural Memetic Algorithm presented better results compared to those available in the researched scientific literature.Item Uso de Algoritmo Cultural com uma Nova Abordagem Memética por meio do Simulated Annealing para o Problema do Caixeiro Viajante(INSTITUTO DE TECNOLOGIA, 2014) SILVA, Deam J. A.; SILVA, Joaquim A. L.; AFFONSO, Carolina M.; OLIVEIRA, Roberto C. L.; MAGALHÃES, Edilson MarquesThe paper proposes a hybrid algorithm combining Cultural Algorithms (CAs) and Genetic Algorithms (GAs), with local search via simulated annealing and 2-opt/3-opt heuristics, to solve the Traveling Salesman Problem (TSP). The aim is to overcome premature convergence and local optima traps common in traditional metaheuristics. Experiments with 442 and 532-city instances showed that the approach achieved solutions close to the known optimum, outperforming other methods in the literature.Item Estudo da Parametrização do Algoritmo Híbrido Baseado no Algoritmo Cultural com Algoritmo Genético em uma Abordagem Multipopulacional(Universidade Federal do Pará, 2015) SILVA JUNIOR, Joaquim Alberto Leite da; Prof. Dr. Roberto Célio Limão de OliveiraThis paper analyzes the application of a hybrid cultural algorithm with a population generated by the genetic algorithm's multipopulation feature. The main objective is to develop a parameterization of the hybrid algorithm based on the cultural algorithm with a genetic algorithm for the multidimensional knapsack problem. Several experiments were conducted to evaluate the performance of these hybrid mechanisms compared to other algorithms available in the literature