Algoritmo memético com infecção viral: uma aplicação ao problema do caixeiro viajante assimétrico

• Ano de defesa: 2006
• Autor(a) principal: Fontes, Fábio Francisco da Costa
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal do Rio Grande do Norte; BR; UFRN; Programa de Pós-Graduação em Engenharia de Produção; Estratégia; Qualidade; Gestão Ambiental; Gestão da Produção e Operações
• Palavras-chave em Português: Otimização combinatória; Problema do caixeiro viajante assimétrico; Algoritmo memético; Infecção viral; Combinatorial optimization; Assimetric travelling salesman problem; Memetic algorithms; Viral infection.; CNPQ::ENGENHARIAS::ENGENHARIA DE PRODUCAO
• Link de acesso: https://repositorio.ufrn.br/jspui/handle/123456789/15107

The Combinatorial Optimization is a basic area to companies who look for competitive advantages in the diverse productive sectors and the Assimetric Travelling Salesman Problem, which one classifies as one of the most important problems of this area, for being a problem of the NP-hard class and for possessing diverse practical applications, has increased interest of researchers in the development of metaheuristics each more efficient to assist in its resolution, as it is the case of Memetic Algorithms, which is a evolutionary algorithms that it is used of the genetic operation in combination with a local search procedure. This work explores the technique of Viral Infection in one Memetic Algorithms where the infection substitutes the mutation operator for obtaining a fast evolution or extinguishing of species (KANOH et al, 1996) providing a form of acceleration and improvement of the solution . For this it developed four variants of Viral Infection applied in the Memetic Algorithms for resolution of the Assimetric Travelling Salesman Problem where the agent and the virus pass for a symbiosis process which favored the attainment of a hybrid evolutionary algorithms and computational viable