In view of the shortest path problem of the common traffic road, the standard rectangular network concept is proposed, the properties of the shortest path between nodes are analyzed, and a novel shortest path algorithm based on the standard rectangular network(SRNSP) is presented. By using the geometric properties of the standard rectangular network, the search direction and step judgment are simplified. Meanwhile, it is pointed out that some or even all of the common traffic road networks can be converted into standard rectangular networks. Compared with the common Dijkstra, Floyd, ACO and A* algorithms for solving the shortest path problem, the experiment results show that the proposed algorithm has better optimization accuracy, stability and searching speed for the large-scale standard rectangular road network.