Loading…
A novel multi-objective evolutionary algorithm with fuzzy logic based adaptive selection of operators: FAME
•A new density estimator for multi-objective optimization the first of polynomial complexity capable of deal with three-objective problems.•An adaptive mechanism of evolutionary operators selection for multi-objective optimization based on a fuzzy inference system.•A new metaheuristic for hard multi...
Saved in:
Published in: | Information sciences 2019-01, Vol.471, p.233-251 |
---|---|
Main Authors: | , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | •A new density estimator for multi-objective optimization the first of polynomial complexity capable of deal with three-objective problems.•An adaptive mechanism of evolutionary operators selection for multi-objective optimization based on a fuzzy inference system.•A new metaheuristic for hard multi-objective optimization problems.
We propose a new method for multi-objective optimization, called Fuzzy Adaptive Multi-objective Evolutionary algorithm (FAME). It makes use of a smart operator controller that dynamically chooses the most promising variation operator to apply in the different stages of the search. This choice is guided by a fuzzy logic engine, according to the contributions of the different operators in the past. FAME also includes a novel effective density estimator with polynomial complexity, called Spatial Spread Deviation (SSD). Our proposal follows a steady-state selection scheme and includes an external archive implementing SSD to identify the candidate solutions to be removed when it becomes full. To assess the performance of our proposal, we compare FAME with a number of state of the art algorithms (MOEA/D-DE, SMEA, SMPSOhv, SMS-EMOA, and BORG) on a set of difficult problems. The results show that FAME achieves the best overall performance. |
---|---|
ISSN: | 0020-0255 1872-6291 |
DOI: | 10.1016/j.ins.2018.09.005 |