The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Roulette-wheel selection via stochastic acceptance
Open accessAbstract
Roulette-wheel selection is a frequently used method in genetic and evolutionary algorithms or in modeling of complex networks. Existing routines select one of N individuals using search algorithms of O(N) or O(logN) complexity. We present a simple roulette-wheel selection algorithm, which typically has O(1) complexity and is based on stochastic acceptance instead of searching. We also discuss a hybrid version, which might be suitable for highly heterogeneous weight distributions, found, for example, in some models of complex networks. With minor modifications, the algorithm might also be used for sampling with fitness cut-off at a certain value or for sampling without replacement.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
A Comparative Analysis of Selection Schemes Used in Genetic Algorithms
Goldberg, D. E., & Deb, K. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50008-2 · Cited by 2,407
Reducing bias and inefficiency in the selection algorithm
Baker, J. E. (1987) · international conference on Genetic algorithms · Cited by 1,415
Molecular Geometry Optimization with a Genetic Algorithm
Deaven, D. M., & Ho, K. M. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.288 · Cited by 1,136
Adaptive Selection Methods for Genetic Algorithms
Baker, J. E. (1985) · international conference on Genetic algorithms · Cited by 1,022
Organization of growing random networks
Krapivsky, P. L., & Redner, S. (2001) · Physical Review E · doi:10.1103/physreve.63.066123 · Cited by 871
Cited by
Choosing Mutation and Crossover Ratios for Genetic Algorithms—A Review with a New Dynamic Approach
Hassanat, A., Almohammadi, K., Alkafaween, E., Abunawas, E., Hammouri, A., & Prasath, V. B. S. (2019) · Information · doi:10.3390/info10120390 · Cited by 668
Red deer algorithm (RDA): a new nature-inspired meta-heuristic
Fathollahi-Fard, A. M., Hajiaghaei-Keshteli, M., & Tavakkoli-Moghaddam, R. (2020) · Soft Computing · doi:10.1007/s00500-020-04812-z · Cited by 443
van Grinsven, M. J. J. P., van Ginneken, B., Hoyng, C. B., Theelen, T., & Sanchez, C. I. (2016) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2016.2526689 · Cited by 426
Chaos-based image encryption using a hybrid genetic algorithm and a DNA sequence
Enayatifar, R., Abdullah, A. H., & Isnin, I. F. (2014) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2013.12.003 · Cited by 405
Mo, S., Zabaras, N., Shi, X., & Wu, J. (2019) · Water Resources Research · doi:10.1029/2018wr024638 · Cited by 288
Topology optimization of heat exchangers: A review
Fawaz, A., Hua, Y., Le Corre, S., Fan, Y., & Luo, L. (2022) · Energy · doi:10.1016/j.energy.2022.124053 · Cited by 273
Efficient Task Offloading for IoT-Based Applications in Fog Computing Using Ant Colony Optimization
Hussein, M. K., & Mousa, M. H. (2020) · IEEE Access · doi:10.1109/access.2020.2975741 · Cited by 260
Go-Explore: a New Approach for Hard-Exploration Problems
Ecoffet, A., Huizinga, J., Lehman, J., Stanley, K. O., & Clune, J. (2019) · arXiv · doi:10.48550/arxiv.1901.10995 · Cited by 205
Deep learning library testing via effective model generation
Wang, Z., Yan, M., Chen, J., Liu, S., & Zhang, D. (2020) · Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering · doi:10.1145/3368089.3409761 · Cited by 167
A novel genetic algorithm based system for the scheduling of medical treatments
Squires, M., Tao, X., Elangovan, S., Gururajan, R., Zhou, X., & Acharya, U. R. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.116464 · Cited by 110
Sood, S. K., Kumar, N., & Saini, M. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-021-09980-4 · Cited by 93
Jung, Y., Han, C., Lee, D., Song, S., & Jang, G. (2021) · Applied Sciences · doi:10.3390/app11198979 · Cited by 15
Metadata
- Authors
- Lipowski, A., & Lipowska, D.
- Venue
- Physica A: Statistical Mechanics and its Applications
- Publisher
- Elsevier BV
- Published
- 2012-03
- Volume
- 391
- Issue
- 6
- Pages
- 2193-2196
- ISSN
- 0378-4371 (ISSN-L)
- OpenAlex
- W1965969360
- Cited by
- 761
- References
- 19
- FWCI
- 7.10
- 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.