On a graph model for reflectometry issues and some algorithms for their solution. Part 2. An approach to software implementation

Backgrond. 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 work 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.