Handling multi-objective optimization problems with unbalanced constraints and their effects on evolutionary algorithm performance
Authors:
- Chaoda PengCPChaoda Peng
- Hai-Lin LiuHLHai-Lin Liu
- Erik D. GoodmanErik D. Goodman
- 1 June 2020
- journal article
- research article
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 55
Abstract
No abstract availableKeywords
Funding Information
- Guangzhou Municipal Science and Technology Program key projects (201804010352)
- China Scholarship Council
- Natural Science Foundation of Guangdong Province (2020A1515011500)
This publication has 23 references indexed in Scilit:
- 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
- An improved (μ+λ)-constrained differential evolution for constrained optimizationInformation Sciences, 2013
- A study of two penalty-parameterless constraint handling techniques in the framework of MOEA/DApplied Soft Computing, 2013
- BSTBGA: A hybrid genetic algorithm for constrained multi-objective optimization problemsComputers & Operations Research, 2012
- C-PSA: Constrained Pareto simulated annealing for constrained multi-objective optimizationInformation Sciences, 2010
- DEMORS: A hybrid multi-objective optimization algorithm using differential evolution and rough set theory for constrained problemsComputers & Operations Research, 2010
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Stochastic ranking for constrained evolutionary optimizationIEEE Transactions on Evolutionary Computation, 2000
- A new method to solve generalized multicriteria optimization problems using the simple genetic algorithmStructural and Multidisciplinary Optimization, 1995
- Muiltiobjective Optimization Using Nondominated Sorting in Genetic AlgorithmsEvolutionary Computation, 1994