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)

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)

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

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)