Genetic algorithm formulation and tuning with use of test functions

10/06/2022

∙

This work discusses single-objective constrained genetic algorithm with floating-point, integer, binary and permutation representation. Floating-point genetic algorithm tuning with use of test functions is done and leads to a parameterization with comparatively outstanding performance.

READ FULL TEXT

Genetic algorithm formulation and tuning with use of test functions

Finding normal binary floating-point factors in constant time

Numerical Replication of Computer Simulations: Some Pitfalls and How To Avoid Them

Exploiting Binary Floating-Point Representations for Constraint Propagation: The Complete Unabridged Version

On quality of implementation of Fortran 2008 complex intrinsic functions on branch cuts

Constrained Delaunay Tetrahedrization: A Robust and Practical Approach

Improving Reflexive Surfaces Efficiency with Genetic Algorithms

Deriving Smaller Orthogonal Arrays from Bigger Ones with Genetic Algorithm

Genetic algorithm formulation and tuning with use of test functions

Related Research

Finding normal binary floating-point factors in constant time

Numerical Replication of Computer Simulations: Some Pitfalls and How To Avoid Them

Exploiting Binary Floating-Point Representations for Constraint Propagation: The Complete Unabridged Version

On quality of implementation of Fortran 2008 complex intrinsic functions on branch cuts

Constrained Delaunay Tetrahedrization: A Robust and Practical Approach

Improving Reflexive Surfaces Efficiency with Genetic Algorithms

Deriving Smaller Orthogonal Arrays from Bigger Ones with Genetic Algorithm