You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/73380
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFilho, Angelo Aliano-
dc.contributor.authorDe Oliveira Florentino, Helenice-
dc.contributor.authorPato, Margarida Vaz-
dc.date.accessioned2014-05-27T11:26:51Z-
dc.date.accessioned2016-10-25T18:37:23Z-
dc.date.available2014-05-27T11:26:51Z-
dc.date.available2016-10-25T18:37:23Z-
dc.date.issued2012-06-13-
dc.identifier.citationICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems, p. 454-457.-
dc.identifier.urihttp://hdl.handle.net/11449/73380-
dc.identifier.urihttp://acervodigital.unesp.br/handle/11449/73380-
dc.description.abstractIn the last few years, crop rotation has gained attention due to its economic, environmental and social importance which explains why it can be highly beneficial for farmers. This paper presents a mathematical model for the Crop Rotation Problem (CRP) that was adapted from literature for this highly complex combinatorial problem. The CRP is devised to find a vegetable planting program that takes into account green fertilization restrictions, the set-aside period, planting restrictions for neighboring lots and for crop sequencing, demand constraints, while, at the same time, maximizing the profitability of the planted area. The main aim of this study is to develop a genetic algorithm and test it in a real context. The genetic algorithm involves a constructive heuristic to build the initial population and the operators of crossover, mutation, migration and elitism. The computational experiment was performed for a medium dimension real planting area with 16 lots, considering 29 crops of 10 different botanical families and a two-year planting rotation. Results showed that the algorithm determined feasible solutions in a reasonable computational time, thus proving its efficacy for dealing with this practical application.en
dc.format.extent454-457-
dc.language.isoeng-
dc.sourceScopus-
dc.subjectCrop rotation-
dc.subjectGenetic algorithm-
dc.subjectOptimization-
dc.subjectComplex combinatorial problem-
dc.subjectComputational experiment-
dc.subjectComputational time-
dc.subjectConstructive heuristic-
dc.subjectCrop sequencing-
dc.subjectFeasible solution-
dc.subjectInitial population-
dc.subjectPlanted areas-
dc.subjectCrops-
dc.subjectMathematical models-
dc.subjectProfitability-
dc.subjectGenetic algorithms-
dc.titleA genetic algorithm for crop rotationen
dc.typeoutro-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.contributor.institutionISEG - UTL-
dc.description.affiliationCurso de Biometria Departamento de Bioestatística IB, UNESP, 18618-970, Botucatu, SP-
dc.description.affiliationDepartamento de Bioestatística IB, UNESP, 18618-970, Botucatu, SP-
dc.description.affiliationCIO-FCUL ISEG - UTL, 1200-781 Lisboa-
dc.description.affiliationUnespCurso de Biometria Departamento de Bioestatística IB, UNESP, 18618-970, Botucatu, SP-
dc.description.affiliationUnespDepartamento de Bioestatística IB, UNESP, 18618-970, Botucatu, SP-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems-
dc.identifier.scopus2-s2.0-84861987917-
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.