Searching for Good Multiple Recursive Random Number Generators via a Genetic Algorithm

Published Online:https://doi.org/10.1287/ijoc.1030.0039

References

  • Aggarwal C. C., Orlin J. B., Tai R. P. Optimized crossover for the independent set problem. Oper. Res. (1997) 45:226–243LinkGoogle Scholar
  • Cassels J. W. S.An Introduction to the Geometry of Numbers (1959) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Conway J. H., Sloane N. J. A.Sphere Packing, Lattice and Groups (1999) 2903rd ed.(Springer-Verlag, New York) CrossrefGoogle Scholar
  • Davis L.Handbook of Genetic Algorithms (1991) (Van Nostrand Reinhold, New York) Google Scholar
  • De Jong K. A. An analysis of the behavior of a class of genetic adaptive systems. (1975) . Doctoral dissertation, Department of Computer and Communication Sciences, University of Michigan, Ann Arbor, MIGoogle Scholar
  • Dowsland K. A. Genetic algorithms—A tool for OR? J. Oper. Res. Soc. (1996) 47:550–561CrossrefGoogle Scholar
  • Entacher K., Schell T., Uhl A., Schuëller G. I., Spanos P. D. Evolutionary optimization of random number generators. Monte Carlo Simulation (2001) (A. A. Balkema, Rotterdam, The Netherlands) 19–26Google Scholar
  • Goldberg D. E., Rudnick M. Genetic algorithms and the variance of fitness. Complex Systems (1991) 5:265–278Google Scholar
  • Grefenstette J. J. Optimization of control parameters for genetic algorithms. IEEE Trans. Systems, Man Cybernetics SMC- (1986) 16:122–128CrossrefGoogle Scholar
  • Hancock P. J. B., Fogarty T. C. An empirical comparison of selection methods in evolutionary algorithms. Evolutionary Computing: AISB Workshop, Leeds, UK, April 1994; Selected Papers (1994) (Springer-Verlag, Berlin, Germany) 80–94CrossrefGoogle Scholar
  • Holland J. H.Adaptation in Natural and Artificial Systems (1992) (University of Michigan Press, Ann Arbor, MI) CrossrefGoogle Scholar
  • Kao C., Tang H. C. Upper bounds in spectral test for multiple recursive random number generators with missing terms. Comput. Math. Appl. (1997a) 33:119–125CrossrefGoogle Scholar
  • Kao C., Tang H. C. Systematic searches for good multiple recursive random number generators. Comput. Oper. Res. (1997b) 24:899–905CrossrefGoogle Scholar
  • Kao C., Tang H. C. Several extensively tested multiple recursive random number generators. Comput. Math. Appl. (1998) 36:129–136CrossrefGoogle Scholar
  • Kao C., Wong J. Y. Random number generators with long period and sound statistical properties. Comput. Math. Appl. (1998) 36:113–121CrossrefGoogle Scholar
  • Kershenbaum A. When genetic algorithms work best. INFORMS J. Comput. (1997) 9:254–255LinkGoogle Scholar
  • Knuth D. E.The Art of Computer Programming (1997) 23rd ed.(Addison-Wesley, Reading, MA) Google Scholar
  • L'Ecuyer P. Combined multiple recursive random number generators. Oper. Res. (1996) 44:816–822LinkGoogle Scholar
  • L'Ecuyer P. Bad lattice structures for vectors of nonsuccessive values produced by some linear recurrences. INFORMS J. Comput. (1997) 9:57–60LinkGoogle Scholar
  • L'Ecuyer P. Good parameters and implementations for combined multiple recursive random number generators. Oper. Res. (1999a) 47:159–164LinkGoogle Scholar
  • L'Ecuyer P. Tables of linear congruential generators of different sizes and good lattice structure. Math. Comput. (1999b) 68:249–260CrossrefGoogle Scholar
  • L'Ecuyer P., Blouin F., Couture R. A search for good multiple recursive random number generators. ACM Trans. Model. Comput. Simulation (1993) 3:87–98CrossrefGoogle Scholar
  • L'Ecuyer P., Côté S. Implementing a random number package with splitting facilities. ACM Trans. Math. Software (1991) 17:98–111CrossrefGoogle Scholar
  • L'Ecuyer P., Couture R. An implementation of the lattice and spectral tests for linear congruential and multiple recursive generators. INFORMS J. Comput. (1997) 9:206–217LinkGoogle Scholar
  • Niederreiter H.Random Number Generation and Quasi-Monte Carlo Methods (1992) (SIAM, Philadelphia, PA) CrossrefGoogle Scholar
  • Reeves C. R. Hybrid genetic algorithms for bin-packing and related problems. Ann. Oper. Res. (1996) 63:371–396CrossrefGoogle Scholar
  • Reeves C. R. Genetic algorithms for the operations researcher. INFORMS J. Comput. (1997) 9:231–250LinkGoogle Scholar
  • Tang H. C. Combined random number generator via the generalized Chinese remainder theorem. J. Comput. Appl. Math. (2002) 142:377–388CrossrefGoogle Scholar
  • Tang H. C., Kao C. Lower bounds in spectral tests for vectors of nonsuccessive values produced by multiple recursive generator with some zero multipliers. Comput. Math. Appl. (2002) 43:1153–1159CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.