A new PSO-based algorithm for multi-objective optimization with continuous and discrete design variables

This paper presents a new multi-objective optimization algorithm called FC-MOPSO for optimal design of engineering problems with a small number of function evaluations. The proposed algorithm expands the main idea of the single-objective particle swarm optimization (PSO) algorithm to deal with const...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Structural and multidisciplinary optimization Ročník 57; číslo 2; s. 509 - 533
Hlavní autoři: Mokarram, Vahid, Banan, Mohammad Reza
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2018
Springer Nature B.V
Témata:
Algorithms
Computational Mathematics and Numerical Analysis
Continuity (mathematics)
Design engineering
Design optimization
Engineering
Engineering Design
Mopping
Multiple objective analysis
Particle swarm optimization
Research Paper
Theoretical and Applied Mechanics
Structural optimization
Particle swarm optimization
Multi-objective optimization
ISSN:1615-147X, 1615-1488
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents a new multi-objective optimization algorithm called FC-MOPSO for optimal design of engineering problems with a small number of function evaluations. The proposed algorithm expands the main idea of the single-objective particle swarm optimization (PSO) algorithm to deal with constrained and unconstrained multi-objective problems (MOPs). FC-MOPSO employs an effective procedure in selection of the leader for each particle to ensure both diversity and fast convergence. Fifteen benchmark problems with continuous design variables are used to validate the performance of the proposed algorithm. Finally, a modified version of FC-MOPSO is introduced for handling discrete optimization problems. Its performance is demonstrated by optimizing five space truss structures. It is shown that the FC-MOPSO can effectively find acceptable approximations of Pareto fronts for structural MOPs within very limited number of function evaluations.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1615-147X
1615-1488
DOI:10.1007/s00158-017-1764-7