Fetching the paper…
Reading the bibliography…
Roulette-wheel selection is a frequently used method in genetic and evolutionary algorithms or in modeling of complex networks.
J. E. Baker, Adaptive selection methods for genetic algorithms. Proceedings of an International Conference on Genetic Algorithms and Their Applications, p. 100-111 (1985)
1985
Earlier work this paper cites.
J. E. Baker, Reducing bias and inefficiency in the selection algoritm. Proceedings of the Second International Conference on Genetic Algorithms, p. 14-21 (1987)
1987
Earlier work this paper cites.
D.E. Goldberg Genetic Algorithms in Search, Optimization, and Machine Learning
1989
Earlier work this paper cites.
D. E. Goldberg and K. Deb, A comparative analysis of selection schemes used in genetic algorithms p. 69-93, in ”Foundations of Genetic Algorithms”, ed. G.J.E Rawlins, (Morgan Kaufmann Publishers, San Mateo, California, 1991)
1991
Earlier work this paper cites.
J.H. Holland Adaptation in Natural and Artificial Systems
1992
Earlier work this paper cites.
P. J. B. Hancock, An Empirical Comparison of Selection Methods in Evolutionary Algorithms, in ”Selected Papers from AISB Workshop on Evolutionary Computing” p. 80-94, Springer-Verlag, London UK (1994)
1994
Earlier work this paper cites.
K. F. Pal, Physica A 223
1996
Earlier work this paper cites.
T. Shibutani, M. Sambridge, B. Kennett, Geophys. Res. Lett. 22
1996
Cited alongside, same era.
G. M. Morris, D. S. Goodsell, R. S. Halliday, R. Huey, W. E. Hart, R. K. Belew and A. J. Olson, J. Comput. Chem. 19
1998
Cited alongside, same era.
A. L. Barabási and R. Albert, Science 286
1999
Cited alongside, same era.
S. N. Dorogovtsev and J. F. F. Mendes, Phys. Rev. E 62
2000
Cited alongside, same era.
P. L. Krapivsky and S. Redner, Phys. Rev. E 63
2001
Cited alongside, same era.
I. Golovkin, R. Mancini, S. Louis, R. Lee, and L. Klein, J. Quant. Spectr. Radi. Tr. 75
2002
Cited alongside, same era.
A. K. Hartmann and H. Rieger, Optimization Algorithms in Physics
2002
Later among the works it cites.
S. Boccaletti, V. Latora, Y. Moreno, M. Chaves, and D. -U. Hwang, Phys. Rep. 424
2006
Later among the works it cites.
D. M. Deaven and K. M. Ho, Phys. Rev. Lett. 75
2008
Later among the works it cites.
S. Gupta, Relative fitness scaling for improving efficiency of proportionate selection in genetic algorithms, in ”Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers”, p. 2741–2744, ACM New York, NY, USA (2009)
2009
Later among the works it cites.
For a recent review of various selection methods see, e.g., R. Sivaraj and T. Ravichandran, A review of selection methods in genetic algorithm, Int. J. Eng. Sci. Tech. 3
2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited in the paper.
Genetic algoritms are unlikely to operate in a regime of vanishing ⟨ w ⟩ \langle w\rangle and thus some bounds imposed on fitness should result in finite τ \tau and O ( 1 ) O(1) complexity of the algorithm
Cited in the paper.
N. M. Razali and J. Gerghty, Proc. World Congress Engineering 2011 vol II WCE 2011 (London UK)
2011
Closest in time.