Quasi-random initial population for genetic algorithms

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

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

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 algorithms; Random numbers; Global continuous optimization; Quasi-random sequences

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Opposition-Based Computing, On initial populations of a genetic algorithm for continuous optimization problems, A hybrid genetic algorithm with the Baldwin effect, A new crossover operator for real coded genetic algorithms, Modifications of real code genetic algorithm for global optimization, A robust parameter design for multi-response problems, Small sample uniformity in random number generation, Integrated crossover rules in real coded genetic algorithms, A novel population initialization method for accelerating evolutionary algorithms, 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