A Particle Swarm Approach for Combinatorial Optimization Problems / Uma abordagem por nuvem de partículas para problemas de otimização combinatória

AUTOR(ES)
DATA DE PUBLICAÇÃO

2006

RESUMO

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

ASSUNTO(S)

Árvore geradora mínima - restrita em grau multiobjetivo sistemas de computacao particle swarm otimização combinatória minimum spanning tree nuvem de partículas caixeiro viajante traveling salesman combinatorial optimization multicriteria degree constrained

Documentos Relacionados