V.A. Pismennaya - Post-graduate Student, Moscow Aviation Institute (National Research University). E-mail: wildangel9@yandex.ru A.V. Panteleev - Supervisor, Dr. Sc. (Phys.-Math.), Professor, Head of Department 805, Moscow Aviation Institute (National Research University)

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 and synthesis of optimal control for dynamic systems. These problems arise in design of aircraft structures, when it is necessary to optimize the characteristic parameters (such as weight, flight distance, aerodynamic characteristics), and in control systems development for both separate elements of structure 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 software of memetic algorithm for solving optimization problems and synthesis optimal program control for discrete and continuous deterministic dynamical systems were created, furthermore, the reorientation of a rigid spacecraft problem was solved.

 

1. Dawkins S.R.TheselfishgeneOxford: OxfordUniversityPress. 1976. 224 p.
2. Moscato P.OnEvolution, Search, Optimization, GeneticAlgorithmsandMartialArts: TowardsMemeticAlgorithms // CaltechConcurrentComputationProgram (report 826). 1989.
3. Panteleev A.V., Bortakovskijj A.S. Teorija upravlenija v primerakh i zadachakh. M.: Vysshaja shkola. 2003. 583 s.
4. Gendreau M., Potvin J.Y.HandbookofMetaheuristics. NewYork: Springer. 2010. 648 p.
5. Panteleev A.V., Metlickaja D.V., Aleshina E.A. Metody globalnojj optimizacii. Metaehvristicheskie strategii i algoritmy. M.: Vuzovskaja kniga. 2013. 244 c.
6. Bilimoria K.D., Wie B.Time-optimalthree-axisreorientationofarigidspacecraft // JournalofGuidance, ControlandDynamics. 1993. V. 16. № 3. P. 446−452.