The Evolutionary Algorithm to Find Robust Pareto-Optimal Solutions over Time

Abstract EN

In dynamic multiobjective optimization problems, the environmental parameters change over time, which makes the true pareto fronts shifted.

So far, most works of research on dynamic multiobjective optimization methods have concentrated on detecting the changed environment and triggering the population based optimization methods so as to track the moving pareto fronts over time.

Yet, in many real-world applications, it is not necessary to find the optimal nondominant solutions in each dynamic environment.

To solve this weakness, a novel method called robust pareto-optimal solution over time is proposed.

It is in fact to replace the optimal pareto front at each time-varying moment with the series of robust pareto-optimal solutions.

This means that each robust solution can fit for more than one time-varying moment.

Two metrics, including the average survival time and average robust generational distance, are present to measure the robustness of the robust pareto solution set.

Another contribution is to construct the algorithm framework searching for robust pareto-optimal solutions over time based on the survival time.

Experimental results indicate that this definition is a more practical and time-saving method of addressing dynamic multiobjective optimization problems changing over time.