网络上指定起点与终点集的路径规划问题

A Path Planning Problem for Specified Starting Point and Ending Point Set on the Network

摘要: 路径规划在很多领域都有应用，特别是物流管理方面。本文以网购过程中的物流配送为背景，以找出配送过程中的最短路为目的。考虑从一个仓库发货到有多个分拨中心的地区中的某一个的情况，将这样的问题看做网络上指定起点与终点集的路径规划问题。并运用Dijkstra算法设计出一个最优算法来解决这样的问题，为这样的问题提供求解新思路。

Abstract: Path planning has been applied in many fields, especially in logistics management. This paper takes logistics distribution in the process of online shopping as the background, the aim is to find a shortest path in the process of distribution. Considering the case of shipping from a warehouse to one of the districts with multiple distribution centers, such a problem is considered as the path planning problem of the specified starting point and ending point set on the network. And using Dijkstra algorithm to design a optimal algorithm to solve such a problem, it provides a new way to solve such problems.