{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T05:13:17Z","timestamp":1735017197377,"version":"3.32.0"},"reference-count":49,"publisher":"Informa UK Limited","issue":"6","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1080\/10556788.2024.2349091","type":"journal-article","created":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T14:58:13Z","timestamp":1716476293000},"page":"1407-1427","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing the number of rides served for time-limited Dial-a-Ride*"],"prefix":"10.1080","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2493-1251","authenticated-orcid":false,"given":"Barbara M.","family":"Anthony","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, Southwestern University, Georgetown, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Chung","sequence":"additional","affiliation":[{"name":"Computer Science Department, Connecticut College, New London, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9445-1475","authenticated-orcid":false,"given":"Ananya","family":"Das","sequence":"additional","affiliation":[{"name":"Computer Science Department, Middlebury College, Middlebury, VT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Yuen","sequence":"additional","affiliation":[{"name":"Independent Researcher"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2024,5,23]]},"reference":[{"key":"e_1_3_3_2_1","unstructured":"B.M. Anthony R. Birnbaum S. Boyd A. Christman C. Chung P. Davis J. Dhimar and D.S. Yuen Maximizing the number of rides served for dial-a-ride in 19th Symposium on Algorithmic Approaches for Transportation Modelling Optimization and Systems (ATMOS 2019) V. Cacchiani and A. Marchetti-Spaccamela eds. Vol. 75 2019 pp. 11:1\u201311:15."},{"key":"e_1_3_3_3_1","doi-asserted-by":"crossref","unstructured":"B.M. Anthony A.D. Christman C. Chung and D. Yuen Serving rides of equal importance for time-limited dial-a-ride in Mathematical Optimization Theory and Operations Research P. Pardalos M. Khachay and A. Kazakov eds. Springer International Publishing Cham 2021 pp. 35\u201350.","DOI":"10.1007\/978-3-030-77876-7_3"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771429"},{"key":"e_1_3_3_5_1","doi-asserted-by":"crossref","unstructured":"N. Ascheuer S.O. Krumke and J. Rambau Online dial-a-ride problems: Minimizing the completion time in Annual Symposium on Theoretical Aspects of Computer Science Springer 2000 pp. 639\u2013650.","DOI":"10.1007\/3-540-46541-3_53"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-022-00745-7"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190602"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548477"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703433122"},{"key":"e_1_3_3_10_1","doi-asserted-by":"crossref","unstructured":"S. Baruah J. Haritsa and N. Sharma On-line scheduling to maximize task completions in 1994 Proceedings Real-Time Systems Symposium 1994 pp. 228\u2013236.","DOI":"10.1109\/REAL.1994.342713"},{"key":"e_1_3_3_11_1","first-page":"65","article-title":"On-line scheduling to maximize task completions","volume":"39","author":"Baruah S.","year":"2001","unstructured":"S. Baruah, J. Haritsa, and N. Sharma, On-line scheduling to maximize task completions, J. Comb. Math. Comb. Comput. 39 (2001), pp. 65\u201378.","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581256"},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1268513"},{"key":"e_1_3_3_14_1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2019).","author":"Birx A.","year":"2019","unstructured":"A. Birx, Y. Disser, and K. Schewior, Improved bounds for open online dial-a-ride on the line, in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2019)., Achlioptas D. and V\u00e9gh L., ed., Schloss Dagstuhl- Leibniz-Zentrum fuer Informatik, Cambridge, MA, USA, 2019."},{"key":"e_1_3_3_15_1","first-page":"1","article-title":"Tight bounds for online TSP on the line","volume":"17","author":"Bjelde A.","year":"2020","unstructured":"A. Bjelde, J. Hackfeld, Y. Disser, C. Hansknecht, M. Lipmann, J. Mei\u00dfner, M. Schl\u00d6ter, K. Schewior, and L. Stougie, Tight bounds for online TSP on the line, ACM Trans. Algorithms (TALG)17 (2020), pp. 1\u201358.","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/050645464"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04550-3"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63307-3_51"},{"key":"e_1_3_3_19_1","doi-asserted-by":"crossref","unstructured":"M. Charikar and B. Raghavachari The finite capacity dial-a-ride problem in Proceedings 39th Annual Symposium on Foundations of Computer Science IEEE 1998 pp. 458\u2013467.","DOI":"10.1109\/SFCS.1998.743496"},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-017-0188-z"},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s43069-021-00076-x"},{"key":"e_1_3_3_22_1","unstructured":"City of Plymouth Minnesota Plymouth metrolink dial-a-ride Personal communication. Available at http:\/\/www.plymouthmn.gov\/departments\/administrative-services-\/transit\/plymouth-metrolink-dial-a-ride."},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0170-8"},{"key":"e_1_3_3_24_1","first-page":"396","volume-title":"Automata, Languages and Programming: 31st International Colloquium (ICALP 2004)","author":"Czumaj A.","unstructured":"A. Czumaj and C. Sohler, Sublinear-time approximation for clustering via random sampling, in Automata, Languages and Programming: 31st International Colloquium (ICALP 2004), D\u00edaz J., Karhum\u00e4ki J., Lepist\u00f6 A., and Sannella D., ed., Turku, Finland Springer, New York, NY,\u00a0396\u2013407."},{"key":"e_1_3_3_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_90"},{"key":"e_1_3_3_26_1","doi-asserted-by":"crossref","unstructured":"J. Fakcharoenphol S. Rao and K. Talwar A tight bound on approximating arbitrary metrics by tree metrics in Journal of Computer and System Sciences (Special Issue on STOC 2003) Vol. 69:3 2004 pp. 485\u2013497.","DOI":"10.1016\/j.jcss.2004.04.011"},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00261-9"},{"key":"e_1_3_3_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.07.019"},{"key":"e_1_3_3_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1993.1029"},{"key":"e_1_3_3_30_1","doi-asserted-by":"crossref","unstructured":"G.N. Frederickson M.S. Hecht and C.E. Kim Approximation algorithms for some routing problems in 17th annual Symposium on Foundations of Computer Science IEEE 1976 pp. 216\u2013227.","DOI":"10.1109\/SFCS.1976.6"},{"key":"e_1_3_3_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-020-00638-7"},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.06.007"},{"key":"e_1_3_3_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2018.02.001"},{"key":"e_1_3_3_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8_10"},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00074-9"},{"key":"e_1_3_3_37_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.121"},{"key":"e_1_3_3_38_1","first-page":"356","volume-title":"Analysis of Images, Social Networks and Texts","author":"Konstantin K.","year":"2018","unstructured":"K. Konstantin, Stabbing line segments with disks: Complexity and approximation algorithms, in Analysis of Images, Social Networks and Texts, W.M.P. van der Aalst, D.I. Ignatov, M. Khachay, S.O. Kuznetsov, V. Lempitsky, I.A. Lomazova, N. Loukachevitch, A. Napoli, A. Panchenko, P.M. Pardalos, A.V. Savchenko, and S. Wasserman, eds., Springer, Cham, Moscow, 2018. pp. 356\u2013367."},{"key":"e_1_3_3_39_1","volume-title":"Online optimization: Competitive analysis and beyond","author":"Krumke S.O.","year":"2002","unstructured":"S.O. Krumke, Online optimization: Competitive analysis and beyond.\u00a0Ph.D. thesis, Habilitationsschrift Technische Universitat Berlin,\u00a02002."},{"key":"e_1_3_3_40_1","first-page":"258","volume-title":"Approximation and Online Algorithms","author":"Krumke S.O.","year":"2005","unstructured":"S.O. Krumke, W. de Paepe, D. Poensgen, M. Lipmann, A. Marchetti-Spaccamela, and L. Stougie, On minimizing the maximum flow time in the online dial-a-ride problem, in Approximation and Online Algorithms, Erlebach T. and Persinao G., ed., Springer, Palma de Mallorca, Spain, 2005, pp. 258\u2013269."},{"key":"e_1_3_3_41_1","unstructured":"S.O. Krumke L. Luigi M. Lipmann A. Marchetti-Spaccamela W. de Paepe D. Poensgen and L. Stougie Non-abusiveness helps: An O(1)-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem in Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Springer-Verlag 2002 pp. 200\u2013214."},{"key":"e_1_3_3_42_1","doi-asserted-by":"crossref","unstructured":"S.O. Krumke N. Megow and T. Vredeveld How to whack moles in Approximation and Online Algorithms R. Solis-Oba and K. Jansen eds. Springer Berlin Heidelberg: Berlin Heidelberg 2004 pp. 192\u2013205.","DOI":"10.1007\/978-3-540-24592-6_15"},{"key":"e_1_3_3_43_1","unstructured":"Metropolitan Council Transit link: Dial-a-ride small bus service Personal communication. Available at https:\/\/metrocouncil.org\/Transportation\/Services\/Transit-Link.aspx."},{"key":"e_1_3_3_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-017-2525-0"},{"key":"e_1_3_3_45_1","unstructured":"A. Paul D. Freund A. Ferber D.B. Shmoys and D.P. Williamson Prize-collecting TSP with a budget constraint in 25th Annual European Symposium on Algorithms (ESA 2017) Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik 2017 pp. 62:1\u201362:14."},{"key":"e_1_3_3_46_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2019.1002"},{"key":"e_1_3_3_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-012-0303-z"},{"key":"e_1_3_3_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1123-9_1"},{"key":"e_1_3_3_49_1","doi-asserted-by":"crossref","unstructured":"B. Simons A fast algorithm for single processor scheduling in 2013 IEEE 54th Annual Symposium on Foundations of Computer Science IEEE Computer Society 1978 pp. 246\u2013252.","DOI":"10.1109\/SFCS.1978.4"},{"key":"e_1_3_3_50_1","unstructured":"Tri-Valley Transit Dial-a-ride Personal communication. Available at https:\/\/www.trivalleytransit.org."}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2024.2349091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T14:47:49Z","timestamp":1734965269000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2024.2349091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,23]]},"references-count":49,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["10.1080\/10556788.2024.2349091"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2024.2349091","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2024,5,23]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-01-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-25","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}