A MIP flow model for crop-rotation planning in a context of forest sustainable development

Annals of Operations Research (Impact Factor: 1.1). 01/2011; 190(1):149-164. DOI: 10.1007/s10479-009-0553-0
Source: DBLP

ABSTRACT We propose a Mixed-Integer Linear Programming model for a class of multi-period crop rotation optimization problems with demand
constraints and incompatibility constraints between cultivation and fallow state on a land plot. This model is applied to
a case study on Madagascan farms in the scope of a sustainable development campain against deforestation, where the objective
is to better control agricultural space while covering seasonal needs of farmer. We propose an efficient upper bound computation
and study the variation of the minimum number of plots and total space needed in function of the unitary surface area of a
plot. Numerical results associated with the Madagascan case are reported.

KeywordsCrop rotation planning–Linear programming–Sustainable development

  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a multiobjective model for crop planning in agriculture. The approach is based on portfolio theory. The model takes into account weather risks, market risks and environmental risks. Input data include historical land productivity data for various crops, soil types and yield response to fertilizer/pesticide application. Several environmental levels for the application of fertilizers/pesticides, and the monetary penalties for overcoming these levels, are also considered. Starting from the multiobjective model we formulate several single objective optimization problems: the minimum environmental risk problem, the maximum expected return problem and the minimum financial risk problem. We prove that the minimum environmental risk problem is equivalent to a mixed integer problem with a linear objective function. Two numerical results for the minimum environmental risk problem are presented.
    Annals of Operations Research 08/2014; 219(1):243-264. DOI:10.1007/s10479-011-0902-7 · 1.10 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    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.
    European Journal of Operational Research 01/2015; 241:872-879. DOI:10.1016/j.ejor.2014.09.066 · 1.84 Impact Factor
  • SSRN Electronic Journal 01/2014; DOI:10.2139/ssrn.2433594