Journal
EVOLUTIONARY COMPUTATION
Volume 22, Issue 4, Pages 651-678Publisher
MIT PRESS
DOI: 10.1162/EVCO_a_00128
Keywords
Pareto front estimation; evolutionary algorithms; RBFNN; multi-objective optimization; nonlinear estimation
Funding
- Marie Curie International Research Staff Exchange Scheme Fellowship within European Community
- EPSRC [EP/L025760/1] Funding Source: UKRI
- Engineering and Physical Sciences Research Council [EP/L025760/1] Funding Source: researchfish
Ask authors/readers for more resources
The set of available multi-objective optimisation algorithms continues to grow. This fact can be partially attributed to their widespread use and applicability. However, this increase also suggests several issues remain to be addressed satisfactorily. One such issue is the diversity and the number of solutions available to the decision maker (DM). Even for algorithms very well suited for a particular problem, it is difficult-mainly due to the computational cost-to use a population large enough to ensure the likelihood of obtaining a solution close to the DM's preferences. In this paper we present a novel methodology that produces additional Pareto optimal solutions from a Pareto optimal set obtained at the end run of any multi-objective optimisation algorithm for two-objective and three-objective problem instances.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available