A Fragmented Model for the Problem of Land Use on Hypergraphs

Abstract

The paper considers a mathematical model of the land use problem on hypergraphs. It is shown that, within the framework of this model, the problem can be formulated as an optimization problem on a fragmented structure. Moreover, the problem of finding the optimal solution itself reduces to the problem of unconditional combinatorial optimization on a set of permutations. A variant of a hybrid algorithm for finding approximate solutions to the problem based on a combination of a fragmented algorithm and an ant colony algorithm is proposed.