dc.contributor | Gouvêa, Elizabeth Ferreira | |
dc.contributor | | |
dc.contributor | http://lattes.cnpq.br/7293405724205132 | |
dc.contributor | | |
dc.contributor | http://lattes.cnpq.br/2888641121265608 | |
dc.contributor | Goldbarg, Marco César | |
dc.contributor | | |
dc.contributor | http://lattes.cnpq.br/1371199678541174 | |
dc.creator | Souza, Givanaldo Rocha de | |
dc.date.accessioned | 2014-12-12 | |
dc.date.accessioned | 2014-12-17T15:47:45Z | |
dc.date.accessioned | 2022-10-05T23:01:11Z | |
dc.date.available | 2014-12-12 | |
dc.date.available | 2014-12-17T15:47:45Z | |
dc.date.available | 2022-10-05T23:01:11Z | |
dc.date.created | 2014-12-12 | |
dc.date.created | 2014-12-17T15:47:45Z | |
dc.date.issued | 2006-05-19 | |
dc.identifier | SOUZA, 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.identifier | https://repositorio.ufrn.br/jspui/handle/123456789/17970 | |
dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/3944611 | |
dc.description.abstract | Combinatorial 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.publisher | Universidade Federal do Rio Grande do Norte | |
dc.publisher | BR | |
dc.publisher | UFRN | |
dc.publisher | Programa de Pós-Graduação em Sistemas e Computação | |
dc.publisher | Ciência da Computação | |
dc.rights | Acesso Aberto | |
dc.subject | Otimização combinatória | |
dc.subject | Caixeiro viajante | |
dc.subject | Nuvem de partículas | |
dc.subject | Árvore geradora mínima - Restrita em grau multiobjetivo | |
dc.subject | Combinatorial optimization | |
dc.subject | Traveling salesman | |
dc.subject | Particle swarm | |
dc.subject | Minimum spanning tree | |
dc.subject | Multicriteria degree constrained | |
dc.title | Uma abordagem por nuvem de partículas para problemas de otimização combinatória | |
dc.type | masterThesis | |