李威武,王慧,钱积新. 智能交通系统中路径诱导算法研究进展[J]. 浙江大学学报:工学版,2005,39(6):819-825.Li Wei-wu,Wang Hui,Qian Ji-xin. New trends in route guidance algorithm research of intelligent transportation system[J]. Journal of Zhejiang University (Engineering Science), 2005,39(6):819-825.
[2]
Li Y F,Le J,Danny M,et al. Mapping oversized and overweight truck routes with procedure based on geographic information systems[J]. Transportation Research Record,2012,12(2219):8-16.
[3]
杨兆升. 城市交通流诱导系统理论与模型[M]. 北京:人民交通出版社,2000.
[4]
Xing S H,Shahabi C. Scalable shortest paths browsing on land surface[C]∥GIS:Proceedings of the ACM International Symposium on Advances in Geographic Information Systems,2010:89-98.
[5]
Alba Martínez M A,Cordeau J F,Dell'Amico M, et al. A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks[J]. Informs Journal on Computing,2013,25(1):41-55.
[6]
Sharifzadeh M, Kolahdouzan M, Shahabi C. The optimal sequenced route query[J]. The VLDB Journal,2008,17(4): 765-787.
[7]
Lee K C K, Lee W C, Leong H V. Nearest surrounder queries[C]∥IEEE Transactions on Knowledge and Data Engineering,2010,22(10): 1444-1458.
[8]
Terrovitis M, Bakiras S, Papadias D, et al. Constrained shortest path computation[C]∥Proceeding of the 9th International Symposium on Spatial and Temporal Databases,2005: 181-199.
[9]
Chen H Q,Ku W S,Sun M T,et al. The multi-rule partial sequenced route query[C]∥GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems,2008:65-74.
Montalto F A,Bartrand T A, Waldman A M,et al. Decentralised green infrastructure: The importance of stakeholder behaviour in determining spatial and temporal outcomes[J]. Structure and Infrastructure Engineering,2013,9(12):1187-1205.
[12]
Zhao W,Li Q,Li B. Extracting hierarchical landmarks from urban POI data[J]. Journal of Remote Sensing,2011,15(5): 973-988.
[13]
Raubal M,Winter S. Enriching wayfinding instructions with local landmarks[J]. Geographic Information Science Lecture Notes in Computer Science,2002,2478:243-259.
[14]
范志起. 半结构化数据索引技术的研究[D]. 长春:吉林大学:计算机科学与技术学院,2011.Fan Zhi-qi. Research on the index technology of semi-structured data[D]. Changchun: College of Computer Science and Technology,Jilin University,2011.
[15]
Engebretsen L,Karpinski M. TSP with bounded metrics[J]. Journal of Computer and System Sciences,2006,72(4):509-546.
[16]
于德新,杨兆升,高鹏. 动态限制搜索区域的带约束K则最优路径算法[J]. 吉林大学学报:工学版, 2009,39(增刊2):172-176.Yu De-xin,Yang Zhao-sheng,Gao Peng. Constrained K-shortest paths algorithm within dynamic restricted searching area[J]. Journal of Jilin University (Engineering and Technology Edition),2009,39(Sup.2):172-176.
[17]
郑四发,曹剑东,连小珉. 复杂路网下多客户间最短路径的扇面Dijkstra算法[J]. 清华大学学报:自然科学版,2009,49(11):1834-1837.Zheng Si-fa,Cao Jian-dong,Lian Xiao-min. Sector Dijkstra algorithm for shortest routes between customers in complex road networks[J]. Journal of Tsinghua University, 2009,49(11):1834-1837.
