Crop rotation scheduling with adjacency constraints

52Citations
Citations of this article
48Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

dos Santos, L. M. R., Michelon, P., Arenales, M. N., & Santos, R. H. S. (2011). Crop rotation scheduling with adjacency constraints. Annals of Operations Research, 190(1), 165–180. https://doi.org/10.1007/s10479-008-0478-z

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free