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 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal-essec.archives-ouvertes.fr/hal-00987708
Contributor : Michel Demoura <>
Submitted on : Tuesday, May 6, 2014 - 4:34:49 PM
Last modification on : Saturday, February 9, 2019 - 1:23:20 AM
Long-term archiving on : Monday, April 10, 2017 - 7:47:17 PM

File

WP1408.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00987708, version 1

Citation

Laurent Alfandari, Agnès Plateau, Xavier Schepler. A Branch-and-Price-and-Cut approach for Sustainable Crop Rotation Planning. 2014. ⟨hal-00987708⟩

Share

Metrics

Record views

444

Files downloads

558