Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/111638
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Oliveira Florentino, H. de | - |
dc.contributor.author | Pato, M. V. | - |
dc.date.accessioned | 2014-12-03T13:08:51Z | - |
dc.date.accessioned | 2016-10-25T20:09:22Z | - |
dc.date.available | 2014-12-03T13:08:51Z | - |
dc.date.available | 2016-10-25T20:09:22Z | - |
dc.date.issued | 2014-06-01 | - |
dc.identifier | http://dx.doi.org/10.1057/jors.2013.21 | - |
dc.identifier.citation | Journal Of The Operational Research Society. Basingstoke: Palgrave Macmillan Ltd, v. 65, n. 6, p. 842-854, 2014. | - |
dc.identifier.issn | 0160-5682 | - |
dc.identifier.uri | http://hdl.handle.net/11449/111638 | - |
dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/111638 | - |
dc.description.abstract | The selection of sugarcane varieties is an important problem faced by companies in Brazil that exploit sugarcane harvest for energy production. In the light of current concerns regarding the reduction of environmental damage and the efficiency of the production system, research into this problem is called for. In this context the authors begin by outlining the sugarcane variety selection problem in accordance with technical constraints with the purpose of minimizing collection and transport costs and maximizing energy balance obtained from residues of the sugarcane harvest. They then present a previously developed model for the problem within bi-objective binary linear programming and study its computational complexity. Fundamentally, this paper is devoted to the application of a bi-objective genetic heuristic to the question addressed. A computational experiment, performed by resorting to a test set including real and semi-randomly generated instances, is then reported. The results prove the high quality of the heuristic in terms of solution quality, besides computing time. For these reasons, this will be an appropriate tool to help sugarcane company managers to plan their producing activities. | en |
dc.description.sponsorship | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | - |
dc.description.sponsorship | Fundação para o Desenvolvimento da UNESP (FUNDUNESP) | - |
dc.description.sponsorship | PROPG UNESP | - |
dc.description.sponsorship | FCT (Fundacao para a Ciencia e Tecnologia, Portugal) | - |
dc.format.extent | 842-854 | - |
dc.language.iso | eng | - |
dc.publisher | Palgrave Macmillan Ltd | - |
dc.source | Web of Science | - |
dc.subject | agriculture | en |
dc.subject | costing | en |
dc.subject | energy | en |
dc.subject | integer programming | en |
dc.subject | greedy heuristics | en |
dc.subject | bi-objective genetic heuristics | en |
dc.title | A bi-objective genetic approach for the selection of sugarcane varieties to comply with environmental and economic requirements | en |
dc.type | outro | - |
dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
dc.contributor.institution | Univ Tecn Lisboa | - |
dc.contributor.institution | Univ Lisbon | - |
dc.description.affiliation | Univ Estadual Paulista, UNESP, BR-18618000 Botucatu, SP, Brazil | - |
dc.description.affiliation | Univ Tecn Lisboa, ISEG, P-1100 Lisbon, Portugal | - |
dc.description.affiliation | Univ Lisbon, Ctr Invest Operacinal, P-1699 Lisbon, Portugal | - |
dc.description.affiliationUnesp | Univ Estadual Paulista, UNESP, BR-18618000 Botucatu, SP, Brazil | - |
dc.description.sponsorshipId | FAPESP: 09/14901-4 | - |
dc.description.sponsorshipId | FAPESP: 10/07585-6 | - |
dc.description.sponsorshipId | FCT (Fundacao para a Ciencia e Tecnologia, Portugal)POCTI/ISFL/152 | - |
dc.identifier.doi | 10.1057/jors.2013.21 | - |
dc.identifier.wos | WOS:000336834700004 | - |
dc.rights.accessRights | Acesso restrito | - |
dc.relation.ispartof | Journal Of The Operational Research Society | - |
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.