Gouvêa, Elizabeth FerreiraSouza, Givanaldo Rocha de2014-12-172014-12-122014-12-172006-05-19SOUZA, 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.https://repositorio.ufrn.br/jspui/handle/123456789/17970Combinatorial 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 approachesapplication/pdfAcesso AbertoOtimização combinatóriaCaixeiro viajanteNuvem de partículasÁrvore geradora mínima - Restrita em grau multiobjetivoCombinatorial optimizationTraveling salesmanParticle swarmMinimum spanning treeMulticriteria degree constrainedmasterThesisCNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO