Approximating the Set of Pareto-Optimal Solutions in Both the Decision and Objective Spaces by an Estimation of Distribution Algorithm

By Aimin Zhou, Qingfu Zhang, Yaochu Jin. IEEE Transactions on Evolutionary Computation, 2009

331 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints (2014, background): “A few such implementations were proposed recently [14], [36]–[38], and this paper suggests another approach extending the algorithm proposed in the first reference [36].”
A Multiobjective Particle Swarm Optimizer Using Ring Topology for Solving Multimodal Multiobjective Problems (2018, background): “CR and IGDX are combined as PSP according to (8).”
Improved Regularity Model-Based EDA for Many-Objective Optimization (2018, methodology): “[32] proposed a regularity-based method for solving the MOPs requiring the objective spaces to be (m−1) dimensions.”