Simplified road network KSP optimization algorithm

The invention belongs to the field of traffic network planning and traffic path analysis, and particularly relates to a simplified road network KSP optimization algorithm. The method includes dividingthe network nodes into branch nodes, intermediate nodes and true nodes, wherein the road network without the branch nodes and the intermediate nodes is called as a simplified road network; and road network multi-path calculation only needs to calculate a plurality of paths among the true nodes on the simplified road network. Wherein the branch points are defined as follows: the number of non-branch points of adjacent nodes in the road network is not greater than 1, the intermediate node is defined as a node of which the number of adjacent non-branch points in the road network is 2, and the true node is defined as a node of not only a non-branch point but also a non-intermediate node. The algorithm provided by the invention can satisfy calculation and storage of multi-path calculation results, and the universality