Multi-dimensional tree guided efficient global association for decomposition-based evolutionary many-objective optimization

DOI10.1016/j.ins.2020.03.093zbMath1459.90196OpenAlexW3016592657MaRDI QIDQ2023160

Yanyan Li

Publication date: 3 May 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2020.03.093

zbMATH Keywords

decompositionevolutionary algorithmsmany-objective optimizationglobal associationmulti-dimensional tree

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• NBI
• MOEA/D
• jMetal
• SMS-EMOA

Cites Work

• Unnamed Item
• Unnamed Item
• Pareto adaptive penalty-based boundary intersection method for multi-objective optimization
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• Time bounds for selection
• A Pareto-based many-objective evolutionary algorithm using space partitioning selection and angle-based truncation
• A decomposition based evolutionary algorithm with direction vector adaption and selection enhancement
• Multi-objective evolutionary algorithm with prediction in the objective space
• A new resource allocation strategy based on the relationship between subproblems for MOEA/D
• Approximate non-dominated sorting for evolutionary many-objective optimization
• Multidimensional binary search trees used for associative searching
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• Theory of the hypervolume indicator

This page was built for publication: Multi-dimensional tree guided efficient global association for decomposition-based evolutionary many-objective optimization