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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Chapelle, O., Schölkopf, B., Zien, A. (eds.): Semi-Supervised Learning. MIT Press, Cambridge (2006)
Agarwal, S.: Ranking on graph data. In: Proceedings of the 23rd International Conference on Machine Learning (2006)
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)
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)
Fischetti, M., Laporte, G., Martello, S.: The delivery man problem and cumulative matroids. Oper. Res. 41, 1055–1064 (1993)
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)
Lechmann, M.: The traveling repairman problem - an overview, pp. 1–79, Diplomarbeit, Universitat Wein (2009)
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)
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)
Tulabandhula, T., Rudin, C., Jaillet, P.: Machine Learning and the Traveling Repairman. arXiv:1104.5061 (2011)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tulabandhula, T., Rudin, C., Jaillet, P. (2011). The Machine Learning and Traveling Repairman Problem. In: Brafman, R.I., Roberts, F.S., Tsoukiàs, A. (eds) Algorithmic Decision Theory. ADT 2011. Lecture Notes in Computer Science(), vol 6992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24873-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-24873-3_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24872-6
Online ISBN: 978-3-642-24873-3
eBook Packages: Computer ScienceComputer Science (R0)