Crop rotation scheduling with adjacency constraints

Crop rotation scheduling with adjacency constraints

0.00 Avg rating0 Votes
Article ID: iaor20119909
Volume: 190
Issue: 1
Start Page Number: 165
End Page Number: 180
Publication Date: Oct 2011
Journal: Annals of Operations Research
Authors: , , ,
Keywords: programming: integer, heuristics
Abstract:

In this article we propose a 0‐1 optimization model to determine a crop rotation schedule for each plot in a cropping area. The rotations have the same duration in all the plots and the crops are selected to maximize plot occupation. The crops may have different production times and planting dates. The problem includes planting constraints for adjacent plots and also for sequences of crops in the rotations. Moreover, cultivating crops for green manuring and fallow periods are scheduled into each plot. As the model has, in general, a great number of constraints and variables, we propose a heuristics based on column generation. To evaluate the performance of the model and the method, computational experiments using real‐world data were performed. The solutions obtained indicate that the method generates good results.

Reviews

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