Evolutionary Multi-Objective Optimization Algorithm Framework with Three Solution Sets

by   Hisao Ishibuchi, et al.

It is assumed in the evolutionary multi-objective optimization (EMO) community that a final solution is selected by a decision maker from a non-dominated solution set obtained by an EMO algorithm. The number of solutions to be presented to the decision maker can be totally different. In some cases, the decision maker may want to examine only a few representative solutions from which a final solution is selected. In other cases, a large number of non-dominated solutions may be needed to visualize the Pareto front. In this paper, we suggest the use of a general EMO framework with three solution sets to handle various situations with respect to the required number of solutions. The three solution sets are the main population of an EMO algorithm, an external archive to store promising solutions, and a final solution set which is presented to the decision maker. The final solution set is selected from the archive. Thus the population size and the archive size can be arbitrarily specified as long as the archive size is not smaller than the required number of solutions. The final population is not necessarily to be a good solution set since it is not presented to the decision maker. Through computational experiments, we show the advantages of this framework over the standard final population and final archive frameworks. We also discuss how to select a final solution set and how to explain the reason for the selection, which is the first attempt towards an explainable EMO framework.


Decomposition-Based Multi-Objective Evolutionary Algorithm Design under Two Algorithm Frameworks

The development of efficient and effective evolutionary multi-objective ...

Solution Subset Selection for Final Decision Making in Evolutionary Multi-Objective Optimization

In general, a multi-objective optimization problem does not have a singl...

Effects of Archive Size on Computation Time and Solution Quality for Multi-Objective Optimization

An unbounded external archive has been used to store all nondominated so...

Algorithm Configurations of MOEA/D with an Unbounded External Archive

In the evolutionary multi-objective optimization (EMO) community, it is ...

Benchmarking Subset Selection from Large Candidate Solution Sets in Evolutionary Multi-objective Optimization

In the evolutionary multi-objective optimization (EMO) field, the standa...

Pareto Efficient Multi Objective Optimization for Local Tuning of Analogy Based Estimation

Analogy Based Effort Estimation (ABE) is one of the prominent methods fo...

Faster Convergence in Multi-Objective Optimization Algorithms Based on Decomposition

The Resource Allocation approach (RA) improves the performance of MOEA/D...

Please sign up or login with your details

Forgot password? Click here to reset