Research on Multi-service Demand Path Planning Based on Continuous Hopfield Neural Network

In this paper, we focus on multi-vehicle and multiple types of dynamic vehicle routing problems. The introduction of dynamic traveling salesman problem (TSP) is to consider user’s needs in many aspects. This paper uses the Hopfield neural network for solving the vehicle routing problem of “advanced request” to shorten the delivery path length and reduce the logistics cost. For “immediate request,” we build the analytic hierarchy process model to analyze the final delivery order under a number of factors; use multi-type corresponds to multi-vehicles mixed queuing system model to obtain service indicators of the system, so as to improve the system efficiency compared with the single-delivery vehicle system. The combination of AHP and the Hopfield neural network algorithm is superior to the application of BP neural network classification and the Hopfield neural network.