Article ID: | iaor2014495 |
Volume: | 65 |
Issue: | 6 |
Start Page Number: | 842 |
End Page Number: | 854 |
Publication Date: | Jun 2014 |
Journal: | Journal of the Operational Research Society |
Authors: | de Oliveira Florentino H, Pato M V |
Keywords: | programming: multiple criteria, heuristics: genetic algorithms |
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.