logo
calendar13 Noyabr 2019
view38
Main language:Russian

Analysis of features of genetic algorithms

Field of Science:
pdf

5dcbe4f2eb05d.pdf

PDF

ARTICLE ANNOTATION

quote
Currently there is no universal method of optimization, which would allow to solve any problem and uniquely identified as the best among the other methods on the accuracy of the solution. Unlike traditional methods, multivariable optimization, many of which are often characterized by a sharp increase in computational cost as the number of variable parameters, genetic algorithms are well established in large-scale problems. The paper deals with features of genetic algorithms and discusses the problem of modern optimization methods. It is shown that optimization by simulation methods allows to achieve significantly better performance than analytical methods. Describes a modified version of the genetic algorithm to solve problems of multiextremal optimization. Algorithm is tested on the test tasks. The proposed algorithm will be applied researchers in solving applied multiextremal problems where the computation of the objective function requires large computational resources.

AUTHORS

D.Muxamedieva

Toshkent axborot texnologiyalari universiteti

Tags

# оператор# мутация# mutation# селекция# генетический алгоритм# скрещивание# многоэкстремальная оптимизация# genetic algorithm# operator selection# crossover# multiextremal optimization# gеnеtik algoritm# opеrator# sеlеksiya# chatishtirish# mutatsiya# ko’p ekstrеmal optimizatsiya

OTHER ARTICLES IN THIS JOURNAL

Rate Article

0
0 ratings
5
4
3
2
1

Article Identifiers

References

Загоруйко Н.Г. Самообучающийся генетический алгоритм для прогнозирования // Искусственный интеллект и экспертные системы. – 1997. – Вып. 160. – С. 80-95.

Louis S.J., Xu Z. Genetic Algorithms for Open Shop Scheduling and ReScheduling // ISC A 11th International Conference on Computers and their Applications. –1996. – Pр. 99-102.

Davidor Y.A. Genetic Algorithm Applied to Robot Trajectory Generation // Handbook of genetic algorithms. – New York, 1991. – Pр. 144-165.

Zalzala A.M.S., Fleming P.S. Genetic Algorithms: Principles and Applications in Engineering Systems // Neural Network. – 1996. – Vol. 6, № 5. – Pр. 803-820.

Ono O., Kobayashi В., Kato H. Optimal Dynamic Motion Planning of Autonomous Vehicles by a Structured Genetic Algorithm // Proc. of the 13th World Congress of IFAC. – San-Francisco, 1996. – Vol. Q. – Pр. 435-440.

Forrest S., Mayer-Kress G. Genetic Algorithms, Nonlinear Dynamical Systems and Models of International Security // Parallel Problem Solving from Nature 4. – 1996.

Cobb H.G. An Investigation into the Use of Hypermutation as an Adaptive Operator in the Genetic Algorithm Having Continuous Time-Dependent Nonsationary Environments. Naval Research Laboratory Memorandum Report 6760. – 1990.

Vavak F., Fogarty T.C., Jukes K. A Genetic Algorithm with Variable Range of Local Search for Tracking Changing Environments // Parallel Problem Solving from Nature 4. – 1996.

Ярушкина Н.Г. Основы теории нечетких и гибридных систем. Учебное пособие. – М.: Финансы и статистика, 2004.

Zadeh L.A. Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic // Fuzzy sets and systems. – Vol.90. – 1997. - № 2.

Fanabashi M., Maeda A., Morooka Y., Mori K. Fuzzy and Neural Hybrid Systems: Synergetic AI // IEEE Expert. 1995 August. – Рp. 32-40.

Кушербаева В.Т. Некоторые тестовые функции для глобальной оптимизации. – СПб.: СПбГУ, 2007.

Herrera F., Lozano M. Adaptation of genetic algorithm parameters based on fuzzy logic controllers. In: F. Herrera, J. L. Verdegay (eds.) Genetic Algorithms and Soft Computing, Physica-Verlag, Heidelberg, 1996. – Рp. 95-124.

Емельянов В.В., Курейчик В.В., Курейчик В.М. Теория и практика эволюционного моделирования. – М.: Физматлит, 2003.

Голубин А.В., Тарасов В.Б. Нечеткие генетические алгоритмы // Международные научно-технические конференции AIS’05 и CAD-2005. Труды конференций. – М.: Физматлит, 2005. – С. 39-45.

Kalyanmoy D., Dhiraj J., Ashish A. Real-Coded Evolutionary Algorithms with Parent-Centric Recombination. Indian Institute of Technology, Kanpur. KanGAL Report No 2001003.

Lozano M., Herrera F., Krasnogor N., Molina D. Real-Coded Memetic Algorithms with Crossover Hill-Climbing. Evolutionary Computation 12(3), 2004. – Рp. 273-302.

Herrera F., Lozano M., Sanchez A.M. A Taxonomy for the Crossover Operator for Real-Coded Genetic Algorithms: An Experimental Study // International Journal of Intelligent Systems, vol. 18, 2003. – Рp. 309-338.

Herrera F., Lozano M. Fuzzy Adaptive Genetic Algorithms: design, taxonomy, and future directions // Soft Computing 7(2003), Springer-Verlag, 2003. – Рp. 545-562.

Galantucci L.M., Percoco G., Spina R. Assembly and Disassembly Planning by using Fuzzy Logic & Genetic Algorithms. // International Journal of Advanced Robotic Systems, Vol. 1, № 2, 2004. – Рp. 67-74.

Holland J.H. Adaptation in Natural and Artificial Systems // Univ.of Michigan Press, Ann Arbor. 1975.

Ramsey C.L., Grefenstette J.J. Case-based Initialization of Genetic Algorithms // 5th Int. Conf. on Genetic Algorithm. - 1993. – Pр. 84-91

Szpiro G.G. Forecasting Chaotic Time Series with Genetic Algorithms // Physical Review E. 1997. - V.55, N3. - Pр. 2557-2568.

Alvarez A. Forecasting the SST Space-Time Variability of the Alboran Sea with Genetic Algorithms // Geophysical Research Letters. - 2000.

Рутковская Д., Пилинский М., Рутковский Л. Нейронные сети, генетические алгоритмы и нечеткие системы. – М.: Горячая линия - Телеком, 2004. – 452 с.

Gen M., Cheng R. Genetic algoritms and engineering design. – John Wiley&Sons, 1997. – 352 p.