An improved multi-objective population-based extremal optimization algorithm with polynomial mutation

As a recently developed evolutionary algorithm inspired by far-from-equilibrium dynamics of self-organized criticality, extremal optimization (EO) has been successfully applied to a variety of benchmark and engineering optimization problems. However, there are only few reported research works concer...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information sciences Ročník 330; s. 49 - 73
Hlavní autoři: Zeng, Guo-Qiang, Chen, Jie, Li, Li-Min, Chen, Min-Rong, Wu, Lie, Dai, Yu-Xing, Zheng, Chong-Wei
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.02.2016
Témata:
Algorithms
Benchmarking
Convergence
Evolutionary algorithms
Extremal optimization
Mopping
Multi-objective evolutionary algorithms
Multi-objective optimization
Mutation operators
Mutations
Optimization
Polynomials
Spea
Mutation operators
Multi-objective optimization
Multi-objective evolutionary algorithms
Extremal optimization
ISSN:0020-0255, 1872-6291
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í:As a recently developed evolutionary algorithm inspired by far-from-equilibrium dynamics of self-organized criticality, extremal optimization (EO) has been successfully applied to a variety of benchmark and engineering optimization problems. However, there are only few reported research works concerning the applications of EO in the field of multi-objective optimization. This paper presents an improved multi-objective population-based EO algorithm with polynomial mutation called IMOPEO-PLM to solve multi-objective optimization problems (MOPs). Unlike the previous multi-objective versions based on EO, the proposed IMOPEO-PLM adopts population-based iterated optimization, a more effective mutation operation called polynomial mutation, and a novel and more effective mechanism of generating new population. From the design perspective of multi-objective evolutionary algorithms (MOEAs), IMOPEO-PLM is relatively simpler than other reported competitive MOEAs due to its fewer adjustable parameters and only mutation operation. Furthermore, the extensive experimental results on some benchmark MOPs show that IMOPEO-PLM performs better than or at least competitive with these reported popular MOEAs, such as MOPEO, MOEO, NSGA-II, A-MOCLPSO, PAES, SPEA, SPEA2, SMS-EMOA, SMPSO, and MOEA/D-DE, by using nonparametric statistical tests, e.g., Kruskal–Wallis test, Mann–Whitney U test, Friedman and Quade tests, in terms of some commonly-used quantitative performance metrics, e.g., convergence, diversity (spread), hypervolume, generational distance, inverted generational distance.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2015.10.010