Author:
Barkalov Sergei,Kurochka Pavel,Nasonova Tatiana
Abstract
The article deals with the placement of service facilities and infrastructure. The most typical statements of problems are given. It is shown that the greatest difficulty is the simultaneous consideration of budget constraints and restrictions on the relative location of objects. It is shown that the application of the method of dynamic programming, in many ways can solve these problems. A heuristic algorithm for solving the problem is proposed. The issue of determining the rational number of objects intended for placement is considered. In this case, the problem reduces to determining the matching of maximum power. A heuristic algorithm is proposed that allows you to determine the required number of objects to be placed.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献