The Machine Learning and Traveling Repairman Problem

  • Theja Tulabandhula
  • Cynthia Rudin
  • Patrick Jaillet
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6992)

Abstract

The goal of the Machine Learning and Traveling Repairman Problem (ML&TRP) is to determine a route for a “repair crew,” which repairs nodes on a graph. The repair crew aims to minimize the cost of failures at the nodes, but the failure probabilities are not known and must be estimated. If there is uncertainty in the failure probability estimates, we take this uncertainty into account in an unusual way; from the set of acceptable models, we choose the model that has the lowest cost of applying it to the subsequent routing task. In a sense, this procedure agrees with a managerial goal, which is to show that the data can support choosing a low-cost solution.

Keywords

machine learning traveling repairman integer programming uncertainty generalization bound constrained linear function classes 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Picard, J.-C., Queyranne, M.: The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Operations Research 26(1), 86–110 (1978)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Chapelle, O., Schölkopf, B., Zien, A. (eds.): Semi-Supervised Learning. MIT Press, Cambridge (2006)Google Scholar
  3. 3.
    Agarwal, S.: Ranking on graph data. In: Proceedings of the 23rd International Conference on Machine Learning (2006)Google Scholar
  4. 4.
    Belkin, M., Niyogi, P., Sindhwani, V.: Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. Journal of Machine Learning Research 7, 2399–2434 (2006)MathSciNetMATHGoogle Scholar
  5. 5.
    Zhou, D., Weston, J., Gretton, A., Bousquet, O., Schölkopf, B.: Ranking on data manifolds. In: Advances in Neural Information Processing Systems, vol. 16, pp. 169–176. MIT Press, Cambridge (2004)Google Scholar
  6. 6.
    Fischetti, M., Laporte, G., Martello, S.: The delivery man problem and cumulative matroids. Oper. Res. 41, 1055–1064 (1993)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    van Eijl, C.A.: A polyhedral approach to the delivery man problem. Memorandum COSOR 95–19, Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands (1995)Google Scholar
  8. 8.
    Lechmann, M.: The traveling repairman problem - an overview, pp. 1–79, Diplomarbeit, Universitat Wein (2009)Google Scholar
  9. 9.
    Urbina, I.: Mandatory safety rules are proposed for electric utilities. New York Times. Late Edition, Sec B, Col 3, Metropolitan Desk, p. 2 (08-21-2004)Google Scholar
  10. 10.
    Rudin, C., Passonneau, R., Radeva, A., Dutta, H., Ierome, S., Isaac, D.: A process for predicting manhole events in Manhattan. Machine Learning 80, 1–31 (2010)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Tulabandhula, T., Rudin, C., Jaillet, P.: Machine Learning and the Traveling Repairman. arXiv:1104.5061 (2011)Google Scholar
  12. 12.
    Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: On the minimum latency problem. In: Proceedings of the 26th ACM Symposium on Theory of Computing, pp. 163–171 (September 1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Theja Tulabandhula
    • 1
  • Cynthia Rudin
    • 1
  • Patrick Jaillet
    • 1
  1. 1.Massachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations