On a graph model for reflectometry problems and some algorithms for their solution. Part 3. An approach to test data generation and some results of computational experiments
Background. The relevance of the subject area under consideration is primarily due to the need to minimize the cost of so-called reflectometers, with the existing restriction on the condition of total monitoring of fiber-optic cables. Similar tasks arise when designing and / or upgrading a commun...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penza State University Publishing House
2022-12-01
|
| Series: | Известия высших учебных заведений. Поволжский регион: Физико-математические науки |
| Subjects: |
| _version_ | 1797866475645566976 |
|---|---|
| author | B.F. Mel'nikov Yu.Yu. Terent'eva |
| author_facet | B.F. Mel'nikov Yu.Yu. Terent'eva |
| author_sort | B.F. Mel'nikov |
| collection | DOAJ |
| description | Background. The relevance of the subject area under consideration is primarily
due to the need to minimize the cost of so-called reflectometers, with the existing restriction
on the condition of total monitoring of fiber-optic cables. Similar tasks arise when
designing and / or upgrading a communication network, and they are especially important
in situations where the communication network has a very large dimension. The purpose of
the study is to investigate the possibility of using the method of branches and boundaries in
some similar formulations of the problem of reflectometry. Materials and methods. The paper
uses heuristic algorithms of artificial intelligence and discrete optimization, combined
into a single software package, as well as statistical methods for analyzing algorithms. Results.
The results are regularities obtained by applying the greedy heuristics and the version
of the method of branches and boundaries in solving problems of reflectometry. Conclusions.
Algorithms have been proposed describing the improvement of the branch and
boundary method by connecting various auxiliary heuristics to it. However, the obtained
temporary improvement in the average operating time of this algorithm in the applied problem
we have considered, compared to the greedy algorithm, is very small, and this allows
us to draw preliminary conclusions that the use of the simplest greedy algorithms is sufficient
in reflectometry problems. |
| first_indexed | 2024-04-09T23:24:46Z |
| format | Article |
| id | doaj.art-0c124a6d0e424f0885bd535fbc3bb504 |
| institution | Directory Open Access Journal |
| issn | 2072-3040 |
| language | English |
| last_indexed | 2024-04-09T23:24:46Z |
| publishDate | 2022-12-01 |
| publisher | Penza State University Publishing House |
| record_format | Article |
| series | Известия высших учебных заведений. Поволжский регион: Физико-математические науки |
| spelling | doaj.art-0c124a6d0e424f0885bd535fbc3bb5042023-03-21T10:37:29ZengPenza State University Publishing HouseИзвестия высших учебных заведений. Поволжский регион: Физико-математические науки2072-30402022-12-01410.21685/2072-3040-2022-4-3On a graph model for reflectometry problems and some algorithms for their solution. Part 3. An approach to test data generation and some results of computational experimentsB.F. Mel'nikov0Yu.Yu. Terent'eva1Centre of Information Technologies and Systems for Executive AuthoritiesCentre of Information Technologies and Systems for Executive AuthoritiesBackground. The relevance of the subject area under consideration is primarily due to the need to minimize the cost of so-called reflectometers, with the existing restriction on the condition of total monitoring of fiber-optic cables. Similar tasks arise when designing and / or upgrading a communication network, and they are especially important in situations where the communication network has a very large dimension. The purpose of the study is to investigate the possibility of using the method of branches and boundaries in some similar formulations of the problem of reflectometry. Materials and methods. The paper uses heuristic algorithms of artificial intelligence and discrete optimization, combined into a single software package, as well as statistical methods for analyzing algorithms. Results. The results are regularities obtained by applying the greedy heuristics and the version of the method of branches and boundaries in solving problems of reflectometry. Conclusions. Algorithms have been proposed describing the improvement of the branch and boundary method by connecting various auxiliary heuristics to it. However, the obtained temporary improvement in the average operating time of this algorithm in the applied problem we have considered, compared to the greedy algorithm, is very small, and this allows us to draw preliminary conclusions that the use of the simplest greedy algorithms is sufficient in reflectometry problems.heuristic algorithmsdiscrete optimization problemsgraph theory modelsgreedy algorithmmethod of branches and boundaries |
| spellingShingle | B.F. Mel'nikov Yu.Yu. Terent'eva On a graph model for reflectometry problems and some algorithms for their solution. Part 3. An approach to test data generation and some results of computational experiments Известия высших учебных заведений. Поволжский регион: Физико-математические науки heuristic algorithms discrete optimization problems graph theory models greedy algorithm method of branches and boundaries |
| title | On a graph model for reflectometry problems and some algorithms for their solution. Part 3. An approach to test data generation and some results of computational experiments |
| title_full | On a graph model for reflectometry problems and some algorithms for their solution. Part 3. An approach to test data generation and some results of computational experiments |
| title_fullStr | On a graph model for reflectometry problems and some algorithms for their solution. Part 3. An approach to test data generation and some results of computational experiments |
| title_full_unstemmed | On a graph model for reflectometry problems and some algorithms for their solution. Part 3. An approach to test data generation and some results of computational experiments |
| title_short | On a graph model for reflectometry problems and some algorithms for their solution. Part 3. An approach to test data generation and some results of computational experiments |
| title_sort | on a graph model for reflectometry problems and some algorithms for their solution part 3 an approach to test data generation and some results of computational experiments |
| topic | heuristic algorithms discrete optimization problems graph theory models greedy algorithm method of branches and boundaries |
| work_keys_str_mv | AT bfmelnikov onagraphmodelforreflectometryproblemsandsomealgorithmsfortheirsolutionpart3anapproachtotestdatagenerationandsomeresultsofcomputationalexperiments AT yuyuterenteva onagraphmodelforreflectometryproblemsandsomealgorithmsfortheirsolutionpart3anapproachtotestdatagenerationandsomeresultsofcomputationalexperiments |