Route optimization in mechanized sugarcane harvesting

被引:41
作者
Santoro, E. [1 ]
Soler, E. M. [2 ]
Cherri, A. C. [2 ]
机构
[1] Univ Estadual Paulista, UNESP, Fac Engn, Av Engn Luiz Edmundo C Coube 14-01, BR-17033360 Bauru, SP, Brazil
[2] Univ Estadual Paulista, UNESP, Fac Ciencias, Av Engn Luiz Edmundo C Coube 14-01, BR-17033360 Bauru, SP, Brazil
基金
巴西圣保罗研究基金会;
关键词
Sugarcane; Mechanization; Mathematical model; Harvest route; Harvesting machine; RURAL POSTMAN PROBLEM;
D O I
10.1016/j.compag.2017.07.013
中图分类号
S [农业科学];
学科分类号
09 ;
摘要
Sugarcane cultivation is important for the economy of many countries, particularly for Brazil. This plant has been used to produce sugar, ethanol, second generation ethanol, fertilizers, as well as bioelectricity. Due to production growth and the establishment of mechanized sugarcane harvesting, this process needs to be optimized. High costs are linked to mechanized harvesting, which affect the total cost of production. One of the costs of harvesting is related to the long time the sugarcane harvesting machine takes to change the crop row to be cut. To help reduce costs, this work proposes a mathematical model to the Route Planning Problem for Mechanized Harvesting. This mathematical model minimizes the time of maneuvering the harvesting machine and, consequently, reduces fuel and labor costs, among others. Computer tests were performed using data supplied by a company from the sugarcane energy sector located in the state of Sao Paulo, Brazil. The results were compared to the traditional routes used by the company and proved the efficiency of the mathematical model in supplying solutions that minimize the time of harvesting machine maneuvers. Not only are there economic benefits, but also environmental ones that can be obtained. (C)2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:140 / 146
页数:7
相关论文
共 22 条
[1]  
[Anonymous], 2019, COMP NAC AB AC SAFR
[2]   The directed profitable location Rural Postman Problem [J].
Arbib, Claudio ;
Servilio, Mara ;
Archetti, Claudia ;
Speranza, M. Grazia .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 236 (03) :811-819
[3]   An ILP-refined tabu search for the Directed Profitable Rural Postman Problem [J].
Archetti, C. ;
Guastaroba, G. ;
Speranza, M. G. .
DISCRETE APPLIED MATHEMATICS, 2014, 163 :3-16
[4]  
Benedini S.M., 2008, REV COPLANA, V23, P23
[5]   Route planning for orchard operations [J].
Bochtis, D. ;
Griepentrog, H. W. ;
Vougioukas, S. ;
Busato, P. ;
Berruto, R. ;
Zhou, K. .
COMPUTERS AND ELECTRONICS IN AGRICULTURE, 2015, 113 :51-60
[6]  
Colin E.C., 1999, PRODUCAO, V9, P23
[7]   Route planning for agricultural tasks: A general approach for fleets of autonomous vehicles in site-specific herbicide applications [J].
Conesa-Munoz, Jesus ;
Maria Bengochea-Guevara, Jose ;
Andujar, Dionisio ;
Ribeiro, Angela .
COMPUTERS AND ELECTRONICS IN AGRICULTURE, 2016, 127 :204-220
[8]   A comparison of two different formulations for arc routing problems on mixed graphs [J].
Corberan, Angel ;
Mota, Enrique ;
Sanchis, Jose M. .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) :3384-3402
[9]  
Deere J., 2017, CH670 COLHEDORA CANA
[10]   ARC ROUTING-PROBLEMS .2. THE RURAL POSTMAN PROBLEM [J].
EISELT, HA ;
GENDREAU, M ;
LAPORTE, G .
OPERATIONS RESEARCH, 1995, 43 (03) :399-414