article

Metaheuristics for a crop rotation problem

Abstract

This paper presents a mathematical model adapted from literature for the crop rotation problem with demand constraints (CRP-D). The main aim of the present work is to study metaheuristics and their performance in a real context. The proposed algorithms for solution of the CRP-D are a genetic algorithm, a simulated annealing and hybrid approaches: a genetic algorithm with simulated annealing and a genetic algorithm with local search algorithm. A new constructive heuristic was also developed to provide initial solutions for the metaheuristics. Computational experiments were performed using a real planting area and semi-randomly generated instances created by varying the number, positions and dimensions of the lots. The computational results showed that these algorithms determined good feasible solutions in a short computing time as compared with the time spent to get optimal solutions, thus proving their efficacy for dealing with this practical application of the CRP-D.

References

  1. Aliano, A.F. (2012) Metaheurísticas em um Problema de Rotação de Culturas, March, Master's thesis, Universidade Estadual Paulista.Google ScholarGoogle Scholar
  2. Altieri, M.A. (2002) Agroecologia: Bases Científicas para uma Agricultura Sustentável, Agropecuária, Guaíba, Brazil.Google ScholarGoogle Scholar
  3. Clarke, H.R. (1989) 'Combinatorial aspects of cropping pattern selection in agriculture', European Journal of Operational Research, Vol. 40, pp.70-77.Google ScholarGoogle ScholarCross RefCross Ref
  4. Detlefsen, N. and Jensen, A.L. (2007) 'Modelling optimal crop sequences using network flows', Agricultural Systems, Vol. 94, No. 5, pp.566-572.Google ScholarGoogle Scholar
  5. El-Nazer, T. and McCarl, B.A. (1986) 'The choice of crop rotation: a modeling approach and case study', American Journal of Agricultural Economics, Vol. 68, No. 1, pp.127-136.Google ScholarGoogle ScholarCross RefCross Ref
  6. Florentino, H.O.S. and Pato, M.V. (2012) 'A biobjective genetic approach for the selection of sugarcane varieties to comply with environmental and economic requirements', Annals of Operations Research, Vol. 12, No. 5, pp.1-24.Google ScholarGoogle Scholar
  7. Gliessman, S.R. (2000) Agroecologia: Processos Ecológicos em Agricultura Sustentável, Universidade Federal do Rio Grande do Sul, Brazil, Porto Alegre.Google ScholarGoogle Scholar
  8. Goldberg, D.E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, USA. Google ScholarGoogle Scholar
  9. Gomez, T., Hernandez, M., Molina, J., Leon, M.A., Aldana, E. and Caballero, R. (2011) 'A multiobjective model for forest planning with adjacency constraints', Annals of Operations Research, Vol. 190, pp.75-92.Google ScholarGoogle ScholarCross RefCross Ref
  10. Holland, J.H. (1975) Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor. Google ScholarGoogle Scholar
  11. Kirkpatrick, S., Gellat, D.C. and Vecchi, M.P. (1983) 'Optimization by simulated annealing', Science, Vol. 220, No. 4598, pp.671-680.Google ScholarGoogle Scholar
  12. Lemalade, J.L., Nagih, A. and Plateau, G. (2011) 'A MIP flow model for crop rotation planning in a context of forest sustainable development', Annals of Operations Research, Vol. 190, pp.149-164.Google ScholarGoogle Scholar
  13. Miller, R.E. and Thatcher, J.W. (1972) 'Complexity of computer computations', Plenum, pp.85-103, New York.Google ScholarGoogle Scholar
  14. Reeves, C.R. (1993) Modern Heuristic Techniques for Combinatorial Problems, Backwell Scientific Publications, Oxford. Google ScholarGoogle Scholar
  15. Salassi, M.E., Deliberto, M.A. and Guidry, K.M. (2012) 'Economically optimal crop sequences using risk-adjusted network flows: modeling cotton crop rotations in the Southeastern United States', Agricultural Systems, Vol. 118, pp.33-40.Google ScholarGoogle Scholar
  16. Santos, L.M.R., Costa, A.M., Arenales, M.N. and Santos, R.H.S. (2010) 'Sustainable vegetable crop supply problem', European Journal of Operational Research, Vol. 204, pp.639-647.Google ScholarGoogle ScholarCross RefCross Ref
  17. Santos, L.M.R., Michelon, P.R.H., Arenales, M.N. and Santos, R.H.S. (2011) 'Crop rotation scheduling with adjacency constraint', Annals of Operations Research, Vol. 190, pp.165-180.Google ScholarGoogle ScholarCross RefCross Ref
  18. Santos, R.H.S. (2005) Olericultura Orgânica, chapter Olericultura: teoria e prática, pp.249-276, Universidade Federal de Viçosa, Viçosa.Google ScholarGoogle Scholar
  19. Siegel, S. and Castellan Jr., N.J. (1988) Nonparametric Statistics for the Behavioral Sciences, 2nd ed., McGraw-Hill, New York.Google ScholarGoogle Scholar
  20. Souza, J.L. and Resende, P.L. (2006) Manual de Horticultura Orgânica, Aprenda Fácil, Viçosa.Google ScholarGoogle Scholar
  21. Talbi, E.G. (2002) 'A taxonomy of hybrid metaheuristics', Journal of Heuristics, Vol. 8, pp.541-564. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. The Math Works Inc. (1991) MATLAB for Windows User's Guide, New York.Google ScholarGoogle Scholar

Index Terms

(auto-classified)
  1. Metaheuristics for a crop rotation problem

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!