Decomposition Multi-Objective Evolutionary Optimization: From State-of-the-Art to Future Opportunities

• URL: http://arxiv.org/abs/2108.09588v1
• Date: Sat, 21 Aug 2021 22:21:44 GMT
• Title: Decomposition Multi-Objective Evolutionary Optimization: From State-of-the-Art to Future Opportunities
• Authors: Ke Li
• Abstract summary: We present a survey of the development of MOEA/D from its origin to the current state-of-the-art approaches. selected major developments of MOEA/D are reviewed according to its core design components. We shed some lights on emerging directions for future developments.
• Score: 5.760976250387322
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Decomposition has been the mainstream approach in the classic mathematical programming for multi-objective optimization and multi-criterion decision-making. However, it was not properly studied in the context of evolutionary multi-objective optimization until the development of multi-objective evolutionary algorithm based on decomposition (MOEA/D). In this article, we present a comprehensive survey of the development of MOEA/D from its origin to the current state-of-the-art approaches. In order to be self-contained, we start with a step-by-step tutorial that aims to help a novice quickly get onto the working mechanism of MOEA/D. Then, selected major developments of MOEA/D are reviewed according to its core design components including weight vector settings, sub-problem formulations, selection mechanisms and reproduction operators. Besides, we also overviews some further developments for constraint handling, computationally expensive objective functions, preference incorporation, and real-world applications. In the final part, we shed some lights on emerging directions for future developments.

Related papers

• An Inverse Modeling Constrained Multi-Objective Evolutionary Algorithm Based on Decomposition [0.0]
  This paper introduces the inverse modeling constrained multi-objective evolutionary algorithm based on decomposition (IM-C-MOEA/D) The proposed approach is experimentally evaluated on diverse real-world problems (RWMOP1-35), showing superior performance to state-of-the-art constrained multi-objective evolutionary algorithms (CMOEAs)
  arXiv  Detail & Related papers  (2024-10-24T23:24:44Z)
• Coding for Intelligence from the Perspective of Category [66.14012258680992]
  Coding targets compressing and reconstructing data, and intelligence. Recent trends demonstrate the potential homogeneity of these two fields. We propose a novel problem of Coding for Intelligence from the category theory view.
  arXiv  Detail & Related papers  (2024-07-01T07:05:44Z)
• A Survey of Decomposition-Based Evolutionary Multi-Objective Optimization: Part I-Past and Future [5.074835777266041]
  decomposition was not properly studied in the context of evolutionary multi-objective optimization. MoEA/D is the representative of decomposition-based EMO to review the up-to-date development in this area. In the first part, we present a comprehensive survey of the development of MOEA/D from its origin to the current state-of-the-art approaches. In the final part, we shed some light on emerging directions for future developments.
  arXiv  Detail & Related papers  (2024-04-22T20:34:46Z)
• Generative AI Agent for Next-Generation MIMO Design: Fundamentals, Challenges, and Vision [76.4345564864002]
  Next-generation multiple input multiple output (MIMO) is expected to be intelligent and scalable. We propose the concept of the generative AI agent, which is capable of generating tailored and specialized contents. We present two compelling case studies that demonstrate the effectiveness of leveraging the generative AI agent for performance analysis.
  arXiv  Detail & Related papers  (2024-04-13T02:39:36Z)
• EmoDM: A Diffusion Model for Evolutionary Multi-objective Optimization [22.374325061635112]
  This work proposes for the first time a diffusion model that can learn to perform evolutionary multi-objective search, called EmoDM. EmoDM can generate a set of non-dominated solutions for a new MOP by means of its reverse diffusion without further evolutionary search. Experimental results demonstrate the competitiveness of EmoDM in terms of both the search performance and computational efficiency.
  arXiv  Detail & Related papers  (2024-01-29T07:41:44Z)
• Pre-Evolved Model for Complex Multi-objective Optimization Problems [3.784829029016233]
  Multi-objective optimization problems (MOPs) necessitate the simultaneous optimization of multiple objectives. This paper proposes the concept of pre-evolving for MOEAs to generate high-quality populations for diverse complex MOPs.
  arXiv  Detail & Related papers  (2023-12-11T05:16:58Z)
• Let's reward step by step: Step-Level reward model as the Navigators for Reasoning [64.27898739929734]
  Process-Supervised Reward Model (PRM) furnishes LLMs with step-by-step feedback during the training phase. We propose a greedy search algorithm that employs the step-level feedback from PRM to optimize the reasoning pathways explored by LLMs. To explore the versatility of our approach, we develop a novel method to automatically generate step-level reward dataset for coding tasks and observed similar improved performance in the code generation tasks.
  arXiv  Detail & Related papers  (2023-10-16T05:21:50Z)
• A Survey of Contextual Optimization Methods for Decision Making under Uncertainty [47.73071218563257]
  This review article identifies three main frameworks for learning policies from data and discusses their strengths and limitations. We present the existing models and methods under a uniform notation and terminology and classify them according to the three main frameworks.
  arXiv  Detail & Related papers  (2023-06-17T15:21:02Z)
• Multi-Objective Policy Gradients with Topological Constraints [108.10241442630289]
  We present a new algorithm for a policy gradient in TMDPs by a simple extension of the proximal policy optimization (PPO) algorithm. We demonstrate this on a real-world multiple-objective navigation problem with an arbitrary ordering of objectives both in simulation and on a real robot.
  arXiv  Detail & Related papers  (2022-09-15T07:22:58Z)
• A Survey on Learnable Evolutionary Algorithms for Scalable Multiobjective Optimization [0.0]
  Multiobjective evolutionary algorithms (MOEAs) have been adopted to solve various multiobjective optimization problems (MOPs) However, these progressively improved MOEAs have not necessarily been equipped with sophisticatedly scalable and learnable problem-solving strategies. Under different scenarios, it requires divergent thinking to design new powerful MOEAs for solving them effectively. Research into learnable MOEAs that arm themselves with machine learning techniques for scaling-up MOPs has received extensive attention in the field of evolutionary computation.
  arXiv  Detail & Related papers  (2022-06-23T08:16:01Z)
• Optimization-Inspired Learning with Architecture Augmentations and Control Mechanisms for Low-Level Vision [74.9260745577362]
  This paper proposes a unified optimization-inspired learning framework to aggregate Generative, Discriminative, and Corrective (GDC) principles. We construct three propagative modules to effectively solve the optimization models with flexible combinations. Experiments across varied low-level vision tasks validate the efficacy and adaptability of GDC.
  arXiv  Detail & Related papers  (2020-12-10T03:24:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.