Probability-based genetic algorithm for solving complex multiobjective optimization tasks using adaptive mutation operator and Pareto set prediction

Cover Page

Cite item

Full Text

Abstract

The article is devoted to a new algorithm for solving complex constrained multiobjective optimization tasks on the basis of probability-based GA. An efficient modification of the algorithm using adaptive mutation and Pareto set prediction is proposed. The results of efficiency investigation are presented.

About the authors

Ye. A. Sopov

Siberian State Aerospace University

Author for correspondence.
Email: es_gt@mail.ru

candidate of technical sciences, associate professor

Russian Federation

S. A. Sopov

Siberian State Aerospace University

Email: sopov_sergey@mail.ru

student

Russian Federation

References

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2019 VESTNIK of Samara University. Aerospace and Mechanical Engineering

License URL: https://journals.ssau.ru/index.php/vestnik/about/editorialPolicies#custom-2

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies