The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
AbYSS: Adapting Scatter Search to Multiobjective Optimization
Abstract
We propose the use of a new algorithm to solve multiobjective optimization problems. Our proposal adapts the well-known scatter search template for single-objective optimization to the multiobjective domain. The result is a hybrid metaheuristic algorithm called Archive-Based hYbrid Scatter Search (AbYSS), which follows the scatter search structure but uses mutation and crossover operators from evolutionary algorithms. AbYSS incorporates typical concepts from the multiobjective field, such as Pareto dominance, density estimation, and an external archive to store the nondominated solutions. We evaluate AbYSS with a standard benchmark including both unconstrained and constrained problems, and it is compared with two state-of-the-art multiobjective optimizers, NSGA-II and SPEA2. The results obtained indicate that, according to the benchmark and parameter settings used, AbYSS outperforms the other two algorithms as regards the diversity of the solutions, and it obtains very competitive results according to the convergence to the true Pareto fronts and the hypervolume metric.
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
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 14,918
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
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
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
Evolutionary Algorithms for Solving Multi-Objective Problems
(2007) · Genetic and Evolutionary Computation Series · doi:10.1007/978-0-387-36797-2 · Cited by 5,686
SPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008
Handbook of Parametric and Nonparametric Statistical Procedures
(2004) · Technometrics · doi:10.1198/tech.2004.s209 · Cited by 4,661
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
Cited by
jMetal: A Java framework for multi-objective optimization
Durillo, J. J., & Nebro, A. J. (2011) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2011.05.014 · Cited by 1,134
Self-citationSMPSO: A new PSO-based metaheuristic for multi-objective optimization
Nebro, A. J., Durillo, J. J., Garcia-Nieto, J., Coello Coello, C. A., Luna, F., & Alba, E. (2009) · 2009 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making(MCDM) · doi:10.1109/mcdm.2009.4938830 · Cited by 651
Self-citationGeneralizing Surrogate-Assisted Evolutionary Computation
Lim, D., Jin, Y., Ong, Y.-S., & Sendhoff, B. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2027359 · Cited by 484
Transfer Learning-Based Dynamic Multiobjective Optimization Algorithms
Jiang, M., Huang, Z., Qiu, L., Huang, W., & Yen, G. G. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2771451 · Cited by 419
Ponsich, A., Jaimes, A. L., & Coello, C. A. C. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2196800 · Cited by 361
Metadata
- Authors
- Nebro, A. J., Luna, F., Alba, E., Dorronsoro, B., Durillo, J. J., & Beham, A.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2008-08
- Volume
- 12
- Issue
- 4
- Pages
- 439-457
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2170766832
- Cited by
- 267
- References
- 36
- FWCI
- 22.21
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: AbYSS: Adapting Scatter Search to Multiobjective Optimization. https://app.cochat.ai/papers/10.1109/tevc.2007.913109
- The paper
- Nebro, A. J., Luna, F., Alba, E., Dorronsoro, B., Durillo, J. J., & Beham, A. (2008). AbYSS: Adapting Scatter Search to Multiobjective Optimization. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2007.913109
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.