|
 
|
[PAS13a] A Branch-and-Price Algorithm for Sustainable Crop Rotation Planning
Conférence Internationale avec comité de lecture : EURO-INFORMS - Rome 2013, July 2013, pp.44, Italie,Mots clés: OR in agriculture, Production planning, Integer programming, branch-and-price
Résumé:
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.
Equipe:
oc
Collaboration:
BibTeX
| @inproceedings { | |||
| PAS13a, | |||
| title | = | "{A Branch-and-Price Algorithm for Sustainable Crop Rotation Planning}", | |
| author | = | " A. Plateau and L. ALFANDARI and X. Schepler ", | |
| booktitle | = | "{EURO-INFORMS - Rome 2013}", | |
| year | = | 2013, | |
| month | = | "July", | |
| pages | = | "44", | |
| address | = | " Italie", | |
| } | |||
