Open AccessOn the problem of version selection to create a graph for the ant colony optimization algorithm
Author(s) -
Михаил Сарамуд,
И В Ковалев,
В. В. Лосев,
Д. И. Ковалев,
М. В. Карасева
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1399/3/033123
Subject(s) - ant colony optimization algorithms , computer science , graph , software , software package , algorithm , theoretical computer science , mathematical optimization , mathematics , programming language
The article considers various graph creation methods for presenting the structure of a multiversion software package in solving its optimization problem by the ant colony optimization algorithm. The paper presents a method for calculating the weights of arcs for a static version of the graph and the reliability characteristics of the software package, taking into account its architecture. The version of creating a dynamic version of the graph is considered. A comparative analysis of these versions is conducted. The conclusions about the preferred application of the static version of the graph are made.