Improving genetic algorithm with fine-tuned crossover and scaled architecture
Summary: Genetic Algorithm (GA) is a metaheuristic used in solving combinatorial optimization problems. Inspired by evolutionary biology, GA uses selection, crossover, and mutation operators to efficiently traverse the solution search space. This paper proposes nature inspired fine-tuning to the crossover operator using the untapped idea of Mitochondrial DNA (mtDNA). mtDNA is a small subset of the overall DNA. It differentiates itself by inheriting entirely from the female, while the rest of the DNA is inherited equally from both parents. This unique characteristic of mtDNA can be an effective mechanism to identify members with similar genes and restrict crossover between them. It can reduce the rate of dilution of diversity and result in delayed convergence. In addition, we scale the well-known Island Model, where instances of GA are run independently and population members exchanged periodically, to a Continental Model. In this model, multiple web services are executed with each web service running an island model. We applied the concept of mtDNA in solving Traveling Salesman Problem and to train Neural Network for function approximation. Our implementation tests show that leveraging these new concepts of mtDNA and Continental Model results in relative improvement of the optimization quality of GA.
- A genetic algorithm using triplet nucleotide encoding and DNA reproduction operations for unconstrained optimization problems
- Adaptive pair bonds in genetic algorithm: an application to real-parameter optimization
- scientific article; zbMATH DE number 1946633
- Integrating particle swarm optimization with genetic algorithms for solving nonlinear optimization problems
- Algorithmes génétiques hybrides pour l'optimisation combinatoire
- A genetic algorithm using triplet nucleotide encoding and DNA reproduction operations for unconstrained optimization problems
- Shrimp feed formulation via evolutionary algorithm with power heuristics for handling constraints
- The influence of problem specific neighborhood structures in metaheuristics performance
- scientific article; zbMATH DE number 5732413 (Why is no real title available?)
- Genetic engineering algorithm (GEA): an efficient metaheuristic algorithm for solving combinatorial optimization problems
- Stochastic dominance and portfolio performance under heuristic optimization
This page was built for publication: Improving genetic algorithm with fine-tuned crossover and scaled architecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670576)
