Алгоритми розв’язання задачі оптимального розміщення пунктів спостережень мережі моніторингу стану атмосферного повітря

Abstract

Feasibility of using greedy algorithm to solve the problem of optimal allocation of observation network monitoring of air, which in comparison with the methods of evolutionary search, provides faster finding close to optimal or optimal solution. Develops two algorithms for solving this problem, based on different ways of combining greedy algorithm with the method of exhaustive search, thus improving the accuracy of solutions obtained by the classical greedy algorithm.