UDC 519.87
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.
Keywords: land use problem, hypergraph, fragmentary structure, combinatorial optimization, evolutionary algorithm, ant colony algorithm.
FULL TEXT
REFERENCES
- Maksishko N.K., Perepelitsa V.A., Zakhovalko T.V. Theoretical-graph ecological-economic model of the land use problem. Visn. V. Dahl East Ukrainian National University. 2002. N 2 (48). P. 92–100.
- Maksishko N.K., Zakhovalko T.V. Models and methods for solving applied problems of coverage on graphs and hypergraphs [in Ukrainian]. Zaporizhya: Polygraph, 2009. 244 p.
- Perepelitsa V.A., Sergienko I.V. Investigation of a class of integer multicriteria problems. Zh. Vychisl. mat. and mat. phys. 1988. 28(3). P. 63–75.
- Sergienko I.V. Mathematical models and methods for solving discrete optimization problems [in Russian]. Kiev: Nauk. dumka, 1988. 472 p.
- Zakhovalko T.V., Maksishko N.K., Perepelitsa V.A. Modeling the problem of land use on hypergraphs. System. doslіdzh. ta inform. technologii. 2006. N 3. P. 99–109.
- Emelichev V.A., Melnikov O.I., Sarvanov V.I., Tyshkevich R.I. Lectures on graph theory [in Russian]. Moscow: Nauka, 1990. 384 p.
- Kozin I.V., Maksyshko N.K., Perepelitsa V.A. Fragmentary structures in discrete optimization problems. Cybernetics and Systems Analysis. 2017. Vol. 53, N 6. P. 931–936. https://doi.org/10.1007/s10559-017-9995-6.
- Dorigo М. Optimization, learning, and natural algorithms. PhD Thesis, Dipartimento di Elettronica, Politechnico Di Milano, 1992. 140 p.
- Shtovba S.D. Ant algorithms: theory and application. Programmirovanie. 2005. N 4. P. 1–16.
