crossover and mutation
Recently Published Documents


TOTAL DOCUMENTS

320
(FIVE YEARS 78)

H-INDEX

19
(FIVE YEARS 1)

2022 ◽  
Vol 13 (1) ◽  
pp. 0-0

In this paper, we propose a hybrid algorithm combining two different metaheuristic methods, “Genetic Algorithms (GA)” and “Sperm Swarm Optimization (SSO)”, for the global optimization of multimodal benchmarks functions. The proposed Hybrid Genetic Algorithm and Sperm Swarm Optimization (HGASSO) operates based on incorporates concepts from GA and SSO in which generates individuals in a new iteration not only by crossover and mutation operations as proposed in GA, but also by techniques of local search of SSO. The main idea behind this hybridization is to reduce the probability of trapping in local optimum of multi modal problem. Our algorithm is compared against GA, and SSO metaheuristic optimization algorithms. The experimental results using a suite of multimodal benchmarks functions taken from the literature have evinced the superiority of the proposed HGASSO approach over the other approaches in terms of quality of results and convergence rates in which obtained good results in solving the multimodal benchmarks functions that include cosine, sine, and exponent in their formulation.


Algorithmica ◽  
2021 ◽  
Author(s):  
Pietro S. Oliveto ◽  
Dirk Sudholt ◽  
Carsten Witt

AbstractRecent progress in the runtime analysis of evolutionary algorithms (EAs) has allowed the derivation of upper bounds on the expected runtime of standard steady-state genetic algorithms (GAs). These upper bounds have shown speed-ups of the GAs using crossover and mutation over the same algorithms that only use mutation operators (i.e., steady-state EAs) both for standard unimodal (i.e., OneMax) and multimodal (i.e., Jump) benchmark functions. The bounds suggest that populations are beneficial to the GA as well as higher mutation rates than the default 1/n rate. However, making rigorous claims was not possible because matching lower bounds were not available. Proving lower bounds on crossover-based EAs is a notoriously difficult task as it is hard to capture the progress that a diverse population can make. We use a potential function approach to prove a tight lower bound on the expected runtime of the (2+1) GA for OneMax for all mutation rates c/n with $$c < 1.422$$ c < 1.422 . This provides the last piece of the puzzle that completes the proof that larger population sizes improve the performance of the standard steady-state GA for OneMax for various mutation rates, and it proves that the optimal mutation rate for the (2+1) GA on OneMax is $$(\sqrt{97}-5)/(4n) \approx 1.2122/n$$ ( 97 - 5 ) / ( 4 n ) ≈ 1.2122 / n .


Energies ◽  
2021 ◽  
Vol 14 (24) ◽  
pp. 8510
Author(s):  
Nedim Tutkun ◽  
Alessandro Burgio ◽  
Michal Jasinski ◽  
Zbigniew Leonowicz ◽  
Elzbieta Jasinska

With recent developments, smart grids assured for residential customers the opportunity to schedule smart home appliances’ operation times to simultaneously reduce both the electricity bill and the PAR based on demand response, as well as increasing user comfort. It is clear that the multi-objective combinatorial optimization problem involves constraints and the consumer’s preferences, and the solution to the problem is a difficult task. There have been a limited number of investigations carried out so far to solve the indicated problems using metaheuristic techniques like particle swarm optimization, mixed-integer linear programming, and the grey wolf and crow search optimization algorithms, etc. Due to the on/off control of smart home appliances, binary-coded genetic algorithms seem to be a well-fitted approach to obtain an optimal solution. It can be said that the novelty of this work is to represent the on/off state of the smart home appliance with a binary string which undergoes crossover and mutation operations during the genetic process. Because special binary numbers represent interruptible and uninterruptible smart home appliances, new types of crossover and mutation were developed to find the most convenient solutions to the problem. Although there are a few works which were carried out using the genetic algorithms, the proposed approach is rather distinct from those employed in their work. The designed genetic software runs at least ten times, and the most fitting result is taken as the optimal solution to the indicated problem; in order to ensure the optimal result, the fitness against the generation is plotted in each run, whether it is converged or not. The simulation results are significantly encouraging and meaningful to residential customers and utilities for the achievement of the goal, and they are feasible for a wide-range applications of home energy management systems.


2021 ◽  
Author(s):  
J PRINCE JEROME CHRISTOPHER ◽  
K LINGADURAI ◽  
G SHANKAR

Abstract Genetic algorithms are search algorithms based on the mechanics of natural selection and natural genetics. In this paper, we investigate a novel approach to the binary coded testing process based on a genetic algorithm. This paper consists of two parts. Thefirst part addresses the problem in the traditional way of using the decimal number system to define the fitness function to study the variations of counts and the variations of probability against the fitness functions. Second, the initialpopulationsare defined using binary coded digits (genes). For the evaluation of the high fitness function values,three genetic operators, namely, reproduction, crossover and mutation, are randomly used. The results show the importance of the genetic operator, mutation, which yields the peak values for the fitness function based on binary coded numbers performed in a new way.


2021 ◽  
pp. 265-273
Author(s):  
Yuxin Zhong ◽  
Yuxin Chen ◽  
Chen Yang ◽  
Zhenyu Meng

2021 ◽  
Author(s):  
◽  
Carlton Downey

<p>Linear Genetic Programming (LGP) is a powerful problem-solving technique, but one with several significant weaknesses. LGP programs consist of a linear sequence of instructions, where each instruction may reuse previously computed results. This structure makes LGP programs compact and powerful, however it also introduces the problem of instruction dependencies. The notion of instruction dependencies expresses the concept that certain instructions rely on other instructions. Instruction dependencies are often disrupted during crossover or mutation when one or more instructions undergo modification. This disruption can cause disproportionately large changes in program output resulting in non-viable offspring and poor algorithm performance. Motivated by biological inspiration and the issue of code disruption, we develop a new form of LGP called Parallel LGP (PLGP). PLGP programs consist of n lists of instructions. These lists are executed in parallel, and the resulting vectors are summed to produce the overall program output. PLGP limits the disruptive effects of crossover and mutation, which allows PLGP to significantly outperform regular LGP. We examine the PLGP architecture and determine that large PLGP programs can be slow to converge. To improve the convergence time of large PLGP programs we develop a new form of PLGP called Cooperative Coevolution PLGP (CC PLGP). CC PLGP adapts the concept of cooperative coevolution to the PLGP architecture. CC PLGP optimizes all program components in parallel, allowing CC PLGP to converge significantly faster than conventional PLGP. We examine the CC PLGP architecture and determine that performance</p>


2021 ◽  
Author(s):  
◽  
Carlton Downey

<p>Linear Genetic Programming (LGP) is a powerful problem-solving technique, but one with several significant weaknesses. LGP programs consist of a linear sequence of instructions, where each instruction may reuse previously computed results. This structure makes LGP programs compact and powerful, however it also introduces the problem of instruction dependencies. The notion of instruction dependencies expresses the concept that certain instructions rely on other instructions. Instruction dependencies are often disrupted during crossover or mutation when one or more instructions undergo modification. This disruption can cause disproportionately large changes in program output resulting in non-viable offspring and poor algorithm performance. Motivated by biological inspiration and the issue of code disruption, we develop a new form of LGP called Parallel LGP (PLGP). PLGP programs consist of n lists of instructions. These lists are executed in parallel, and the resulting vectors are summed to produce the overall program output. PLGP limits the disruptive effects of crossover and mutation, which allows PLGP to significantly outperform regular LGP. We examine the PLGP architecture and determine that large PLGP programs can be slow to converge. To improve the convergence time of large PLGP programs we develop a new form of PLGP called Cooperative Coevolution PLGP (CC PLGP). CC PLGP adapts the concept of cooperative coevolution to the PLGP architecture. CC PLGP optimizes all program components in parallel, allowing CC PLGP to converge significantly faster than conventional PLGP. We examine the CC PLGP architecture and determine that performance</p>


2021 ◽  
Vol 2078 (1) ◽  
pp. 012009
Author(s):  
Dongnan Suo

Abstract The traditional CSO algorithm is easy to fall into local extremum in optimization. In this paper, a CSO algorithm based on weight coefficient is proposed. In the CSO algorithm, the inertia weight coefficient is introduced into the hen position formula, and the learning factor influenced by the rooster is added to the chick position formula. Finally, using the idea of heredity, individuals with excellent fitness value are selected for crossover and mutation with a certain probability. Through the simulation comparison of five typical test functions, the simulation results show that the improved CSO algorithm can avoid local optimization, strengthen the global extreme value search ability, and improve the convergence speed and accuracy range of the algorithm.


2021 ◽  
Vol 2074 (1) ◽  
pp. 012037
Author(s):  
Ying Shi

Abstract At present, Bayesian networks lack consistent algorithms that support structure establishment, parameter learning, and knowledge reasoning, making it impossible to connect knowledge establishment and application processes. In view of this situation, by designing a genetic algorithm coding method suitable for Bayesian network learning, crossover and mutation operators with adjustment strategies, the fitness function for reasoning error feedback can be carried out. Experimental results show that the new algorithm not only simultaneously optimizes the network structure and parameters, but also can adaptively learn and correct inference errors, and has a more satisfactory knowledge inference accuracy rate.


Sign in / Sign up

Export Citation Format

Share Document