{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T04:40:32Z","timestamp":1780375232391,"version":"3.54.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0167-6377(02)00120-7","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T19:55:37Z","timestamp":1034625337000},"page":"169-173","source":"Crossref","is-referenced-by-count":64,"title":["Efficient feasibility testing for dial-a-ride problems"],"prefix":"10.1016","volume":"30","author":[{"given":"Brady","family":"Hunsaker","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Savelsbergh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00120-7_BIB1","first-page":"301","article-title":"A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows","volume":"6","author":"Desrosiers","year":"1986","journal-title":"Am. J. Math. Manage. Sci."},{"key":"10.1016\/S0167-6377(02)00120-7_BIB2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0191-2615(86)90020-2","article-title":"A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows","volume":"20B","author":"Jaw","year":"1986","journal-title":"Transportation Res. Part B"},{"key":"10.1016\/S0167-6377(02)00120-7_BIB3","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.14.2.130","article-title":"A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem","volume":"14","author":"Psaraftis","year":"1980","journal-title":"Transportation Sci."},{"key":"10.1016\/S0167-6377(02)00120-7_BIB4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0191-2615(83)90041-3","article-title":"Analysis of an o(n2) heuristic for the single vehicle many-to-many euclidean dial-a-ride problem","volume":"17B","author":"Psaraftis","year":"1983","journal-title":"Transportation Res."},{"key":"10.1016\/S0167-6377(02)00120-7_BIB5","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.17.3.351","article-title":"An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows","volume":"17","author":"Psaraftis","year":"1983","journal-title":"Transportation Sci."},{"key":"10.1016\/S0167-6377(02)00120-7_BIB6","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0377-2217(83)90099-1","article-title":"k-interchange procedures for local search in a precedence-constrained routing problem","volume":"13","author":"Psaraftis","year":"1983","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00120-7_BIB7","first-page":"327","article-title":"Scheduling large-scale advance-request dial-a-ride systems","volume":"6","author":"Psaraftis","year":"1986","journal-title":"Am. J. Math. Manage. Sci."},{"key":"10.1016\/S0167-6377(02)00120-7_BIB8","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/trsc.19.4.378","article-title":"Optimizing single vehicle many-to-many operations with desired delivery times: I. scheduling","volume":"19","author":"Sexton","year":"1985","journal-title":"Transportation Sci."},{"key":"10.1016\/S0167-6377(02)00120-7_BIB9","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1287\/trsc.19.4.411","article-title":"Optimizing single vehicle many-to-many operations with desired delivery times: Ii. routing","volume":"19","author":"Sexton","year":"1985","journal-title":"Transportation Sci."},{"key":"10.1016\/S0167-6377(02)00120-7_BIB10","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1287\/trsc.12.3.232","article-title":"Scheduling dial-a-ride transportation systems","volume":"12","author":"Stein","year":"1978","journal-title":"Transportation Sci."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001207?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001207?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:22:29Z","timestamp":1555057349000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0167637702001207"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00120-7","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}