Computer Science – Neural and Evolutionary Computing
Scientific paper
2011-09-16
Physica A 391 (2012) pp. 2193-2196
Computer Science
Neural and Evolutionary Computing
4 pages, Physica A, accepted
Scientific paper
10.1016/j.physa.2011.12.004
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(log(N)) 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.
Lipowska Dorota
Lipowski Adam
No associations
LandOfFree
Roulette-wheel selection via stochastic acceptance does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Roulette-wheel selection via stochastic acceptance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Roulette-wheel selection via stochastic acceptance will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-535039