一种时间依赖路网最小时间路径规划算法研究

摘要

研究时间依赖路网(TDN)的最短路径规划算法,对指导人们出行和解决城市交通等问题具有十分重要的意义.在研究前人算法的基础上,提出了一种利用结构体数组来求解TDN路网最小时间路径规划算法.对算法的基本原理和结构体数组的构造进行了介绍,对算法实现流程及其中一些关键步骤进行了重点阐述,最后在VC++环境中利用MapX控件对算法进行了实验仿真.仿真结果表明,该算法具有较高的搜索效率,且能适应路况变化,基本满足现实需要.%It has great significance of the algorithm about the shortest path planning based on the time-dependent road network ( TDN). Because it can guide people to travel, solve the urban traffic and other issues. This paper proposed a structure array TDN road network to solve the minimum time path planning algorithm on the basis of previous algorithm. Firstly, it introduced the basic principle of the algorithm and the structure of the array. Then it focused on the implementation and some of the key steps of the algorithm. At last, it used MapX to test based on VC + + environment. The experiment results show that it has high search efficiency. It can adapt to the traffic changes and basically meet the needs of people.