V.A. Pismennaya - Post-graduate Student, Moscow Aviation Institute (National Research University). E-mail: wildangel9@yandex.ru

In the given work the modification of hybrid memetic algorithm is proposed. The main feature of the developed modification is path relinking procedure. The developed algorithm can be used for the synthesis of the optimal program control of nonlinear dynamic objects. Memetic algorithms (MA) are dynamically developing field of evolutionary computations. Nowadays MA are widely used to show a de-signation of evolutionary or other population based approach and individual learning or other local improvement procedure for the function global extremum determination. Currently in math a lot of attention paid to solving global optimization problems. The solution of these problems is necessary in the design of aircraft structures when there is a need to optimize the characteristic parameters (weight range, the aerodynamic characte-ristics) and to develop a control system of individual structural elements and the object as a whole. Using of existing numerical methods is associated with a number of difficulties: large computational load, the requirements for the task, difficulties in achieving convergence of the method. In view of this suggest a need to develop and use the so-called heuristics. These methods are not rigorous justification of convergence, but in most cases they allow to obtain an acceptable solution to the problem. The developed algorithm consists of several procedures: initial population generation, pool formation, pool fill, path relinking technology (this technology allows to get additional point from the chosen perspective ones), local improvement, pool renewal, memory list renewal. The best point from the memory list, assumed to be the result of the hybrid memetic algorithm. The proposed algorithm was implemented in a software program. IDE - Microsoft Visual Studio, programming language - C#. In the given work the algorithm and the software of hybrid memetic algorithm for the solution of problems of global constrained op-timization and of synthesis of optimal program control of discrete and continuous determined dynamic systems were created. Also the solution of the satellite stabilization problem and the comparison of the results of the developed algorithm and local variation method are given.

 

1. Dawkins S.R. The selfish gene. Oxford: Oxford University Press. 1976.
2. Moscato P. On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms // Caltech Concurrent Computation Program (report 826). 1989.
3. Panteleev A.V., Bortakovskijj A.S. Teorija upravlenija v primerakh i zadachakh. M.: Vysshaja shkola. 2003.
4. Gendreau M., Potvin J.-Y. Handbook of Metaheuristics. New York: Springer. 2010.
5. Krylov I.A. CHislennoe reshenie zadachi ob optimalnojj stabilizacii sputnika // ZHurnal vychislitelnojj matematiki i matematicheskojj fiziki. T. 8. № 1. 1968. S. 203-208.