The Machine Learning and Traveling Repairman Problem
- Cite this paper as:
- 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
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.
Keywordsmachine learning traveling repairman integer programming uncertainty generalization bound constrained linear function classes
Unable to display preview. Download preview PDF.