The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Multiobjective optimization using a Pareto differential evolution approach
Abstract
Differential evolution is a simple, fast, and robust evolutionary algorithm that has proven effective in determining the global optimum for several difficult single-objective optimization problems. In this paper, the differential evolution algorithm is extended to multiobjective optimization problems by using a Pareto-based approach. The algorithm performs well when applied to several test optimization problems from the literature.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 14,918
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
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II
Deb, K., Agrawal, S., Pratap, A., & Meyarivan, T. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45356-3_83 · Cited by 5,289
A niched Pareto genetic algorithm for multiobjective optimization
Horn, J., Nafpliotis, N., & Goldberg, D. E. (2002) · Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence · doi:10.1109/icec.1994.350037 · Cited by 2,433
An Overview of Evolutionary Algorithms in Multiobjective Optimization
Fonseca, C. M., & Fleming, P. J. (1995) · Evolutionary Computation · doi:10.1162/evco.1995.3.1.1 · Cited by 2,266
Evolutionary computation: Comments on the history and current state
Back, T., Hammel, U., & Schwefel, H.-P. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585888 · Cited by 1,536
A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques
Coello Coello, C. A. (1999) · Knowledge and Information Systems · doi:10.1007/bf03325101 · Cited by 1,367
Knowles, J., & Corne, D. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.781913 · Cited by 1,278
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Lamont, G. B., & Veldhuizen, D. A. V. (1999) · Cited by 1,212
An evolutionary algorithm for multiobjective optimization: the strength Pareto approach
Zitzler, E., & Thiele, L. (1998) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-004288833 · Cited by 689
MULTI-OBJECTIVE FUNCTION OPTIMIZATION USING NON-DOMINATED SORTING GENETIC ALGORITHMS
Srinivas, N., & Deb, K. (1994) · Cited by 585
PDE: a Pareto-frontier differential evolution approach for multi-objective optimization problems
Abbass, H. A., Sarker, R., & Newton, C. (2002) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934295 · Cited by 524
Differential evolution: a fast and simple numerical optimizer
Price, K. V. (2002) · Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS) · doi:10.1109/nafips.1996.534790 · Cited by 483
Controlled Elitist Non-dominated Sorting Genetic Algorithms for Better Convergence
Deb, K., & Goel, T. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44719-9_5 · Cited by 446
Design of efficient erasure codes with differential evolution
Shokrollahi, A., & Storn, R. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2000.866295 · Cited by 104
Cited by
Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II
Li, H., & Zhang, Q. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.925798 · Cited by 2,543
Recent advances in differential evolution: a survey and experimental analysis
Neri, F., & Tirronen, V. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9137-2 · Cited by 923
Multiobjective cuckoo search for design optimization
Yang, X.-S., & Deb, S. (2013) · Computers & Operations Research · doi:10.1016/j.cor.2011.09.026 · Cited by 882
GDE3: The third Evolution Step of Generalized Differential Evolution
Kukkonen, S., & Lampinen, J. (2005) · 2005 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2005.1554717 · Cited by 646
Flower pollination algorithm: A novel approach for multiobjective optimization
Yang, X.-S., Karamanoglu, M., & He, X. (2014) · Engineering Optimization · doi:10.1080/0305215x.2013.832237 · Cited by 629
Metadata
- Authors
- Madavan, N. K.
- Venue
- Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)
- Publisher
- IEEE
- Published
- 2003-06-25
- Volume
- 2
- Pages
- 1145-1150
- OpenAlex
- W1554486237
- Cited by
- 275
- References
- 16
- FWCI
- 6.28
- Type
- conference paper
- 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.