Другие журналы

. A B C D E F G H I J K L M N O P R S T U V W Y Z К М С Т


Publication list: http://elibrary.ru/author_items.asp?authorid=699520
Principles of constructing a scalable Web-oriented system for estimating the Pareto-approximation quality in solving the multicriteria optimization problem
Engineering Bulletin # 09, September 2017
УДК: 519.6
Quite often in real situations, the quality of operation of the object or system being examined is not estimated by a single criterion or quality measure, but by a set of such criteria that are equally significant. Tasks of this type relate to, and are an important stage in the design and evaluation of the design object. There are a large number of methods that allow to solve the multicriterion optimization (MCE) problem. A relatively new and progressive class of MCE methods are methods that presuppose the preliminary construction of some finite-dimensional approximation of a set of solutions called Pareto-approximation. At present, there are quite a few Pareto-approximation methods, which raises the question of a comparative evaluation of the effectiveness of these methods. As shown in the previous works of the authors, many software systems implementing these algorithms do not provide fast access and do not have an easy-to-use interface for calculations and analysis. In this paper, the development of a service-oriented system for the performance and evaluation of the Pareto-approximation quality is considered. The main purpose of this system is to provide fast and convenient access to Pareto-approximation solution and evaluation algorithms, without attachment to a particular operating system or application.
WEB-oriented system of Pareto-approximation quality estimation in problems of multi-purpose optimization
Engineering Bulletin # 08, August 2017
УДК: 519.6
When solving practical, primarily, technical optimization tasks, the tasks of multi-objective optimization (MCHO-tasks) often arise, when it is desirable to exaggerate not one but several objective functions. It is well known that since, as a rule, it is impossible to achieve the extreme value of all objective functions simultaneously, the solution of such a problem is a certain compromise belonging to the Pareto set of the problem, that is, to a set of solutions that are not simultaneously improved for all objective functions. By the solution of the MCE-problem, we call the Pareto set of this problem, assuming that, after constructing some finite-dimensional approximation of the given set (P-approximation), the person making the decision (LPR), using informal or formalized methods, selects the unique solution from it. WEB-oriented software system PARETO-Q is designed for remote evaluation of Pareto-approximation quality in multi-purpose optimization problems. The system is designed to solve the problem of consolidation of Pareto-approximation algorithms and algorithms for estimating the quality of approximation. We represent the software used by the system, the architecture of the system, some results of computational experiments.

Engineering Bulletin # 10, October 2014
УДК: 004.7

Engineering Bulletin # 12, December 2014
УДК: 519.6
Estimate the Pareto-Approximation Quality in the Problem of Multi-Criteria Optimization. A Review of Programme Systems.
Engineering Education # 04, April 2014
DOI: 10.7463/0414.0709198
The paper makes a statement of the multi-criteria optimization problem, gives a brief review of techniques to solve it using its Pareto-approximation, and presents mainly known approximation quality indicators. Principally, the paper gives a review of known programme systems orientated to the Pareto-approximation problem solution, which implement various algorithms to estimate the quality of this approximation.
elibrary crossref ulrichsweb neicon rusycon

About Project
Rambler's Top100
Phone: +7 (915) 336-07-65 (строго: среда; пятница c 11-00 до 17-00)
© 2003-2024 «Наука и образование»
Перепечатка материалов журнала без согласования с редакцией запрещена
 Phone: +7 (915) 336-07-65 (строго: среда; пятница c 11-00 до 17-00)