Experimental study of modified evolutionary algorithm
Main Article Content
Abstract
The influence of different combinations of genetic operators on a quality of solution of optimization problems using a hybrid evolutionary algorithm is analyzed. The results of the research over a set of test problems including multiextremal and multiobjective optimization problems are presented
Article Details

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
References
Y. Kalnibolotsky, O. Khrustava, and A. Karev, “Modifications of genetic operators in evolutionary algorithms”, Electronics and communications, vol. 38, no. 3, pp. 68–81, 2007.
Y. Kalnibolotskiy and O. Khrustava, “Modifications of genetic algorithms”, Electronics and communications, vol. 46, no. 5, pp. 54–61, 2008.
O. Khrustava, “Rule base for selection of combination of genetic operators for hybrid evolutionary algorithm”, in International scientific conference "Intellectual analysis of information IAI-2009", Kyiv, 2009, pp. 401–408.
K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II”, IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, Apr. 2002. DOI:10.1109/4235.996017
Y. Wang and C. Dang, “An Evolutionary Algorithm for Global Optimization Based on Level-Set Evolution and Latin Squares”, IEEE Transactions on Evolutionary Computation, vol. 11, no. 5, pp. 579–595, Oct. 2007. DOI:10.1109/TEVC.2006.886802
J. Brest, S. Greiner, B. Boskovic, M. Mernik, and V. Zumer, “Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems”, IEEE Transactions on Evolutionary Computation, vol. 10, no. 6, pp. 646–657, Dec. 2006. DOI:10.1109/TEVC.2006.872133
F. di Pierro, S.-T. Khu, and D. A. Savi, “An Investigation on Preference Order Ranking Scheme for Multiobjective Evolutionary Optimization”, IEEE Transactions on Evolutionary Computation, vol. 11, no. 1, pp. 17–45, Feb. 2007. DOI:10.1109/TEVC.2006.876362
J. Hadley, Nonlinear and dynamic programming, Moscow: Mir, 1967, p. 506.
D. Himmelblau, Applied nonlinear programming, Moscow: Mir, 1975, p. 536.
D. Rutkovskaya, M. Pilinsky, and L. Rutkovsky, Neural networks, genetic algorithms and fuzzy systems, Moscow: Goryachaya Liniya - Telecom, 2004, p. 452.
S. Kazarlis, S. Papadakis, J. Theocharis, and V. Petridis, “Microgenetic algorithms as generalized hill-climbing operators for GA optimization”, IEEE Transactions on Evolutionary Computation, vol. 5, no. 3, pp. 204–217, Jun. 2001. DOI:10.1109/4235.930311
H. Ishibuchi, T. Yoshida, and T. Murata, “Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling”, IEEE Transactions on Evolutionary Computation, vol. 7, no. 2, pp. 204–223, Apr. 2003. DOI:10.1109/TEVC.2003.810752
S. Tomioka, S. Nisiyama, and T. Enoto, “Nonlinear Least Square Regression by Adaptive Domain Method With Multiple Genetic Algorithms”, IEEE Transactions on Evolutionary Computation, vol. 11, no. 1, pp. 1–16, Feb. 2007. DOI:10.1109/TEVC.2006.876363
S. Khaikin, Neural networks: a complete course, Moscow: Williams Publishing House, 2006, p. 1104.



