Abstract

For agricultural products and fast-moving consumer goods companies, the realities of too many retail terminals and limited human resources are the main problems faced by market visit tasks. Therefore, planning multiple paths for the sales man to obtain higher commercial value is a concern of the company. In this paper, for reducing the scale of data calculations, the large dataset is divided into several small datasets by meshing method, and then the path planning operation is conducted in the divided small datasets. Two path planning methods are proposed in this paper, Point’s distance-first path traversal method (PDF) and Point’s value-first path recursive method (PVF). Experiments show that algorithm PDF gives the distribution of points in the path is more intensive and the overall length of the path is shorter. And algorithm PVF gives the distribution of points in the path is more dispersed and the total value is higher.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call