中文摘要：

在大数据背景下，以时间集聚图的形式，将路网上的路段阻抗按时间切片依次表示，这样简化了时空网络，并在此基础上构建了基于出发时刻的带有时间窗的动态最短路模型。同时提出了可行路段及可行路径的概念，并设计改进的倒序标号法，改进的算法能简化搜索过程，快速地找出符合时间窗要求的最佳出发时刻及对应的最短路径。最后通过一个算例验证了模型及算法的有效性与合理性。

英文摘要：

Under the background of Big Data, the link impedance of road network is represented by time slice successively in the form of Time-Aggregated Graphs, which simplifies the spatio-temporal network, and the dynamic shortest path model based on the departure time with time window is constructed. At the same time, the concepts of feasible links and feasible paths are put forward, and the improved reverse labeling algorithm is designed. The improved algorithm can simplify the search process, and quickly find the optimal departure time and the corresponding shortest path which meets the requirement of the time window. The model and algorithm is tested with a simple network and the result shows the proposed model and algorithm is effective and reasonable.