Genetic algorithm encoding and problems solving for enthusiasts
Genetic algorithm has emerged as one of the evolutionary computation techniques to solve complex problems that are not continuous, lacking linearity, derivatives and non-deterministic polynomial time problem(NP-Hard).It is a heuristic search and optimization technique that mimics the biological natural selection and survival of the fittest theory and terminates when either a maximum number of generations or a satisfactory level of fitness level has been reached for the population. The algorithm utilizes probability techniques and when structured satisfactory results could be achieved. Care is needed to eliminate convergence to local optimum by applying proper codes and encoding technique, selection and mutation.
Authors
- N. I. Effeng
- Godwin Daniel Essien
- Whyte Asukwo Akpan
- Chikodili Martha Orazulume
- Nsikakabasi Nsedu Inyang
- Francis Etebong Edet
Publication Details
- Journal
- Global Journal of Engineering and Technology Advances
- Published
- 2025-07-16
- DOI
- https://doi.org/10.30574/gjeta.2025.24.1.0203
- Primary Topic
- Color perception and design
- Type
- article
- Field-Weighted Citation Impact
- 0.00