MODULAR HYBRID MEMETIC ALGORITHM FOR FINDING A CONDTIONAL GLOBAL EXTREMUM FOR FUNCTIONS OF SEVERAL VARIABLES
This paper presents a hybrid memetic algorithm for finding a conditional global extremum of functions. The algorithm combines such characteristics as modularity and adaptability which provides flexibility and controllability of the algorithm and reduces the influence of parameters. On the basis of t...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Moscow State Technical University of Civil Aviation
2016-12-01
|
| Series: | Научный вестник МГТУ ГА |
| Subjects: | |
| Online Access: | https://avia.mstuca.ru/jour/article/view/853 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper presents a hybrid memetic algorithm for finding a conditional global extremum of functions. The algorithm combines such characteristics as modularity and adaptability which provides flexibility and controllability of the algorithm and reduces the influence of parameters. On the basis of the proposed algorithm the software complex is formed in the C# language. The method effectiveness is demonstrated on several well-known model examples of finding a conditional global extremum for functions of several variables. |
|---|---|
| ISSN: | 2079-0619 2542-0119 |