1Shen Z, Dessouky M, Ordonez F. Stochastic vehicle routing problem for large-scale emergencies[R]. Department of Industrial and Systems Engineering, University of Southern California, 2005.
2Lin Y H, Batta R, Rogerson P A, et al. A logistics model for emergency supply of critical items in the aftermath of a disaster[J]. Socio-Economic Planning Sciences, 2001, 45(4): 132-145.
3Beamon B M. Humanitarian relief chains: Issues and challenges[C]//34th International Conference on Computers and Industrial Engineering, San Francisco, 2004.http://faculty.washington.edu/benita/sfpaper.pdf.
4Campbell A, Vanderbussche D, Hermann W. Routing for relief efforts[J]. Transportation Science, 2008, 42(2): 127-145.
5Ausiello G, Feuerstein E, Leonardi S, et al. Algorithms for the on-line traveling salesman1 [J]. Algorithmica, 2001, 29(4): 560-581.
6Allulli L, Ausiello G, Bonifaci V, et al. On the power of lookahead in on-line server routing problems[J]. Theo- retical Computer Science, 2008, 408(2): 116-128.
7Blom M, Krumke S, De Paepe W, et al. The online TSP against fair adversaries[J]. INFORMS Journal on Computing, 2001, 13(2): 138-148.
8Jaillet P, Wagner M. Online routing problems: Value of advanced information as improved competitive ratios[J]. Transportation Science, 2006, 40(2): 200-210.
9Jaillet P, Wagner M. Generalized online routing: New competitive ratios, resource augmentation and asymptotic analysis[J]. Operations Research, 2008, 56(3): 745-757.
10Sleator D D, Tarjan R E. Amortized efficiency of list update and paging rules[J]. Communication of the ACM, 1985, 28(2): 202-208.
