USO DE ALGORITMO CULTURAL COM UMA NOVA ABORDAGEM MEMÉTICA POR MEIO DO SIMULATED ANNEALING PARA O PROBLEMA DO CAIXEIRO VIAJANTE
Item
-
Tipo do ITEM
-
Artigo Ciêntifico
-
Título do Artigo
-
USO DE ALGORITMO CULTURAL COM UMA NOVA ABORDAGEM MEMÉTICA POR MEIO DO SIMULATED ANNEALING PARA O PROBLEMA DO CAIXEIRO VIAJANTE
-
Descrição
-
In many optimization problems there are difficulties in achieving a good result or even a result close to the optimum value in a feasible time, especially when working on large scale. These problems are normally addressed by heuristics or metaheuristics which perform searches for better solutions on previously defined search space. There are several meta-heuristics in Natural Computing, among them there are Evolutionary Computation, with the focus on Cultural Algorithms (CA) and Genetic Algorithms (GAs), which are used as a complement due to the dual mechanism of culture and genetic inheritance. The purpose of this paper is to use such mechanisms and incorporate local search heuristics and simulated annealing applied to a combinatorial optimization problem called Travel Salesman Problem (TSP). Some experiments were performed to make an assessment regarding the performance of these hybrid mechanisms with other algorithms available in the literature.
-
Abstract
-
In many optimization problems there are difficulties in achieving a good result or even a result close to the optimum value in a feasible time, especially when working on large scale. These problems are normally addressed by heuristics or metaheuristics which perform searches for better solutions on previously defined search space. There are several meta-heuristics in Natural Computing, among them there are Evolutionary Computation, with the focus on Cultural Algorithms (CA) and Genetic Algorithms (GAs), which are used as a complement due to the dual mechanism of culture and genetic inheritance. The purpose of this paper is to use such mechanisms and incorporate local search heuristics and simulated annealing applied to a combinatorial optimization problem called Travel Salesman Problem (TSP). Some experiments were performed to make an assessment regarding the performance of these hybrid mechanisms with other algorithms available in the literature.
-
Língua do arquivo
-
inglês
-
Data da Publicação
-
Ano Desconhecido
-
Autores
-
DEAM J. A. SILVA
-
JOAQUIM A. L. SILVA
-
CAROLINA M. AFFONSO
-
ROBERTO C. L. OLIVEIRA
-
Local
-
UFPA - 2015
