K-Pointer-Network for Express Delivery Routes Planning

Abstract

In this study, the author intends to provide a suitable design for the express distribution path to shorten delivery times. If the route is not well-planned, the delivery time for an express shuttle between cities will be extremely long. The primary purpose of this experimental research is to combine K-means and pointer network optimization to examine the ability of pointer networks in express route planning, improve pointer network performance in the TSP challenge, and obtain a shorter express route planning. The improved K-Pointer-Network is compared to the regular pointer network in this study. According to model theory and experimental data, it can be demonstrated that clustering data samples independently improves computational performance and planning results in many cases, and that when the model is confronted with a large number of test inputs, the K-Pointer-Network outperforms the traditional pointer network and provides relatively good express route planning.