[1] Ausiello G, Feuerstein E, Leonardi S, Stougie L, Talamo M. Algorithms for the on-line travelling salesman[J]. Algorithmica, 2001, 29(4): 560-581. [2] Ausiello G, Bonifaci V, Laura L. The online prize-collecting traveling salesman problem[J]. Information Processing Letters, 2008, 107(6): 199-204. [3] Jaillet P, Lu X. Online traveling salesman problems with service flexibility[J]. Networks, 2011, 58(2): 137-146. [4] Jaillet P, Lu X. Online traveling salesman problems with rejection options[J]. Networks, 2014, 64(2): 84-95. [5] Jaillet P, Wagner M R. Online routing problems: value of advanced information as improved competitive ratios[J]. Transportation Science, 2006, 40(2): 200-210. [6] Allulli L, Ausiello G, Bonifaci V, et al. On the power of lookahead in on-line server routing problems[J]. Theoretical Computer Science, 2008, 408(2-3): 116-128. [7] 温新刚,徐寅峰,丁黎黎.基于预知信息的占线Nomadic TSP问题[J].系统工程理论与实践,2013,33(11):2845-2851. [8] 马军平,徐寅峰,温新刚,张惠丽. 带有预知信息的在线Homing ATSP问题[J].系统工程理论与实践,2015,35(2):381-387. [9] 吴腾宇,徐寅峰,温新刚.预知信息和有限运载能力下应急车辆路径选择问题[J].系统工程理论与实践,2015,35(5):1224-1229. [10] 马军平,徐寅峰,吴腾宇.转向限制网络中基于预知时间的快递车辆在线揽件路径选择研究[J].系统工程理论与实践,2017,37(9):2394-2402. [11] Wen X, Xu Y, Zhang H. Online traveling salesman problem with deadline and service flexibility[J]. Journal of Combinatorial Optimization, 2015, 30(3): 545-562. [12] 廉文琪,徐寅峰.基于预知信息和实时服务选择的在线TSP问题[J].系统工程理论与实践,2016,36(1):86-93. |