Skip to main content
SpringerLink
Log in

On-Line Algorithms for the Dynamic Traveling Repair Problem

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  • Alborzi, H., E. Torng, P. Uthaisombut, and S. Wagner, “The k-client problem,” J. Algorithms, 41(2), 115–173 (2001).

    Article  Google Scholar 

  • 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.

  • Augustine, J. and S. Seiden, “Linear time approximation schemes for vehicle routing,” in 8th Scandinavian Workshop on Algorithm Theory (in press).

  • 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).

    Article  Google Scholar 

  • 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).

    Article  Google Scholar 

  • 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 

  • 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 

  • Deng, X. and C. Papadimitriou, “Exploring an unknown graph,” in Proceedings of 31st Annual Symposium on Foundations of Computer Science, 1990, pp. 355–361.

  • Feuerstein, E. and L. Stougie, “On-line single-server dial-a-ride problems.” Theor. Comput. Sci., 268(1), 91–105 (2001).

    Article  Google Scholar 

  • 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.

  • 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).

    Article  Google Scholar 

  • 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).

    Article  Google Scholar 

  • 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.

  • Manasse, M., L. A. McGeogh, and D. Sleator, “Competitive algorithms for server problems,” J. Algorithms, 11(2), 208–230 (1990).

    Article  Google Scholar 

  • 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 

  • 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 

Download references

Author information

Authors and Affiliations

  1. Information and Computer Science Department, UC Irvine, Irvine, 92697, USA

    Sandy Irani

  2. Institute of Transportation Studies, UC Irvine, Irvine, 92697, USA

    Xiangwen Lu

  3. Department of Civil and Environmental Engineering, UC Irvine, Irvine, 92697, USA

    Amelia Regan

Authors
  1. Sandy Irani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiangwen Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amelia Regan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sandy Irani.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Irani, S., Lu, X. & Regan, A. On-Line Algorithms for the Dynamic Traveling Repair Problem. J Sched 7, 243–258 (2004). https://doi.org/10.1023/B:JOSH.0000019683.85186.57

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JOSH.0000019683.85186.57

Keywords

Search

Navigation