The report presents a model of binary linear programming, designed to find the optimal division of the territory states into administrative-territorial units (ATE), limited by certain balancing criteria. Requirement connectivity of the territory of each ATE is the main computational bottleneck and therefore does not allow efficient use similar models for states with a vast territory and many settlements. The model is very well developed. scales and finds the division of the territory of the state into connected administrative-territorial units, using heuristics, based on the search for the shortest paths between the center of each ATE and all settlements located in this ATE. This model was successfully applied to obtain optimal scenarios administrative-territorial division of the Republic of Moldova, that fully comply with the requirements of the law and provide a reasonable compromise between all balancing criteria.

0-1 linear programming, administrative-territorial division

Buzatu Radu Valerievich,  Moldovan State University