{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T03:18:23Z","timestamp":1784171903748,"version":"3.55.0"},"reference-count":59,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Transportation Science"],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:p>The traveling repairman problem focuses on minimizing total latency, defined as the waiting time experienced by customers after submitting a service request. This problem naturally arises in settings where customer experience is a key objective, particularly in time-sensitive service operations. We address a generalized traveling repairman problem that extends the classical setting by incorporating available probabilistic information on the timing of future requests as well as a more flexible method for measuring the impact of service latency. To account for potential future requests in addition to those known at the time of route planning, we develop a priori routes combined with recourse rules for their execution, aiming to minimize the total expected disutility caused by service latency across all customers. We formulate the problem as a stochastic, path-based traveling repairman problem and solve it using a branch-and-price algorithm, where expected latency is estimated through sample-scenario planning. We then evaluate the performance of our a priori routing approach through a factorial experiment; compare it with alternative routing strategies; and apply these methods to a large-scale, real-world bike-sharing setting.<\/jats:p>\n                  <jats:p>Supplemental Material: The online appendix is available at https:\/\/doi.org\/10.1287\/trsc.2023.0478 .<\/jats:p>","DOI":"10.1287\/trsc.2023.0478","type":"journal-article","created":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T16:31:32Z","timestamp":1756485092000},"page":"22-45","source":"Crossref","is-referenced-by-count":1,"title":["The\n                    <i>k<\/i>\n                    -Traveling Repairman Problem with Stochastic Service Request Times"],"prefix":"10.1287","volume":"60","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7704-9791","authenticated-orcid":false,"given":"Thomas Bryant","family":"Cassidey","sequence":"first","affiliation":[{"name":"Department of Business Analysis, University of Colorado at Colorado Springs, Colorado Springs, Colorado 80918"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9179-1973","authenticated-orcid":false,"given":"Iman","family":"Dayarian","sequence":"additional","affiliation":[{"name":"Culverhouse College of Business, University of Alabama, Tuscaloosa, Alabama 35487"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"109","reference":[{"key":"B1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-024-06221-z"},{"key":"B2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2015.09.061"},{"key":"B3","doi-asserted-by":"publisher","DOI":"10.1137\/07068151X"},{"key":"B4","doi-asserted-by":"crossref","unstructured":"Ausiello G, Leonardi S, Marchetti-Spaccamela A (2000) On salesmen, repairmen, spiders, and other traveling agents. Bongiovanni G, Petreschi R, Gambosi G, eds.\n                      Algorithms and Complexity. CIAC 2000\n                      , Lecture Notes in Computer Science, vol. 1767 (Springer, New York), 1\u201316.","DOI":"10.1007\/3-540-46521-9_1"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1110.0975"},{"key":"B6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.4.601"},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.6.1019"},{"key":"B8","doi-asserted-by":"crossref","unstructured":"Bhowmik S (2019) Digital twin of subsea pipelines: Conceptual design integrating IoT, machine learning and data analytics.\n                      Offshore Tech. Conf. D011S010R004.","DOI":"10.4043\/29455-MS"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2008.04.001"},{"key":"B10","doi-asserted-by":"crossref","unstructured":"Blum A, Chalasani P, Coppersmith D, Pulleyblank B, Raghavan P, Sudan M (1994) The minimum latency problem.\n                      Proc. Twenty-Sixth Annual ACM Sympos. Theory Comput.\n                      (ACM, New York), 163\u2013171.","DOI":"10.1145\/195058.195125"},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2004.11.011"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.01.016"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-382038-9.00010-7"},{"key":"B14","unstructured":"Citi Bike (2024) September 2024 monthly report. Accessed October 19, 2024, https:\/\/citibikenyc.com\/."},{"key":"B15","volume-title":"Theory of Scheduling","author":"Conway RW","year":"1967"},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2018.0878"},{"key":"B17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.06.004"},{"key":"B17b","doi-asserted-by":"crossref","unstructured":"Dayarian I, Crainic TG, Gendreau M, Rei W (2015b) A column generation approach for a multi-attribute vehicle routing problem.\n                      Eur. J. Oper. Res.\n                      241(3):888\u2013906.","DOI":"10.1016\/j.ejor.2014.09.015"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1007\/b135457"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61684-6"},{"key":"B20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.5.977"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290677"},{"key":"B22","doi-asserted-by":"publisher","DOI":"10.1002\/net.20033"},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.6.1055"},{"key":"B24","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.11.019"},{"key":"B25","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1060.0166"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25486-2_2"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1040.0117"},{"key":"B28","doi-asserted-by":"publisher","DOI":"10.1287\/opre.36.6.929"},{"key":"B29","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1070.0449"},{"key":"B30","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1050.0234"},{"key":"B31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.09.014"},{"key":"B32","unstructured":"MAWSS (2025) News. Accessed February 24, 2025, https:\/\/www.mawss.com\/news\/."},{"key":"B33","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.05.009"},{"key":"B34","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2022.3208773"},{"key":"B35","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2020.1005"},{"key":"B36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85363-3_16"},{"key":"B37","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2020.07.009"},{"key":"B38","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-100543-9.00001-4"},{"key":"B39","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.06.014"},{"key":"B40","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2015.113"},{"key":"B41","unstructured":"Perron L, Furnon V (2023) Google OR-tools. Accessed December 15, 2023, https:\/\/developers.google.com\/optimization\/."},{"key":"B42","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2022.0434"},{"key":"B43","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.86"},{"key":"B44","first-page":"100272","volume":"26","author":"Priyanka E","year":"2022","journal-title":"J. Indust. Inform. Integration"},{"key":"B45","doi-asserted-by":"crossref","unstructured":"Psaraftis HN, Wen M, Kontovas CA (2015) Dynamic vehicle routing problems: Three decades and counting.\n                      Networks\n                      67(1):3\u201331.","DOI":"10.1002\/net.21628"},{"key":"B46","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2006.05.007"},{"key":"B47","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.01.003"},{"key":"B48","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2013.0474"},{"key":"B49","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-013-0139-0"},{"key":"B50","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"key":"B51","doi-asserted-by":"publisher","DOI":"10.1016\/S0307-904X(03)00135-5"},{"key":"B52","doi-asserted-by":"publisher","DOI":"10.1080\/07408179108963858"},{"key":"B53","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-801653-4.00016-3"},{"key":"B54","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1060.0183"},{"key":"B55","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0351-z"},{"key":"B56","unstructured":"van Eijl CA (1995) A polyhedral approach to the delivery man problem. Eindhoven University of Technology, Memorandum COSOR 9519."},{"key":"B57","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105823"},{"key":"B58","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105183"}],"container-title":["Transportation Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/trsc.2023.0478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T09:59:34Z","timestamp":1770803974000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/trsc.2023.0478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["10.1287\/trsc.2023.0478"],"URL":"https:\/\/doi.org\/10.1287\/trsc.2023.0478","relation":{},"ISSN":["0041-1655","1526-5447"],"issn-type":[{"value":"0041-1655","type":"print"},{"value":"1526-5447","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]}}}