Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints
-
Víctor M. Albornoz [1] ; Gabriel E. Zamora [1]
-
[1] Universidad Técnica Federico Santa María
Universidad Técnica Federico Santa María
Valparaíso, Chile
-
- Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 29, Nº. 1, 2021, págs. 248-265
- Idioma: inglés
- Enlaces
-
Resumen
This paper tackles management zone delineation and crop planning problems in an integrated precision agriculture framework. The zoning problem defines relatively homogeneous management zones regarding their soil properties, and for which specific rates of agricultural inputs are necessary. From a sustainable point of view, the crop planning problem considers cropping of species from different botanic families in adjacent zones at the same time. With this in mind, we propose a novel linear binary integer program for an integrated zoning and crop planning problem with adjacency constraints. In this model, we maximize the incomes of the crop plan subject to zoning constraints and adjacency constraints on crop families. The proposed model has a column-based formulation, and as such, we develop a decomposition-based heuristic which make use of the column generation method with column-dependent rows. The decomposition strategy involves a master problem that deals with ensuring homogeneity of the selected management zones within the field partition and ensuring that the crop plan meets adjacency policies. On the other hand, the pricing problem generates rectangular management zones whose incorporation improves the objective value of the master problem. The algorithm is implemented in JuMP, a modeling language for mathematical optimization embedded in Julia. Results from a set of instances show the relevance of the decomposition-based heuristic.
