Multiobjective Optimization at Evolutionary Search with Binary Choice Relations

A multiobjective optimization problem is considered, in which binary choice relations are used instead of optimized functions. To solve this problem, it is proposed to use an evolutionary random search algorithm, in which the function of choice in the form of a lock is used instead of the choice fun...

Full description

Saved in:
Bibliographic Details
Published in:Cybernetics and systems analysis 2020-05, Vol.56 (3), p.449-454
Main Authors: Irodov, V. F., Barsuk, R. V., Chornomorets, H. Ya
Format: Article
Language:English
Subjects:
Algorithms
Analysis
Artificial Intelligence
Control
Convergence
Evolutionary algorithms
Genetic algorithms
Mathematics
Mathematics and Statistics
Multiple objective analysis
Optimization
Processor Architectures
Search algorithms
Searches and seizures
Software Engineering/Programming and Operating Systems
Systems Theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A multiobjective optimization problem is considered, in which binary choice relations are used instead of optimized functions. To solve this problem, it is proposed to use an evolutionary random search algorithm, in which the function of choice in the form of a lock is used instead of the choice function in the form of a preference,. The convergence of the proposed evolutionary algorithms is analyzed, and sufficient conditions for convergence are formulated. The results of the proposed evolutionary search are compared with the results of well-known evolutionary algorithms for one test problem.
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-020-00260-7