$$\newcommand{\bra}[1]{\left<#1\right|}\newcommand{\ket}[1]{\left|#1\right>}\newcommand{\bk}[2]{\left<#1\middle|#2\right>}\newcommand{\bke}[3]{\left<#1\middle|#2\middle|#3\right>}$$
INFORMAÇÕES SOBRE DIREITOS AUTORAIS


As obras disponibilizadas nesta Biblioteca Digital foram publicadas sob expressa autorização dos respectivos autores, em conformidade com a Lei 9610/98.

A consulta aos textos, permitida por seus respectivos autores, é livre, bem como a impressão de trechos ou de um exemplar completo exclusivamente para uso próprio. Não são permitidas a impressão e a reprodução de obras completas com qualquer outra finalidade que não o uso próprio de quem imprime.

A reprodução de pequenos trechos, na forma de citações em trabalhos de terceiros que não o próprio autor do texto consultado,é permitida, na medida justificada para a compreeensão da citação e mediante a informação, junto à citação, do nome do autor do texto original, bem como da fonte da pesquisa.

A violação de direitos autorais é passível de sanções civis e penais.
Coleção Digital

Avançada


Estatísticas | Formato DC|



Título: PSO+: A LINEAR AND NONLINEAR CONSTRAINTS-HANDLING PARTICLE SWARM OPTIMIZATION
Instituição: PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO - PUC-RIO
Autor(es): MANOELA RABELLO KOHLER

Colaborador(es):  RICARDO TANSCHEIT - Orientador
MARLEY MARIA BERNARDES REBUZZI VELLASCO - Coorientador
Número do Conteúdo: 43545
Catalogação:  15/08/2019 Idioma(s):  PORTUGUESE - BRAZIL

Tipo:  TEXT Subtipo:  THESIS
Natureza:  SCHOLARLY PUBLICATION
Nota:  Todos os dados constantes dos documentos são de inteira responsabilidade de seus autores. Os dados utilizados nas descrições dos documentos estão em conformidade com os sistemas da administração da PUC-Rio.
Referência [pt]:  https://www.maxwell.vrac.puc-rio.br/colecao.php?strSecao=resultado&nrSeq=43545@1
Referência [en]:  https://www.maxwell.vrac.puc-rio.br/colecao.php?strSecao=resultado&nrSeq=43545@2
Referência DOI:  https://doi.org/10.17771/PUCRio.acad.43545

Resumo:
The Particle Swarm Optimization (PSO) algorithm is a metaheuristic based on populations of individuals in which solution candidates evolve through simulation of a simplified model of social adaptation. By aggregating robustness, efficiency and simplicity, PSO has gained great popularity. Many successful applications of PSO are reported in which this algorithm has demonstrated advantages over other well-established metaheuristics based on populations of individuals. Modified PSO algorithms have been proposed to solve optimization problems with domain, linear and nonlinear constraints; The great majority of these algorithms make use of penalty methods, which have, in general, numerous limitations, such as: (i) additional care in defining the appropriate penalty for each problem, since a balance must be maintained between obtaining valid solutions and the searching for an optimal solution; (ii) they assume all solutions must be evaluated. Other algorithms that use multi-objective optimization to deal with constrained problems face the problem of not being able to guarantee finding feasible solutions. The proposed PSO algorithms up to this date that deal with constraints, in order to guarantee valid solutions using feasibility operators and not requiring the evaluation of infeasible solutions, only treat domain constraints by controlling the velocity of particle displacement in the swarm, or do so inefficiently by randomly resetting each infeasible particle, which may make it infeasible to optimize certain problems. This work presents a new particle swarm optimization algorithm, called PSO+, capable of solving problems with linear and nonlinear constraints in order to solve these deficiencies. The modeling of the algorithm has added six different capabilities to solve constrained optimization problems: (i) arithmetic redirection to ensure particle feasibility; (ii) two particle swarms, where each swarm has a specific role in the optimization the problem; (iii) a new particle updating method to insert diversity into the swarm and improve the coverage of the search space, allowing its edges to be properly exploited – which is especially convenient when the problem to be optimized involves active constraints at the optimum solution; (iv) two heuristics to initialize the swarm in order to accelerate and facilitate the initialization of the feasible initial population and guarantee diversity at the starting point of the optimization process; (v) neighborhood topology, called coordinated random clusters neighborhood to minimize optimization premature convergence problem; (vi) transformation of equality constraints into inequality constraints. The algorithm was tested for twenty-four benchmark functions – created and proposed for an optimization competition – as well as in a real optimization problem of well allocation in an oil reservoir. The experimental results show that the new algorithm is competitive, since it increases the efficiency of the PSO and the speed of convergence.

Descrição Arquivo
COMPLETE  PDF
Agora você pode usar seu login do SAU no Maxwell!!
Fechar Janela



* Esqueceu a senha:
Senha SAU, clique aqui
Senha Maxwell, clique aqui