A MOEA/D with adaptive weight subspace for regular and irregular multi-objective optimization problems
Authors:
- Qinghua GuQGQinghua Gu
- Kexin LiKLKexin Li
- Dan WangDWDan Wang
- Di LiuDLDi Liu
- 19 January 2024
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 661
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (52074205)
- Science Fund for Distinguished Young Scholars of Sichuan Province (2020JC-44)
This publication has 42 references indexed in Scilit:
- MOEA/D with Adaptive Weight AdjustmentEvolutionary Computation, 2014
- An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box ConstraintsIEEE Transactions on Evolutionary Computation, 2013
- An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive ApproachIEEE Transactions on Evolutionary Computation, 2013
- A Fast and Effective Method for Pruning of Non-dominated Solutions in Many-Objective Problems2006
- Scalable Test Problems for Evolutionary Multiobjective Optimization2005
- The balance between proximity and diversity in multiobjective evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 2003
- Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop schedulingIEEE Transactions on Evolutionary Computation, 2003
- On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experimentIEEE Transactions on Evolutionary Computation, 2002
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization ProblemsSIAM Journal on Optimization, 1998