Research on agricultural machinery operation path optimization based on traveling salesman problem (TSP)

Abstract

Based on the characteristics and properties of TSP, a new heuristic algorithm is designed. Firstly, the nodes on the graph are divided into regions, and then the minimum spanning tree is found in the region. Then, the nodes larger than 2 are broken and reconnected into trees with 2 degrees except the start and end points. Finally, the start and end points of adjacent regions are connected to get the solution of the problem. Two examples show that this heuristic algorithm can effectively avoid the round trip of several points between different regions. The algorithm is applied to the optimization of agricultural machinery operation path, which provides a reference for the daily operation of agricultural machinery households.