Volume 47, Number 2, April-June 2013Constraint Programming
|Page(s)||151 - 172|
|Published online||18 April 2013|
Solving the Crop Allocation Problem using Hard and Soft Constraints∗
INRA, UR 875 Biométrie et Intelligence Artificielle,
email@example.com, firstname.lastname@example.org, email@example.com, firstname.lastname@example.org
2 GREYC-CNRS, UMR 6072, Université de Caen, 14032 Caen
3 INRA, UR 980 SAD-Paysage, 35042 Rennes
Received: 28 January 2013
Accepted: 11 February 2013
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.
Mathematics Subject Classification: 90C11 / 90C27 / 90C90
Key words: Weighted constraint satisfaction problem / integer linear programming / crop allocation problem
© EDP Sciences, ROADEF, SMAI, 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.