On-Line Algorithms for the Dynamic Traveling Repair Problem

Article

Abstract

We consider the dynamic traveling repair problem in which requests with deadlines arrive through time on points in a metric space. Servers move from point to point at constant speed. The goal is to plan the motion of servers so that the maximum number of requests are met by their deadline. We consider a restricted version of the problem in which there is a single server and the length of time between the arrival of a request and its deadline is constant. We give upper bounds for the competitive ratio of two very natural algorithms as well as several lower bounds for any deterministic algorithm. Most of the results in this paper are expressed as a function of β, the diameter of the metric space. In particular, we prove that the upper bound given for one of the two algorithms is within a constant factor of the best possible competitive ratio.

REFERENCES

  1. Alborzi, H., E. Torng, P. Uthaisombut, and S. Wagner, “The k-client problem,” J. Algorithms, 41(2), 115–173 (2001).CrossRefGoogle Scholar
  2. Ascheuer, N., S. O. Krumke, and J. Rambau, “Online dial-a-ride problems: Minimizing the completion time,” in Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1770, Springer-Verlag, 2000, pp. 639–650.Google Scholar
  3. Augustine, J. and S. Seiden, “Linear time approximation schemes for vehicle routing,” in 8th Scandinavian Workshop on Algorithm Theory (in press).Google Scholar
  4. Ausiello, G., E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo, “Algorithms for the on-line traveling salesman,” Algorithmica, 29(4), pp. 560–581 (2001).CrossRefGoogle Scholar
  5. Awerbuch, B., Y. Azar, A. Blum, and S. Vempala, “New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen,” SIAM J. Comput., 28(1), 254–262 (1998).CrossRefGoogle Scholar
  6. Bertsimas, D. and G. Van Ryzin, “A stochastic and dynamic vehicle routing problem in the Euclidean plane,” Oper. Res., 39(4), 601–615 (1991).Google Scholar
  7. Bertsimas, D. and G. Van Ryzin, “Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles,” Oper. Res., 41(1), 60–76 (1993).Google Scholar
  8. Deng, X. and C. Papadimitriou, “Exploring an unknown graph,” in Proceedings of 31st Annual Symposium on Foundations of Computer Science, 1990, pp. 355–361.Google Scholar
  9. Feuerstein, E. and L. Stougie, “On-line single-server dial-a-ride problems.” Theor. Comput. Sci., 268(1), 91–105 (2001).CrossRefGoogle Scholar
  10. Hauptmeier, D., S. O. Krumke, and J. Rambau, “The online dial-a-ride problem under reasonable load”, in Proceedings of Algorithms and Complexity, 4th Italian Conference, Lecture Notes in Computer Science, Vol. 1767, Springer-Verlag, 2000, pp. 125–136.Google Scholar
  11. Hauptmeier, D., S. O. Krumke, J. Rambau, and H. C. Wirth., “Euler is standing in line dial-a-ride problems with precedence-constraints,” Discrete Appl. Math., 113(1), pp. 87–107 (2001).CrossRefGoogle Scholar
  12. Jaillet, P., “A priori solution of a traveling salesman problem in which a random subset of the customers are visited.” Oper. Res., 36(6), 929–936 (1988).CrossRefGoogle Scholar
  13. Krumke, S. O., W. E. de Paepe, D. Poensgen, and L. Stougie, “News from the online traveling repairman,” in Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 2136, Springer-Verlag, 2001, pp. 487–499.Google Scholar
  14. Manasse, M., L. A. McGeogh, and D. Sleator, “Competitive algorithms for server problems,” J. Algorithms, 11(2), 208–230 (1990).CrossRefGoogle Scholar
  15. Powell, W., P. Jaillet, and A. Odoni, “Stochastic and dynamic networks and routing,” in M. Ball, T. Maganti, C. Monma, and G. Nemhauser (eds.), Network Routing, North-Holland, Amsterdam, 1995.Google Scholar
  16. Psarafits, H., “Dynamic vehicle routing problems,” in B. L. Golden, and A. A. Assad (eds.), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, 1988.Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  1. 1.Information and Computer Science DepartmentUC IrvineUSA
  2. 2.Institute of Transportation StudiesUC IrvineUSA
  3. 3.Department of Civil and Environmental EngineeringUC IrvineUSA

Personalised recommendations