中图分类号：
U492
{{custom_clc.code}}
({{custom_clc.text}})
{{custom_sec.title}}
{{custom_sec.title}}
{{custom_sec.content}}
参考文献
[1] Papadimitriou C H, Yannakakis M. Shortest paths without a map[J]. Theoretical Computer Science, 1991, 84(1):127-150.
[2] Bar-Noy A, Schieber B. The Canadian traveler problem[C]//Proceedings of the Second annual ACM-SIAM Symposium on Discrete Algorithms, 1991:261-270.
[3] 尚华艳, 黄海军, 高自友. 可变信息标志诱导下的路径选择行为[J]. 系统工程理论与实践, 2009, 29(7):166-172.Shang H Y, Huang H J, Gao Z Y. Route choice behavior under guidance of variable message signs[J]. Systems Engineering——Theory & Practice, 2009, 29(7):166-172.
[4] Sleator D, Tarjan R. Amortized efficiency of list update and paging rules[J]. Communications of the ACM, 1985, 28(2):202-208.
[5] Borodin A, El-Yaniv R. Online computation and competitive analysis[M]. Cambridge University Press, Cambridge, 1998.
[6] Fiat A, Rabani Y, Ravid Y. Competitive k-server algorithms[C]//Proceedings of the 22nd IEEE Symposium on Foundation of Computer Science, 1998:454-463.
[7] Fiat A, Woeginger G J. Online algorithms:The state of art[J]. Springer, Berlin, 1998.
[8] Xu Y, Hu M, Su B, et al. The Canadian traveller problem and its competitive analysis[J]. Journal of Combinatorial Optimization, 2009, 182.
[9] Hu M. Comparison Strategy and its competitive ratio analysis of scheduling for on-line routing[J]. Journal of Ningxia University, 2005, 26(3):207-210.
[10] Westphal S. A note on the k-Canadian traveler problem[J]. Information Processing Letters, 2008, 106(3):87-89.
[11] Zhu Z, Xu Y, Liu C. Scheduling for on-line routing problem and its competitive strategy analysis[J]. Journal of System Engineering, 2003, 18(4):261-270.
[12] Zhang H, Xu Y, Qin L. The k-Canadian travelers problem with communication[J]. Journal of Combinatorial Optimization, 2013, 26:251-265.
[13] 徐寅峰, 张惠丽, 余海燕, 等. 基于方格路网的两车应急救援路径在线选择[J]. 系统工程理论与实践, 2013, 33(1):175-180.Xu Y F, Zhang H L, Yu H Y, et al. Online routing of two vehicles to an emergency scene in grid transportation network[J]. Systems Engineering——Theory & Practice, 2013, 33(1):175-180.
[14] 苏兵, 徐寅峰. 堵塞恢复时间随机的加拿大旅行者问题[J]. 系统工程理论与实践, 2005, 25(10):108-113.Su B, Xu Y F. Online Canadian traveler problem with stochastic blockages recovery time[J]. Systems Engineering——Theory & Practice, 2005, 25(10):108-113.
[15] 苏兵, 兰小毅. 有限预知信息的可恢复加大旅行者问题[J]. 系统工程, 2009, 27(9):102-107.Su B, Lan X Y. The recoverable Canadian traveller problem based on limited provision information[J]. Systems Engineering, 2009, 27(9):102-107.
[16] 马丽娟, 徐寅峰, 苏兵, 等. 一条路上的占线可恢复加拿大旅行者问题混合策略[J]. 系统工程理论方法应用, 2005, 14(4):318-321.Ma L J, Xu Y F, Su B, et al. The mixed strategy research on online recoverable Canadian traveler problem on one road[J]. Systems Engineering——Theory Methodology Applications, 2005, 14(4):318-321.
[17] 崔晓. 突发性片堵塞下的实时路径选择策略研究[D]. 西安:西安工业大学, 2012.
{{custom_fnGroup.title_cn}}
脚注
{{custom_fn.content}}
基金
国家社会科学基金（13BGL156）；陕西高校人文社会科学青年英才支持计划（2014037）；陕西省科技厅项目（2015KRM142）
{{custom_fund}}
PDF(737 KB)
