A Review of the Use of Quasi-random Number Generators to Initialize the Population in Meta-heuristic Algorithms
- 31 May 2022
- journal article
- review article
- Published by Springer Nature in Archives of Computational Methods in Engineering
- Vol. 29 (7) , 5149-5184
Abstract
No abstract availableKeywords
This publication has 44 references indexed in Scilit:
- Construction and Comparison of High-Dimensional Sobol' GeneratorsWilmott, 2011
- GSA: A Gravitational Search AlgorithmInformation Sciences, 2009
- Efficient evolutionary optimization through the use of a cultural algorithmEngineering Optimization, 2004
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer CodeTechnometrics, 2000
- Computational investigations of low-discrepancy sequencesACM Transactions on Mathematical Software, 1997
- Sampling with Hammersley and Halton PointsJournal of Graphics Tools, 1997
- Algorithm 659ACM Transactions on Mathematical Software, 1988
- Large Sample Properties of Simulations Using Latin Hypercube SamplingTechnometrics, 1987
- Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence GeneratorsACM Transactions on Mathematical Software, 1986
- The Conditional Level of Student's $t$ TestThe Annals of Mathematical Statistics, 1967