Skip to Main content Skip to Navigation
Journal articles

A branch-and-price-and-cut approach for sustainable crop rotation planning

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 considerable 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 formulation based on crop-sequence graphs. An extended formulation is then provided with a polynomial-time pricing problem, and a Branch-and-Price-and-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.
Document type :
Journal articles
Complete list of metadata
Contributor : Xavier Schepler Connect in order to contact the contributor
Submitted on : Thursday, November 5, 2015 - 4:15:28 PM
Last modification on : Friday, August 5, 2022 - 2:54:00 PM

Links full text




Xavier Schepler, Laurent Alfandari, Agnès Plateau. A branch-and-price-and-cut approach for sustainable crop rotation planning. European Journal of Operational Research, Elsevier, 2015, 241, pp.872-879. ⟨10.1016/j.ejor.2014.09.066⟩. ⟨emse-01225167⟩



Record views