Skip to main content
Journal cover image

The machine learning and traveling repairman problem

Publication ,  Conference
Tulabandhula, T; Rudin, C; Jaillet, P
Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
October 31, 2011

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. © 2011 Springer-Verlag.

Duke Scholars

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

EISSN

1611-3349

ISSN

0302-9743

ISBN

9783642248726

Publication Date

October 31, 2011

Volume

6992 LNAI

Start / End Page

262 / 276

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Tulabandhula, T., Rudin, C., & Jaillet, P. (2011). The machine learning and traveling repairman problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6992 LNAI, pp. 262–276). https://doi.org/10.1007/978-3-642-24873-3_20
Tulabandhula, T., C. Rudin, and P. Jaillet. “The machine learning and traveling repairman problem.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6992 LNAI:262–76, 2011. https://doi.org/10.1007/978-3-642-24873-3_20.
Tulabandhula T, Rudin C, Jaillet P. The machine learning and traveling repairman problem. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2011. p. 262–76.
Tulabandhula, T., et al. “The machine learning and traveling repairman problem.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6992 LNAI, 2011, pp. 262–76. Scopus, doi:10.1007/978-3-642-24873-3_20.
Tulabandhula T, Rudin C, Jaillet P. The machine learning and traveling repairman problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2011. p. 262–276.
Journal cover image

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

EISSN

1611-3349

ISSN

0302-9743

ISBN

9783642248726

Publication Date

October 31, 2011

Volume

6992 LNAI

Start / End Page

262 / 276

Related Subject Headings

  • Artificial Intelligence & Image Processing
  • 46 Information and computing sciences