ESSEC Working Papers,
ESSEC Research Center, ESSEC Business School

Abstract: In this paper, we study a multi-periodic production planning problem in agriculture. This problem belongs to the class of crop rotation planning problems, which have received increased attention in the literature in recent years. Crop cultivation and fallow periods must be scheduled on land plots over a given time horizon so as to minimize the total surface area of land used, while satisfying crop demands every period. This problem is proven strongly NP-hard. We propose a 0-1 linear programming compact formulation based on crop-sequence graphs. An extended formulation is then provided with a polynomial-time pricing problem, and a Branch-and-Priceand- Cut (BPC) algorithm is presented with adapted branching rules and cutting planes. The numerical experiments on instances varying the number of crops, periods and plots show the effectiveness of the BPC for the extended formulation compared to solving the compact formulation, even though these two formulations have the same linear relaxation bound.

Keywords: OR in agriculture; crop rotations; production planning; column generation; branch-and-price-and-cut

JEL-codes: Q10

22 pages, April 2014

Full text files

WP1408.pdf  

Download statistics

• ESSEC Research Center, ESSEC Business School
• Home page for this series

Questions (including download problems) about the papers in this series should be directed to Sophie Magnanou ()
Report other problems with accessing this service to Sune Karlsson ().

RePEc:ebg:essewp:dr-14008This page generated on 2024-10-19 15:41:33.