FIRELY OPTIMIZATION METHOD FOR SOLVING COMBINATORIAL LOGIC PROB- LEMS ON GRAPHS
Vladimir V. Kureichik, Victoria V. Bova, Vladimir V. Kureichik · ITNOU Information technologies in education science and management · 2021
The article describes the solution of NP-complex combinatorial-logical problems on graphs. The authors pro-pose to use a bioinspired approach based on a modified firefly optimization method. As a modification of the proposed approach, the work introduces procedures for dynamically changing the search area, which allows avoiding local optima. A series of tests and experiments have shown that this method is promising. The time complexity of the developed algorithm in the best case ≈ O(nlogn), in the worst case - О(n2).