Entropy based evolutionary algorithm with adaptive reference points for many-objective optimization problems

DOI10.1016/J.INS.2018.07.012zbMATH Open1441.90154OpenAlexW2882392939WikidataQ129545826 ScholiaQ129545826MaRDI QIDQ2200540FDOQ2200540

Ke Ma, Chong Zhou, Guangming Dai, Cuijun Zhang, Xiangping Li

Publication date: 22 September 2020

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

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

zbMATH Keywords

entropyevolutionary algorithmadaptive reference pointsirregular Pareto frontmany-objective optimization problemregular Pareto front

Mathematics Subject Classification ID

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

Cites Work

• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• Multi-objective optimization using evolutionary algorithms
• Preference-inspired co-evolutionary algorithms using weight vectors

Cited In (4)

• A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem
• An adaptation reference-point-based multiobjective evolutionary algorithm
• AREA: an adaptive reference-set based evolutionary algorithm for multiobjective optimisation
• An ideal point based many-objective optimization for community detection of complex networks

Uses Software

• NBI
• MOEA/D
• RM-MEDA
• MSOPS-II
• PlatEMO

This page was built for publication: Entropy based evolutionary algorithm with adaptive reference points for many-objective optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200540)