Research on Vehicle Routing Planning of Urban Express Delivery

With the rapid development of e-commerce, online shopping has quickly occupied the market with its inherent convenience, superiority and low price. More and more people choose online shopping. (online shopping is bound to enter people's life more and more deeply in the future. With its convenience, quickness and low price, it will become an important choice for people to shop.) On weekdays, express collection points are piled up with packages, not to mention the “double 11” and “double 12” shopping carnival. At present, the vast majority of urban express delivery is that the couriers start from the regional distribution site and store a large number of express at the collection point such as rookie post station or Fengchao express cabinet at one time (which saves a lot of delivery time). In this way, the couriers only need to master the shortest path from the regional distribution site to the collection point. This paper analyzes and discusses the principle and steps of dijskstra algorithm, the shortest path algorithm. Then, based on the algorithm and the actual traffic situation, an improved algorithm is proposed, which mainly considers the following three factors: considering the road traffic congestion and taking the driving time as the weight; Consider the existence of single line in the actual road network; Consider the existence of speed limit in real road sections. The above three aspects are considered in the improved algorithm. The optimal path planned by the improved algorithm in this paper is close to the reality and has great application value.