The evolutionary algorithm to find robust Pareto-optimal solutions over time

DOI10.1155/2015/814210MaRDI QIDQ1666645zbMATH OpenOpenAlexWikidataFDO

Authors Meirong Chen, Yinan Guo, Haiyuan Liu, C. Wang

Publication date 27 August 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2015/814210

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: 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.

Recommendations

• A novel dynamic multi-objective robust evolutionary optimization method
• An evolutionary algorithm for dynamic multi-objective optimization
• New Dynamic Multi-Objective Constrained Optimization Evolutionary Algorithm
• A memory enhanced dynamic multi-objective evolutionary algorithm based on decomposition
• A dynamic multi-objective evolutionary algorithm based on intensity of environmental change

Cites work

• A Memetic Algorithm for Dynamic Multiobjective Optimization
• Evolutionary computation for dynamic optimization problems
• Evolutionary multi-objective optimization in uncertain environments. Issues and algorithms
• Quantum immune clonal coevolutionary algorithm for dynamic multiobjective optimization

Cited in

(5)

• Considering dynamic Pareto frontiers in decision making
• Niching evolution strategy finding global and Pareto optimal solutions
• A novel dynamic multi-objective robust evolutionary optimization method
• scientific article; zbMATH DE number 2222826 (Why is no real title available?)
• On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods

Describes a project that uses

Uses Software

• MOEA/D

This page was built for publication: The evolutionary algorithm to find robust Pareto-optimal solutions over time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1666645)