A Branch-and-Price Algorithm for Sustainable Crop Rotation Planning - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

A Branch-and-Price Algorithm for Sustainable Crop Rotation Planning

Laurent Alfandari
Xavier Schepler
  • Function : Author

Abstract

We deal with the agricultural problem of planning crops over a given time horizon and given land plots to meet the farmer?s needs over time. The MSCRP (Minimum-Space Crop Rotation Planning) focuses on building rotations that minimize the total area needed to meet demand. We show that the MSCRP problem is NP-hard and give a 0-1 linear formulation. We use Dantzig-Wolfe decomposition and column gen- eration. Finally, we study a branching scheme for solving the master problem by branch-and-price. Computational experiments show the efficiency of our approach on randomly generated instances.
No file

Dates and versions

hal-01126530 , version 1 (06-03-2015)

Identifiers

  • HAL Id : hal-01126530 , version 1

Cite

Agnès Plateau, Laurent Alfandari, Xavier Schepler. A Branch-and-Price Algorithm for Sustainable Crop Rotation Planning. EURO-INFORMS - Rome 2013, Jul 2013, X, Italy. pp.44. ⟨hal-01126530⟩
102 View
0 Download

Share

Gmail Facebook X LinkedIn More