Gender Genetic Algorithm in the Dynamic Optimization Problem
- URL: http://arxiv.org/abs/2002.05882v1
- Date: Fri, 14 Feb 2020 06:06:38 GMT
- Title: Gender Genetic Algorithm in the Dynamic Optimization Problem
- Authors: P.A. Golovinski, S.A. Kolodyazhnyi
- Abstract summary: A general approach to optimizing fast processes using a gender genetic algorithm is described.
Its difference from the more traditional genetic algorithm it contains division the artificial population into two sexes.
As a promising application of the gender genetic algorithm with the Boldwin effect, the dynamics of extinguishing natural fires is pointed.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A general approach to optimizing fast processes using a gender genetic
algorithm is described. Its difference from the more traditional genetic
algorithm it contains division the artificial population into two sexes. Male
subpopulations undergo large mutations and more strong selection compared to
female individuals from another subset. This separation allows combining the
rapid adaptability of the entire population to changes due to the variation of
the male subpopulation with fixation of adaptability in the female part. The
advantage of the effect of additional individual learning in the form of
Boldwin effect in finding optimal solutions is observed in comparison with the
usual gender genetic algorithm. As a promising application of the gender
genetic algorithm with the Boldwin effect, the dynamics of extinguishing
natural fires is pointed.
Related papers
- Predicting Genetic Mutation from Whole Slide Images via Biomedical-Linguistic Knowledge Enhanced Multi-label Classification [119.13058298388101]
We develop a Biological-knowledge enhanced PathGenomic multi-label Transformer to improve genetic mutation prediction performances.
BPGT first establishes a novel gene encoder that constructs gene priors by two carefully designed modules.
BPGT then designs a label decoder that finally performs genetic mutation prediction by two tailored modules.
arXiv Detail & Related papers (2024-06-05T06:42:27Z) - Evaluating Genetic Algorithms through the Approximability Hierarchy [55.938644481736446]
In this paper, we analyze the usefulness of using genetic algorithms depending on the approximation class the problem belongs to.
In particular, we use the standard approximability hierarchy, showing that genetic algorithms are especially useful for the most pessimistic classes of the hierarchy.
arXiv Detail & Related papers (2024-02-01T09:18:34Z) - Genetic Algorithm enhanced by Deep Reinforcement Learning in parent
selection mechanism and mutation : Minimizing makespan in permutation flow
shop scheduling problems [0.18846515534317265]
The proposed RL+GA method was specifically tested on the flow shop scheduling problem (FSP)
The hybrid algorithm incorporates neural networks (NN) and uses the off-policy method Q-learning.
Results of the study highlight the effectiveness of the RL+GA approach in improving the performance of the primitive GA.
arXiv Detail & Related papers (2023-11-10T08:51:42Z) - Larger Offspring Populations Help the $(1 + (\lambda, \lambda))$ Genetic
Algorithm to Overcome the Noise [76.24156145566425]
Evolutionary algorithms are known to be robust to noise in the evaluation of the fitness.
We analyze to what extent the $(lambda,lambda)$ genetic algorithm is robust to noise.
arXiv Detail & Related papers (2023-05-08T08:49:01Z) - Massively Parallel Genetic Optimization through Asynchronous Propagation
of Populations [50.591267188664666]
Propulate is an evolutionary optimization algorithm and software package for global optimization.
We provide an MPI-based implementation of our algorithm, which features variants of selection, mutation, crossover, and migration.
We find that Propulate is up to three orders of magnitude faster without sacrificing solution accuracy.
arXiv Detail & Related papers (2023-01-20T18:17:34Z) - A Genetic Quantum Annealing Algorithm [0.0]
A genetic algorithm (GA) is a search-based optimization technique based on the principles of Genetics and Natural Selection.
We present an algorithm which enhances the classical GA with input from quantum annealers.
arXiv Detail & Related papers (2022-09-15T16:59:55Z) - Temporal Heterogeneity Improves Speed and Convergence in Genetic
Algorithms [0.0]
Genetic algorithms simulate natural selection to explore a parameter space in search of solutions for a broad variety of problems.
We set the crossover probability to be inversely proportional to the individual's fitness, i.e., better solutions change slower than those with a lower fitness.
We find that temporal heterogeneity consistently improves search without having prior knowledge of the parameter space.
arXiv Detail & Related papers (2022-02-02T22:48:56Z) - Result Diversification by Multi-objective Evolutionary Algorithms with
Theoretical Guarantees [94.72461292387146]
We propose to reformulate the result diversification problem as a bi-objective search problem, and solve it by a multi-objective evolutionary algorithm (EA)
We theoretically prove that the GSEMO can achieve the optimal-time approximation ratio, $1/2$.
When the objective function changes dynamically, the GSEMO can maintain this approximation ratio in running time, addressing the open question proposed by Borodin et al.
arXiv Detail & Related papers (2021-10-18T14:00:22Z) - Understanding the Generalization of Adam in Learning Neural Networks
with Proper Regularization [118.50301177912381]
We show that Adam can converge to different solutions of the objective with provably different errors, even with weight decay globalization.
We show that if convex, and the weight decay regularization is employed, any optimization algorithms including Adam will converge to the same solution.
arXiv Detail & Related papers (2021-08-25T17:58:21Z) - A Rank based Adaptive Mutation in Genetic Algorithm [0.0]
This paper presents an alternate approach of mutation probability generation using chromosome rank to avoid any susceptibility to fitness distribution.
Experiments are done to compare results of simple genetic algorithm (SGA) with constant mutation probability and adaptive approaches within a limited resource constraint.
arXiv Detail & Related papers (2021-04-18T12:41:33Z) - Genetic optimization algorithms applied toward mission computability
models [0.3655021726150368]
Genetic algorithms are computations based and low cost to compute.
We describe our genetic optimization algorithms to a mission-critical and constraints-aware problem.
arXiv Detail & Related papers (2020-05-27T00:45:24Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.