Crop rotation scheduling with adjacency constraints

  • dos Santos L
  • Michelon P
  • Arenales M
 et al. 
  • 16


    Mendeley users who have this article in their library.
  • 17


    Citations of this article.


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.

Author-supplied keywords

  • Column generation
  • Crop rotation
  • Integer linear programming

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Lana Mara Rodrigues dos Santos

  • Philippe Michelon

  • Marcos Nereu Arenales

  • Ricardo Henrique Silva Santos

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free