Quasi-random initial population for genetic algorithms
From MaRDI portal
Recommendations
- On initial populations of a genetic algorithm for continuous optimization problems
- Random number generators in genetic algorithms for unconstrained and constrained optimization
- Publication:4725593
- scientific article; zbMATH DE number 6500477
- Unconventional initialization methods for differential evolution
Cites work
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 1220657 (Why is no real title available?)
- scientific article; zbMATH DE number 702365 (Why is no real title available?)
- scientific article; zbMATH DE number 1103065 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- A new measure of irregularity of distribution and quasi-Monte Carlo methods for global optimization
- A novel metaheuristics approach for continuous global optimization
- ACORN - A new method for generating sequences of uniformly distributed pseudo-random numbers
- Adaptive random search in quasi-Monte Carlo methods for global optimization
- Algorithm 659
- An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization
- Global optimization
- Global optimization and simulated annealing
- Implementation and tests of low-discrepancy sequences
- Multi-objective optimization using evolutionary algorithms
- Numerical comparison of some penalty-based constraint handling techniques in genetic algorithms
- On the crude multidimensional search
- Quasi-Random Sequences and Their Discrepancies
Cited in
(22)- A uniform sampling method for permutation space
- A robust parameter design for multi-response problems
- Efficient hybrid methods for global continuous optimization based on simulated annealing
- Small sample uniformity in random number generation
- A new mutation operator for real coded genetic algorithms
- Random number generators in genetic algorithms for unconstrained and constrained optimization
- A hybrid genetic algorithm with the Baldwin effect
- Integrated crossover rules in real coded genetic algorithms
- On initial populations of a genetic algorithm for continuous optimization problems
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
- Isogeometric analysis and genetic algorithm for shape-adaptive composite marine propellers
- A comparative study on different versions of multi-objective genetic algorithm for simultaneous gene selection and sample categorization
- Bi-objective genetic algorithm with rough set theory for important gene selection in disease diagnosis
- Difficulty factors and preprocessing in imbalanced data sets: an experimental study on artificial data
- Modifications of real code genetic algorithm for global optimization
- Geometricity of genetic operators for real-coded representation
- Subset selection in multiple linear regression models: a hybrid of genetic and simulated annealing algorithms
- Seeding the initial population with feasible solutions in metaheuristic optimization of steel trusses
- A novel population initialization method for accelerating evolutionary algorithms
- The quasispecies regime for the simple genetic algorithm with ranking selection
- A new crossover operator for real coded genetic algorithms
- Opposition-Based Computing
This page was built for publication: Quasi-random initial population for genetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1767905)
