Abstract
The theory and practice of genetic algorithms is largely based on the Schema Theorem. It was formulated for a canonical genetic algorithm and proves its ability to generate a sufficient number of effective schemata of individuals. Genetic algorithms to solve specific problems and to be different from canonical ones have to be checked to find out whether the Schema Theorem evaluates the algorithm fitness. The article validates the way of testing the algorithm developed as a technique of an area search. The methodology and research results are stated consistently. Coding specifics of the search queries are noted, a criterion of the coding method applicability is substantiated. A variant of the genotype geometric coding is proposed. In comparison with other methods of binary search coding, it provides a short code length and uniqueness as well as conforms the formulated criterion of applicability. Supporting experimental results are given. The Schema Theorem is shown to hold with the iterative execution of the genetic algorithm being tested.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
V. K. Ivanov, B. V. Palyukh, and A. N. Sotnikov, “Efficiency of genetic algorithm for subject search queries,” Lobachevskii J. Math. 12 (3), 244–254 (2016).
J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence (MIT Press, Cambridge, MA, 1992).
S. N. Sivanandam and S. N. Deepa, Introduction to Genetic Algorithms (Springer, Berlin, Heidelberg, New York, 2007).
S. Luke, Essentials of Metaheuristics, 2nd ed. (Lulu, 2013). http://cs.gmu.edu/sean/book/metaheuristics. Accessed 2018.
B. Rafael, M. Affenzeller, and S. Wagner, in Proceedings of the GECCO'12 Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, 2012, pp. 469–476.
A. B. Glushak, V. A. Lomazov, and D. A. Petrosov, “Analysis of modified genetic algorithm based on the theory of schemes,” Nauch. Vedom. BelGU, Mat. Fiz. 27 (248), 121–126 (2016).
P. A. Diaz-Gomez and D. F. Hougen, in Proceedings of the GECCO'09 Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, 2009, pp. 763–770.
L. C. M. de Paula, A. S. Soares, T. W. de Lima, A. R. G. Filho, and C. J. Coelho, in Proceedings of the GECCO'16 Companion of the 2016 onGenetic and Evolutionary Computation Conference Companion, 2016, pp. 1031–1034.
O. A. Melikhova, “Genetic algorithms application for the artificial intellect systems construction,” Izv. SFedU, Inzhen. Nauki 7 (144), 53–58 (2013).
S. Noor, M. I. Lali, and M. S. Nawaz, “Solving job shop scheduling problem with genetic algorithm,” Sci. Int. 27, 3367–3371 (2015).
S. L. Keast, “A simple representation technique to improve GA performance,” Aauburn Univ. Tech. Rep. CSSE03–11 (2003), pp. 1–21. ftp://ftp.eng.auburn.edu/pub/techreports/csse/03/CSSE03-11.pdf. Accessed 2019.
C. R. Cox and R. A. Watson, in Proceedings of the GECCO'14 Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, 2014, pp. 341–348.
L. Sun, X. Cheng, and Y. Liang, “Solving job shop scheduling problem using genetic algorithm with penalty function,” Int. J. Intell. Inform. Process. 1 (2), 65–77 (2010).
Chen Lin, in Proceedings of the 4th International Conference on Genetic and Evolutionary Computing, 2010, pp. 301–304.
A. A. Kazharov and V.M. Kureichik, “Template using for ant colony algorithms,” Izv. SFedU, Inzhen. Nauki 7 (144), 17–22 (2013).
B. Burlacu, M. Kommenda, and M. Affenzeller, in Proceedings of the Asia-Pacific Conference on Computer Aided System Engineering, 2015, pp. 152–157.
D. Rutkowska, M. Pilinski, and L. Rutkowski, Neural Networks, Genetic Algorithms and Fuzzy Systems (PWN, Warsaw, 1997; Hotline-Telekom, Moscow, 2013).
Acknowledgments
The authors express their thanks the colleagues who have been taking part in this study, namely, P. I. Meskin and N. V. Vinogradova as well as to translator of the article O. A. Gumenyuk.
Funding
This work was done at the Tver State Technical University with supporting of the Russian Foundation of Basic Research (project no. 18-07-00358) and at the Joint Supercomputer Center of the Russian Academy of Sciences Branch of NIISI RAS within the framework of the State assignment (research topic 065-2019-0014).
Author information
Authors and Affiliations
Corresponding authors
Additional information
Submitted by A. M. Elizarov
Rights and permissions
About this article
Cite this article
Ivanov, V.K., Palyukh, B.V. & Sotnikov, A.N. Conformance Evaluation of Genetic Algorithm for Evolutionary Area Search of Canonical Model. Lobachevskii J Math 40, 1799–1808 (2019). https://doi.org/10.1134/S1995080219110155
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080219110155