Similar articles

Abstract: In the field of genetics, it is well known that a specific genetic behavior may be influenced by more than one gene. There is a similar concept in genetic algorithms (GAs), called epistasis, which is the interaction between genes. This study demonstrates that, in spite of what is generally assumed, GAs are not an efficient optimization tool. This is because the main operator, mating (crossover), cannot function properly in epistatic optimization problems. In non-epistatic problems, although a GA can possibly provide a correct solution, it is an inefficient and time-consuming algorithm. As proof, we used conventional test functions and introduced new ones and confirmed our claim with simulation results.

上位效应对遗传算法可靠性的影响

[1]Davis LD, de Jong K, Vose MD, et al., 2012. Evolutionary Algorithms. Springer, New York, USA.

[2]de Oliveira LL, Freitas AA, Tinós R, 2018. Multi-objective genetic algorithms in the study of the genetic code’s adaptability. Information Sciences, 425:48-61.

[3]di Francescomarino C, Dumas M, Federici M, et al., 2018. Genetic algorithms for hyperparameter optimization in predictive business process monitoring. Information Systems, 74:67-83.

[4]Dong HB, Li T, Ding R, et al., 2018. A novel hybrid genetic algorithm with granular information for feature selection and optimization. Applied Soft Computing, 65:33-46.

[5]Greco A, D’Urso D, Cannizzaro F, et al., 2018. Damage identification on spatial Timoshenko arches by means of genetic algorithms. Mechanical Systems and Signal Processing, 105:51-67.

[6]Guo LH, Wang GG, Gandomi AH, et al., 2014. A new improved krill herd algorithm for global numerical optimization. Neurocomputing, 138:392-402.

[7]Haupt RL, Haupt SE, 2004. Practical Genetic Algorithms. John Wiley & Sons, Hoboken, New Jersey, USA.

[8]Jain A, Chaudhari NS, 2017. An improved genetic algorithm for developing deterministic OTP key generator. Complexity, 2017:7436709.

[9]Karakatič S, Podgorelec V, 2015. A survey of genetic algorithms for solving multi depot vehicle routing problem. Applied Soft Computing, 27:519-532.

[10]Qu BY, Liang JJ, Wang ZY, et al., 2016. Novel benchmark functions for continuous multimodal optimization with comparative results. Swarm and Evolutionary Computation, 26:23-34.

[11]Sivanandam SN, Deepa SN, 2008. Introduction to Genetic Algorithms. Springer, Berlin, Heidelberg, Germany.

[12]Steinberg ML, Cosloy SD, 2009. Biotechnology and Genetic Engineering. Infobase Publishing, New York, USA.

[13]Teimouri R, Baseri H, Rahmani B, et al., 2014. Modeling and optimization of spring-back in bending process using multiple regression analysis and neural computation. International Journal of Material Forming, 7(2):167-178.

[14]Tseng HE, Chang CC, Lee SC, et al., 2018. A block-based genetic algorithm for disassembly sequence planning. Expert Systems with Applications, 96:492-505.

[15]Wang H, Zhao ZZ, Guo ZW, et al., 2017. An improved clustering method for detection system of public security events based on genetic algorithm and semisupervised learning. Complexity, 2017:8130961.

[16]Zhou Y, Zhou LS, Wang Y, et al., 2017. Application of multiple-population genetic algorithm in optimizing the train-set circulation plan problem. Complexity, 2017: 3717654.