The Research on Optimum Route Algorithm in Non-Euclidean Distance Space
The measuring space of city streets traffic on consuming time is an non-Euclidean distance space. From the condition of city traffic condition, an optimum route algorithm based on non-Euclidean time distance space was designed. For the turn consuming time on the streets intersection being the major section of the route using time, the virtual nodes were defined according to the azimuths of leaving the streets intersection. Considered the consuming time passing through street sections and streets intersections, the algorithm was completed by calculating the accumulated time from the start point to the virtual node. The algorithm was a decision-making course with some phases and realized by recursive methods. Finally, the feasibility was proved through an example.
国家科技期刊平台
NSTL
万方数据
维普
