Multicriteria Optimization Problem on Prefractal Graph

Rasul Kochkarov
Additional contact information
Rasul Kochkarov: Department of Data Analysis and Machine Learning, Faculty of Information Technology and Big Data Analysis, Financial University under the Government of the Russian Federation, Leningradsky Prospekt 49/2, Moscow 125167, Russia

Mathematics, 2022, vol. 10, issue 6, 1-17

Abstract: Even among single-criteria discrete problems, there are NP-hard ones. Multicriteria problems on graphs in many cases become intractable. Currently, priority is given to the study of applied multicriteria problems with specific criteria; there is no classification of criteria according to their type and content. There are few studies with fuzzy criteria, both weight and topological. Little attention is paid to the stability of solutions, and this is necessary when modeling real processes due to their dynamism. It is also necessary to study the behavior of solution sets for various general and individual problems. The theory of multicriteria optimization is a rather young branch of science and requires the development of not only particular methods, but also the construction of a methodological basis. This is also true in terms of discrete graph-theoretic optimization. In this paper, we propose to get acquainted with multicriteria problems for a special class of prefractal graphs. Modeling natural objects or processes using graphs often involves weighting edges with many numbers. The author proposes a general formulation of a multicriteria problem on a multi-weighted prefractal graph; defines three sets of alternatives—Pareto, complete and lexicographic; and proposes a classification of individual problems according to the set of feasible solutions. As an example, we consider an individual problem of placing a multiple center with two types of weight criteria and two types of topological ones. An algorithm with estimates of all criteria of the problem is proposed.

Keywords: multicriteria problem; prefractal graph; set of alternatives; algorithm with estimates (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/6/930/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/6/930/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:6:p:930-:d:770878

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().