Solving the Crop Allocation Problem  using Hard and Soft Constraints

Solving the Crop Allocation Problem using Hard and Soft Constraints

0.00 Avg rating0 Votes
Article ID: iaor20132630
Volume: 47
Issue: 2
Start Page Number: 151
End Page Number: 172
Publication Date: Apr 2013
Journal: RAIRO - Operations Research
Authors: , , , , ,
Keywords: allocation: resources
Abstract:

Application tools for the crop allocation problem (CAP) are required for agricultural advisors to design more efficient farming systems. Despite the extensive treatment of this issue by agronomists in the past, few methods tackle the crop allocation problem considering both the spatial and the temporal aspects of the CAP. In this paper, we precisely propose an original formulation addressing the crop allocation planning problem while taking farmers’ management choices into account. These choices are naturally represented by hard and soft constraints in the Weighted CSP formalism. We illustrate our proposition by solving a medium–size virtual farm using either a WCSP solver (toulbar2) or an ILP solver (NumberJack/SCIP). This preliminary work foreshadows the development of a decision–aid tool for supporting farmers in their crop allocation strategies.

Reviews

Required fields are marked *. Your email address will not be published.