Método para otimização de rotas na agricultura

Abstract

This paper presents a method that seeks to minimize the distance traveled during maneuvers at the headland and thus spending on fuel and soil compaction. It resembles the problem capacitive vehicle routing problem, which is based on the traveling salesman problem, classified as a NP-Hard problem due to their complexity and number of possible solutions, this complexity that the problem treated here is also classified. Due to this it is used the metaheuristic Particle Swarm Optimization being subsidiary in the search of the solution by the Metaheuristics of Ant Colony Optimization, in addition it is used in some cases the strategy to realize the permutation of individuals in order to realize local improvement. To be a matter of great relevance, there are many studies already carried out, which enabled the comparison of the proposed method with another study previously and of fundamental importance in the theme. This comparison showed the viability of the proposed method besides showing the possibility of being used for fields of various sizes and implements that already use current technology or older implements.