The DOI matches its OpenAlex record; 19 of the 19 references it cites were found in a registry or an index.
SPEA2: Improving the strength pareto evolutionary algorithm
Open accessOverview
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
Density Estimation for Statistics and Data Analysis
Silverman, B. W. (2018) · Routledge eBooks · doi:10.1201/9781315140919 · Cited by 15,796
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Self-citationMuiltiobjective 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 · cited 1×
“…Pareto-based techniques were proposed in 1993 and 1994, e.g., MOGA (Fonseca and Fleming 1993), NPGA (Horn, Nafpliotis, and Goldberg 1994), and NSGA (Srinivas and Deb 1994), which demonstrated the capability of EMO algorithms to approximate the set of optimal trade-offs in a single optimization run.”
MethodComparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
Self-citationA 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
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
Schaffer, J. D. (1985) · international conference on Genetic algorithms · Cited by 3,326
Simulated Binary Crossover for Continuous Search Space.
Deb, K., & Agrawal, R. B. (1995) · Complex Systems · Cited by 2,976
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
Evolutionary algorithms for multiobjective optimization: methods and applications
Zitzler, E. (1999) · doi:10.3929/ethz-a-003856832 · Cited by 1,965
Self-citationKnowles, 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
The Pareto Envelope-Based Selection Algorithm for Multiobjective Optimization
Corne, D. W., Knowles, J. D., & Oates, M. J. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45356-3_82 · Cited by 884
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
Self-citation(2000) · Institute of Physics eBooks · doi:10.1887/0750306653 · Cited by 616
A variant of evolution strategies for vector optimization
Kursawe, F. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0029752 · Cited by 597
Jaszkiewicz, A. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802873 · Cited by 474
Multiobjective genetic programming: reducing bloat using SPEA2
Bleuler, S., Brack, M., Thiele, L., & Zitzler, E. (2002) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934438 · Cited by 221
Self-citationA unified model for multi-objective evolutionary algorithms with elitism
Laumanns, M., Zitzler, E., & Thiele, L. (2002) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2000.870274 · Cited by 149
Self-citation
Cited by
Handling multiple objectives with particle swarm optimization
Coello, C. A. C., Pulido, G. T., & Lechuga, M. S. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826067 · Cited by 4,455
Multi-objective optimization using genetic algorithms: A tutorial
Konak, A., Coit, D. W., & Smith, A. E. (2006) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2005.11.018 · Cited by 3,440
Scalable Test Problems for Evolutionary Multiobjective Optimization
Deb, K., Thiele, L., Laumanns, M., & Zitzler, E. (2005) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-137-7_6 · Cited by 2,010
Self-citationA Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization
Cheng, R., Jin, Y., Olhofer, M., & Sendhoff, B. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2519378 · Cited by 1,760
Scalable multi-objective optimization test problems
Deb, K., Thiele, L., Laumanns, M., & Zitzler, E. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1007032 · Cited by 1,627
Self-citation
Metadata
- Authors
- Zitzler, E., Laumanns, M., & Thiele, L.
- Publisher
- ETH Zurich
- Published
- 2001
- Volume
- 103
- OpenAlex
- W1585939719
- Cited by
- 5,008
- References
- 19
- FWCI
- 47.63
- Type
- journal article
- Language
- en
- Open access
- green
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.