Quasi-random initial population for genetic algorithms

DOI10.1016/j.camwa.2003.07.011zbMath1074.90036OpenAlexW2068696225WikidataQ110035716 ScholiaQ110035716MaRDI QIDQ1767905

Kaisa M. Miettinen, Marko M. Mäkelä, Heikki Maaranen

Publication date: 8 March 2005

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2003.07.011

zbMATH Keywords

Genetic algorithmsRandom numbersGlobal continuous optimizationQuasi-random sequences

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Difficulty factors and preprocessing in imbalanced data sets: an experimental study on artificial data ⋮ A new crossover operator for real coded genetic algorithms ⋮ Modifications of real code genetic algorithm for global optimization ⋮ Seeding the initial population with feasible solutions in metaheuristic optimization of steel trusses ⋮ Opposition-Based Computing ⋮ A robust parameter design for multi-response problems ⋮ On initial populations of a genetic algorithm for continuous optimization problems ⋮ Initialization of metaheuristics: comprehensive review, critical analysis, and research directions ⋮ Small sample uniformity in random number generation ⋮ Random number generators in genetic algorithms for unconstrained and constrained optimization ⋮ Integrated crossover rules in real coded genetic algorithms ⋮ Geometricity of genetic operators for real-coded representation ⋮ Subset selection in multiple linear regression models: a hybrid of genetic and simulated annealing algorithms ⋮ A hybrid genetic algorithm with the Baldwin effect ⋮ A new mutation operator for real coded genetic algorithms ⋮ Isogeometric analysis and genetic algorithm for shape-adaptive composite marine propellers ⋮ A novel population initialization method for accelerating evolutionary algorithms ⋮ 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 ⋮ Efficient hybrid methods for global continuous optimization based on simulated annealing

Uses Software

• Genocop
• TOMS659

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ACORN - A new method for generating sequences of uniformly distributed pseudo-random numbers
• Global optimization and simulated annealing
• Numerical comparison of some penalty-based constraint handling techniques in genetic algorithms
• A new measure of irregularity of distribution and quasi-Monte Carlo methods for global optimization
• Adaptive random search in quasi-Monte Carlo methods for global optimization
• A novel metaheuristics approach for continuous global optimization
• On the crude multidimensional search
• Algorithm 659
• Quasi-Random Sequences and Their Discrepancies
• Implementation and tests of low-discrepancy sequences
• Global optimization
• An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization