{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:54:57Z","timestamp":1744217697356,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T00:00:00Z","timestamp":1627430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T00:00:00Z","timestamp":1627430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN Oper. Res. Forum"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s43069-021-00076-x","type":"journal-article","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:02:48Z","timestamp":1637240568000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved Bounds for Revenue Maximization in Time-Limited Online Dial-a-Ride"],"prefix":"10.1007","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9445-1475","authenticated-orcid":false,"given":"Ananya D.","family":"Christman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3580-9275","authenticated-orcid":false,"given":"Christine","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas","family":"Jaczko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianzhi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Westvold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyue","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Yuen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,28]]},"reference":[{"key":"76_CR1","unstructured":"Christman A, Chung C, Jaczko N, Milan M, Vasilchenko A, Westvold S (2017) Revenue maximization in online dial-a-ride. In: 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"key":"76_CR2","doi-asserted-by":"crossref","unstructured":"Christman A, Chung C, Jaczko N, Li T, Westvold S, Xu X, Yuen D (2020) New bounds for maximizing revenue in online dial-a-ride. In: 31st International Workshop on on Combinatorial Algorithms (IWOCA 2020)","DOI":"10.1007\/978-3-030-48966-3_14"},{"issue":"1","key":"76_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(00)00261-9","volume":"268","author":"E Feuerstein","year":"2001","unstructured":"Feuerstein E, Stougie L (2001) On-line single-server dial-a-ride problems. Theor Comput Sci 268(1):91\u2013105","journal-title":"Theor Comput Sci"},{"key":"76_CR4","doi-asserted-by":"crossref","unstructured":"Jaillet P, Wagner MR (2008) Online vehicle routing problems: A survey. The Vehicle Routing Problem: Latest Advances and New Challenges. pp. 221\u2013237","DOI":"10.1007\/978-0-387-77778-8_10"},{"issue":"1\u20132","key":"76_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10479-017-2525-0","volume":"259","author":"Y Molenbruch","year":"2017","unstructured":"Molenbruch Y, Braekers K, Caris A (2017) Typology and literature review for dial-a-ride problems. Ann Oper Res 259(1\u20132):295\u2013325","journal-title":"Ann Oper Res"},{"key":"76_CR6","unstructured":"Krumke SO (2002) Online optimization: Competitive analysis and beyond"},{"key":"76_CR7","unstructured":"Birx A, Disser Y, Schewior K (2019) Improved bounds for open online dial-a-ride on the line. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"key":"76_CR8","doi-asserted-by":"crossref","unstructured":"Ascheuer N, Krumke SO, Rambau J (2000) Online dial-a-ride problems: Minimizing the completion time. In: Annual Symposium on Theoretical Aspects of Computer Science. pp. 639\u2013650. Springer","DOI":"10.1007\/3-540-46541-3_53"},{"key":"76_CR9","unstructured":"Birx A, Disser Y (2019) Tight analysis of the smartstart algorithm for online dial-a-ride on the line. In: 36th International Symposium on Theoretical Aspects of Computer Science"},{"issue":"2","key":"76_CR10","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1137\/19M1268513","volume":"34","author":"A Birx","year":"2020","unstructured":"Birx A, Disser Y (2020) Tight analysis of the smartstart algorithm for online dial-a-ride on the line. SIAM J Discrete Math 34(2):1409\u20131443","journal-title":"SIAM J Discrete Math"},{"issue":"1","key":"76_CR11","first-page":"1","volume":"17","author":"A Bjelde","year":"2020","unstructured":"Bjelde A, Hackfeld J, Disser Y, Hansknecht C, Lipmann M, Mei\u00dfner J, Schl\u00d6ter M, Schewior K, Stougie L (2020) Tight bounds for online tsp on the line. ACM Transactions on Algorithms (TALG) 17(1):1\u201358","journal-title":"ACM Transactions on Algorithms (TALG)"},{"issue":"4","key":"76_CR12","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/s004530010071","volume":"29","author":"G Ausiello","year":"2001","unstructured":"Ausiello G, Feuerstein E, Leonardi S, Stougie L, Talamo M (2001) Algorithms for the on-line travelling salesman. Algorithmica 29(4):560\u2013581","journal-title":"Algorithmica"},{"key":"76_CR13","doi-asserted-by":"crossref","unstructured":"Krumke SO, de\u00a0Paepe WE, Poensgen D, Lipmann M, Marchetti-Spaccamela A, Stougie L (2005) On minimizing the maximum flow time in the online dial-a-ride problem. In: International Workshop on Approximation and Online Algorithms. pp. 258\u2013269. Springer","DOI":"10.1007\/11671411_20"},{"issue":"6","key":"76_CR14","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas E (1989) The prize collecting traveling salesman problem. Networks 19(6):621\u2013636","journal-title":"Networks"},{"issue":"6","key":"76_CR15","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ipl.2008.03.002","volume":"107","author":"G Ausiello","year":"2008","unstructured":"Ausiello G, Bonifaci V, Laura L (2008) The online prize-collecting traveling salesman problem. Inf Process Lett 107(6):199\u2013204","journal-title":"Inf Process Lett"},{"key":"76_CR16","unstructured":"Anthony B, Boyd S, Birnbaum R, Christman A, Chung C, Davis P, Dhimar J, Yuen D (2019) Maximizing the number of rides served for dial-a-ride. In: 19th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"issue":"2","key":"76_CR17","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/s10878-017-0188-z","volume":"35","author":"A Christman","year":"2018","unstructured":"Christman A, Forcier W, Poudel A (2018) From theory to practice: maximizing revenues for on-line dial-a-ride. J Comb Optim 35(2):512\u2013529","journal-title":"J Comb Optim"},{"key":"76_CR18","unstructured":"Corporation S. Dial-a-ride, http:\/\/stagecoach-rides.org\/dial-a-ride\/"},{"key":"76_CR19","unstructured":"Council M. Transit link: Dial-a-ride small bus service, https:\/\/metrocouncil.org\/Transportation\/Services\/Transit-Link.aspx"},{"key":"76_CR20","unstructured":"City\u00a0of Plymouth M. Plymouth metrolink dial-a-ride, http:\/\/www.plymouthmn.gov\/departments\/administrative-services-\/transit\/plymouth-metrolink-dial-a-ride"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00076-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-021-00076-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00076-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:31:01Z","timestamp":1637242261000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-021-00076-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,28]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["76"],"URL":"https:\/\/doi.org\/10.1007\/s43069-021-00076-x","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2021,7,28]]},"assertion":[{"value":"17 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"39"}}