Improvement of reference points for decomposition based multi-objective evolutionary algorithms

A multi-objective optimization problem (MOP) involves simultaneous minimization or maximization of more than one conflicting objectives. Such problems are commonly encountered in a number of domains, such as engineering, finance, operations research, etc. In the recent years, algorithms based on decomposition have shown commendable success in solving MOPs. In particular they have been helpful in overcoming the limitation of Pareto-dominance based ranking when the number of objectives is large. Decomposition based evolutionary algorithms divide an MOP into a number of simpler sub-problems and solve them simultaneously in a cooperative manner. In order to define the sub-problems, a reference point is needed to construct reference vectors in the objective space to guide the corresponding sub-populations. However, the effect of the choice of this reference point has been scarcely studied in literature. Most of the existing works simply construct the reference point using the minimum objective values in the current nondominated population. Some of the recent studies have gone beyond and suggested the use of optimistic, pessimistic or dynamic reference point specification. In this study, we first qualitatively examine the implications of using different strategies to construct the reference points. Thereafter, we suggest an alternative method which relies on identifying promising reference points rather than specifying them. In the proposed approach, each objective is individually minimized in order to estimate a point close to the true ideal point to identify such reference points. Some initial results and analysis are presented to demonstrate the potential benefits and limitations of the approach. Overall, the approach demonstrates promising results but needs further development for achieving more significant improvements in solving MOPs.