The Use of Parallel Genetic Algorithms to Solve the Problems of Spatial Allocation of Resources

Spatial allocation of resources problems are extremely common in various areas of modern knowledge. Numerous algorithms have been developed to try to resolve the specific variants of these problems.This paper presents a parallel genetic algorithm model that allows for efficient islet, according to specified criteria, the allocation of resources for the large-scale problems of complexity. The effectiveness of the proposed algorithm was tested for the problem the allocation of mobile phone base stations. The Presents results of simulations during which the effect of the choice of the standard genetic operators and control parameters of the algorithm on the quality of obtained solutions. Also proposed several different methods of determining the fitness function for the modified form of the problem under consideration.