In road network matching, matching efficiency is extremely low when using the ergodic matching method that searches matching objects in the entire road network. To improve matching efficiency, a hierarchical and iterative matching method based on road classification is proposed. Firstly, roads are classified based on topology and divided into a matching hierarchy and un-matching hierarchy according to the road type. The number of roads in the matching hierarchy is few; secondly, only roads in the matching hierarchy are matched, avoiding a search for a matching object from the entire road network; thirdly, the remaining unmatched roads are regarded as a new road network so these steps can be repeated. In this way, matching is completed when iteration ends. An ergodic check of the roads that do not have matching objects is done in order to improve matching accuracy. Tests and comparitive analysis indicate that this method can avoid ergodic matching and reduces disturbance caused by roads from the different hierarchies, effictively improving both efficiency and accuracy.