The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Constraint Handling in Multiobjective Evolutionary Optimization
Abstract
This paper proposes a constraint handling technique for multiobjective evolutionary algorithms based on an adaptive penalty function and a distance measure. These two functions vary dependent upon the objective function value and the sum of constraint violations of an individual. Through this design, the objective space is modified to account for the performance and constraint violation of each individual. The modified objective functions are used in the nondominance sorting to facilitate the search of optimal solutions not only in the feasible space but also in the infeasible regions. The search in the infeasible space is designed to exploit those individuals with better objective values and lower constraint violations. The number of feasible individuals in the population is used to guide the search process either toward finding more feasible solutions or favor in search for optimal solutions. The proposed method is simple to implement and does not need any parameter tuning. The constraint handling technique is tested on several constrained multiobjective optimization problems and has shown superior results compared to some chosen state-of-the-art designs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,326
Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935
SPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008
Performance assessment of multiobjective optimizers: an analysis and review
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & da Fonseca, V. G. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810758 · Cited by 4,330
GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION
Fonseca, C. M., & Fleming, P. J. (1993) · international conference on Genetic algorithms · Cited by 4,300
An efficient constraint handling method for genetic algorithms
Deb, K. (2000) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(99)00389-8 · Cited by 3,892
Multiobjective Decision Making: Theory and Methodology
Chankong, V., & Haimes, Y. Y. (1983) · Medical Entomology and Zoology · Cited by 2,371
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Knowles, J. D., & Corne, D. W. (2000) · Evolutionary Computation · doi:10.1162/106365600568167 · Cited by 2,286
Stochastic ranking for constrained evolutionary optimization
Runarsson, T. P., & Yao, X. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.873238 · Cited by 1,807
Cited by
Multiobjective evolutionary algorithms: A survey of the state of the art
Zhou, A., Qu, B.-Y., Li, H., Zhao, S.-Z., Suganthan, P. N., & Zhang, Q. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.03.001 · Cited by 2,255
Constraint-handling in nature-inspired numerical optimization: Past, present and future
Mezura-Montes, E., & Coello Coello, C. A. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.10.001 · Cited by 1,127
Two-Archive Evolutionary Algorithm for Constrained Multiobjective Optimization
Li, K., Chen, R., Fu, G., & Yao, X. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2855411 · Cited by 752
A Coevolutionary Framework for Constrained Multiobjective Optimization Problems
Tian, Y., Zhang, T., Xiao, J., Zhang, X., & Jin, Y. (2021) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2020.3004012 · Cited by 735
Push and pull search for solving constrained multi-objective optimization problems
Fan, Z., Li, W., Cai, X., Li, H., Wei, C., Zhang, Q., Deb, K., & Goodman, E. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.08.017 · Cited by 594
Bio-inspired computation: Where we stand and what's next
Del Ser, J., Osaba, E., Molina, D., Yang, X.-S., Salcedo-Sanz, S., Camacho, D., Das, S., Suganthan, P. N., Coello Coello, C. A., & Herrera, F. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.04.008 · Cited by 593
A Multi-Facet Survey on Memetic Computation
Chen, X., Ong, Y.-S., Lim, M.-H., & Tan, K. C. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2132725 · Cited by 512
Liu, Z.-Z., & Wang, Y. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2894743 · Cited by 486
Ma, Z., & Wang, Y. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2896967 · Cited by 458
A Survey on Evolutionary Constrained Multiobjective Optimization
Liang, J., Ban, X., Yu, K., Qu, B., Qiao, K., Yue, C., Chen, K., & Tan, K. C. (2023) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2022.3155533 · Cited by 438
Robot path planning in uncertain environment using multi-objective particle swarm optimization
Zhang, Y., Gong, D.-W., & Zhang, J.-H. (2013) · Neurocomputing · doi:10.1016/j.neucom.2012.09.019 · Cited by 406
Tian, Y., Zhang, Y., Su, Y., Zhang, X., Tan, K. C., & Jin, Y. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3021138 · Cited by 383
Fuzzy-Based Pareto Optimality for Many-Objective Evolutionary Algorithms
He, Z., Yen, G. G., & Zhang, J. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2258025 · Cited by 350
Self-citationKumar, A., Wu, G., Ali, M. Z., Luo, Q., Mallipeddi, R., Suganthan, P. N., & Das, S. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100961 · Cited by 309
Difficulty Adjustable and Scalable Constrained Multiobjective Test Problem Toolkit
Fan, Z., Li, W., Cai, X., Li, H., Wei, C., Zhang, Q., Deb, K., & Goodman, E. (2020) · Evolutionary Computation · doi:10.1162/evco_a_00259 · Cited by 308
The jMetal framework for multi-objective optimization: Design and architecture
Durillo, J. J., Nebro, A. J., & Alba, E. (2010) · IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2010.5586354 · Cited by 283
A Dual-Population-Based Evolutionary Algorithm for Constrained Multiobjective Optimization
Ming, M., Trivedi, A., Wang, R., Srinivasan, D., & Zhang, T. (2021) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2021.3066301 · Cited by 258
Handling Constrained Multiobjective Optimization Problems via Bidirectional Coevolution
Liu, Z.-Z., Wang, B.-C., & Tang, K. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3056176 · Cited by 254
Dynamic Auxiliary Task-Based Evolutionary Multitasking for Constrained Multiobjective Optimization
Qiao, K., Yu, K., Qu, B., Liang, J., Song, H., Yue, C., Lin, H., & Tan, K. C. (2023) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2022.3175065 · Cited by 253
Metadata
- Authors
- Woldesenbet, Y. G., Yen, G. G., & Tessema, B. G.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2009-06
- Volume
- 13
- Issue
- 3
- Pages
- 514-525
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2143585163
- Cited by
- 420
- References
- 33
- FWCI
- 11.91
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.