dc.contributorGouvêa, Elizabeth Ferreira
dc.contributor
dc.contributorhttp://lattes.cnpq.br/7293405724205132
dc.contributor
dc.contributorhttp://lattes.cnpq.br/2888641121265608
dc.contributorGoldbarg, Marco César
dc.contributor
dc.contributorhttp://lattes.cnpq.br/1371199678541174
dc.creatorSouza, Givanaldo Rocha de
dc.date.accessioned2014-12-12
dc.date.accessioned2014-12-17T15:47:45Z
dc.date.accessioned2022-10-05T23:01:11Z
dc.date.available2014-12-12
dc.date.available2014-12-17T15:47:45Z
dc.date.available2022-10-05T23:01:11Z
dc.date.created2014-12-12
dc.date.created2014-12-17T15:47:45Z
dc.date.issued2006-05-19
dc.identifierSOUZA, Givanaldo Rocha de. A Particle Swarm Approach for Combinatorial Optimization Problems. 2006. 93 f. Dissertação (Mestrado em Ciência da Computação) - Universidade Federal do Rio Grande do Norte, Natal, 2006.
dc.identifierhttps://repositorio.ufrn.br/jspui/handle/123456789/17970
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3944611
dc.description.abstractCombinatorial optimization problems have the goal of maximize or minimize functions defined over a finite domain. Metaheuristics are methods designed to find good solutions in this finite domain, sometimes the optimum solution, using a subordinated heuristic, which is modeled for each particular problem. This work presents algorithms based on particle swarm optimization (metaheuristic) applied to combinatorial optimization problems: the Traveling Salesman Problem and the Multicriteria Degree Constrained Minimum Spanning Tree Problem. The first problem optimizes only one objective, while the other problem deals with many objectives. In order to evaluate the performance of the algorithms proposed, they are compared, in terms of the quality of the solutions found, to other approaches
dc.publisherUniversidade Federal do Rio Grande do Norte
dc.publisherBR
dc.publisherUFRN
dc.publisherPrograma de Pós-Graduação em Sistemas e Computação
dc.publisherCiência da Computação
dc.rightsAcesso Aberto
dc.subjectOtimização combinatória
dc.subjectCaixeiro viajante
dc.subjectNuvem de partículas
dc.subjectÁrvore geradora mínima - Restrita em grau multiobjetivo
dc.subjectCombinatorial optimization
dc.subjectTraveling salesman
dc.subjectParticle swarm
dc.subjectMinimum spanning tree
dc.subjectMulticriteria degree constrained
dc.titleUma abordagem por nuvem de partículas para problemas de otimização combinatória
dc.typemasterThesis


Este ítem pertenece a la siguiente institución