Set covering problem in transport nets expanding models

Abstract

The article deals with the problem of optimal coverage of utility centres in transport network. We can often encounter similar types of tasks in a real life. A lot of cases relate to the public utility systems that mean systems intended for providing basic public services to all population in a certain territory. These services can include services of Integrated Rescue System. The tasks of this category are called max D tiling tasks in a scientific literature. The classic version of max D cover task is known for quite a long time but its shape does not always cover real traffic conditions. The aim of the article is to show other modifications of the basic variation of the tasks. The authors expect the proposed application will enable mathematical apparatus to be used to solve problems of this type to the greater extent.