An improved NSGA-III algorithm based on distance dominance relation for many-objective optimization
Published 2022 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
An improved NSGA-III algorithm based on distance dominance relation for many-objective optimization
Authors
Keywords
-
Journal
EXPERT SYSTEMS WITH APPLICATIONS
Volume 207, Issue -, Pages 117738
Publisher
Elsevier BV
Online
2022-06-10
DOI
10.1016/j.eswa.2022.117738
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Improving NSGA-III algorithms with information feedback models for large-scale many-objective optimization
- (2020) Zi-Min Gu et al. Future Generation Computer Systems-The International Journal of eScience
- Solving Fuzzy Job-Shop Scheduling Problem Using DE Algorithm Improved by a Selection Mechanism
- (2020) Da Gao et al. IEEE TRANSACTIONS ON FUZZY SYSTEMS
- An improved NSGA-III algorithm with adaptive mutation operator for Big Data optimization problems
- (2018) Jiao-Hong Yi et al. Future Generation Computer Systems-The International Journal of eScience
- A New Decomposition-Based NSGA-II for Many-Objective Optimization
- (2018) Maha Elarbi et al. IEEE Transactions on Systems Man Cybernetics-Systems
- A Strengthened Dominance Relation Considering Convergence and Diversity for Evolutionary Many-Objective Optimization
- (2018) Ye Tian et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective Optimization [Educational Forum]
- (2017) Ye Tian et al. IEEE Computational Intelligence Magazine
- A Vector Angle-Based Evolutionary Algorithm for Unconstrained Many-Objective Optimization
- (2017) Yi Xiang et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- A Many-Objective Evolutionary Algorithm Using A One-by-One Selection Strategy
- (2017) Yiping Liu et al. IEEE Transactions on Cybernetics
- High Performance Computing for Cyber Physical Social Systems by Using Evolutionary Multi-Objective Optimization Algorithm
- (2017) Gai-Ge Wang et al. IEEE Transactions on Emerging Topics in Computing
- A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization
- (2016) Ran Cheng et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- A Multiobjective Evolutionary Algorithm Based on Decision Variable Analyses for Multiobjective Optimization Problems With Large-Scale Variables
- (2016) Xiaoliang Ma et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- An Evolutionary Many-Objective Optimization Algorithm Based on Dominance and Decomposition
- (2015) Ke Li et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- A Knee Point-Driven Evolutionary Algorithm for Many-Objective Optimization
- (2015) Xingyi Zhang et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- A Grid-Based Evolutionary Algorithm for Many-Objective Optimization
- (2013) Shengxiang Yang et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints
- (2013) Kalyanmoy Deb et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- Shift-Based Density Estimation for Pareto-Based Algorithms in Many-Objective Optimization
- (2013) Miqing Li et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- Fuzzy-Based Pareto Optimality for Many-Objective Evolutionary Algorithms
- (2013) Zhenan He et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- Diagnostic Assessment of Search Controls and Failure Modes in Many-Objective Evolutionary Optimization
- (2011) David Hadka et al. EVOLUTIONARY COMPUTATION
- Multiobjective evolutionary algorithms: A survey of the state of the art
- (2011) Aimin Zhou et al. Swarm and Evolutionary Computation
- A New Evolutionary Algorithm for Solving Many-Objective Optimization Problems
- (2008) Xiufen Zou et al. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started