Online traveling salesman problems with service flexibility

Networks

Volumn 58, Issue 2, 2011, Pages 137-146

  Jaillet, Patrick ^a   Lu, Xin ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

online algorithms; prize collecting; traveling salesman

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; FIRST LOOK; LOOK-AHEAD; METRIC SPACES; OFF-LINE PROBLEMS; OFFLINE; ON-LINE ALGORITHMS; ON-LINE FASHION; ONLINE STRATEGY; ONLINE VERSIONS; OPTIMAL COMPETITIVE RATIOS; OPTIMALITY; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; PRIZE-COLLECTING; REAL LINE; REOPTIMIZATION; SERVICE FLEXIBILITY; THEORETICAL MODELS; TRAVELING SALESMAN;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY; TOPOLOGY;

TRAVELING SALESMAN PROBLEM;

EID: 80052090329     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20454     Document Type: Conference Paper

References (23)

1. S. Albers, Competitive online algorithms, OPTIMA: Math Program Soc Newslett 54 (1997), 1-8.
2. L. Allulli, G. Ausiello, and, L. Laura, On the power of lookahead in on-line vehicle routing problems, Theor Comput Sci 408 (2008), 116-128.
3. E. Angelelli, M. Savelsbergh, and, M. Speranza, Competitive analysis for dynamic multi-period uncapacitated routing problems, Networks 49 (2007), 308-317. (Pubitemid 47324737)
4. E. Angelelli, M. Savelsbergh, and, M. Speranza, Competitive analysis of a dispatch policy for a dynamic multi-period routing problem, Oper Res Lett 35 (2007), 713-721. (Pubitemid 47483982)
5. N. Ascheuer, S. Krumke, and, J. Rambau, "Online dial-a-ride problems: Minimizing the completion time", Proc 17th Int Symp Theor Asp Comput Sci, Lecture Notes in Computer Science, Vol. 1770, 2000, pp. 639-650.
6. G. Ausiello, V. Bonifaci, and, L. Laura, The on-line prize-collecting traveling salesman problem, Inf Process Lett 107 (2008), 199-204.
7. G. Ausiello, M. Demange, L. Laura, and, V. Paschos, Algorithms for the on-line quota traveling salesman problem, Inf Process Lett 92 (2004), 89-94.
8. G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and, M. Talamo, Algorithms for the on-line travelling salesman, Algorithmica 29 (2001), 560-581. (Pubitemid 33710623)
9. R. Bent, and, P. Van Hentenryck, Scenario based planning for partially dynamic vehicle routing problems with stochastic customers, Oper Res 52 (2004), 977-987. (Pubitemid 40122356)
10. M. Blom, S.O. Krumke, W.E. de Paepe, and, L. Stougie, The online TSP against fair adversaries, INFORMS J Comput 13 (2001), 138-148. (Pubitemid 33645988)
11. A. Borodin, and, R. El-Yaniv, Online computation and competitive analysis, 1st edition, Cambridge University Press, 1998.
12. E. Feuerstein, and, L. Stougie, On-line single-server dial-a-ride problems, Theor Comput Sci 268 (2001), 91-105. (Pubitemid 32866936)
13. A. Fiat, and, G. Woeginger, Online Algorithms: The State of the Art, Springer Verlag LNCS State of the Art Survey, 1998.
14. P. Van Hentenryck, and, R. Bent, Online Stochastic Combinatorial Optimization, 1st edition, MIT Press, Cambridge, MA, 2006.
15. P. Jaillet, and, M. Wagner, Online routing problems: value of advanced information as improved competitive ratios, Transport Sci 40 (2006), 200-210.
16. P. Jaillet, and, M. Wagner, Generalized online routing: New competitive ratios, resource augmentation and asymptotic analyses, Oper Res 56 (2008), 745-757.
17. B. Kalyanasundaram, and, K.R. Pruhs, Constructing competitive tours from local information, Theor Comput Sci 130 (1994), 125-138.
18. A. Karlin, M. Manasse, L. Rudolph, and, D. Sleator, Competitive snoopy caching, Algorithmica 3 (1988), 79-119.
19. B. Korte, and, J. Vygen, Combinatorial optimization, theory and algorithms, 2nd edition, Springer, Berlin Heidelberg, Germany, 2002.
20. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and, D.B. Shmoys, The Traveling Salesman Problem, A Guided Tour of Combinatorial Optimization, 2nd edition, Wiley, 1985.
21. M. Lipmann, On-line Routing, PhD thesis, Technische Universiteit Eindhoven, 2003.
22. D. Sleator, and, R. Tarjan, Amortized efficiency of list update and paging rules, Commun ACM 28 (1985), 202-208. (Pubitemid 15514486)
23. M. Wagner, Online tsp with rejections. Short note, California State University East Bay, October 2006.