摘要：AbstractThis paper presents an approach to optimal routing with resource assignment for traveling among scattered farm fields. To this end, a road network among farm fields is created, which has data on shortest paths of all pairs of fields and its distances. Two types of multiple traveling salesman problem (mTSP) formulations solved by an exact algorithm are presented to perform optimal routing. The proposed approach is demonstrated through a numerical experiment using data from an agricultural corporation considered in this paper. The results show features of the mTSP formulations and the proposed approach can yield the optimal routes within 2.4 seconds. Hence the proposed approach is feasible for use in actual daily work.
