{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T09:06:21Z","timestamp":1774515981472,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,8]],"date-time":"2008-11-08T00:00:00Z","timestamp":1226102400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Public Transp"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s12469-008-0006-1","type":"journal-article","created":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T14:09:51Z","timestamp":1226066991000},"page":"39-54","source":"Crossref","is-referenced-by-count":60,"title":["The Integrated Dial-a-Ride Problem"],"prefix":"10.1007","volume":"1","author":[{"given":"Carl H.","family":"H\u00e4ll","sequence":"first","affiliation":[]},{"given":"Henrik","family":"Andersson","sequence":"additional","affiliation":[]},{"given":"Jan T.","family":"Lundgren","sequence":"additional","affiliation":[]},{"given":"Peter","family":"V\u00e4rbrand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,8]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0360-8352(03)00032-9","volume":"45","author":"M Aldaihani","year":"2003","unstructured":"Aldaihani M, Dessouky M (2003) Hybrid scheduling methods for paratransit operations. Comput Ind Eng 45:75\u201396","journal-title":"Comput Ind Eng"},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.parco.2003.12.001","volume":"30","author":"A Attanasio","year":"2004","unstructured":"Attanasio A, Cordeau J, Ghiani G, Laporte G (2004) Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput 30:377\u2013387","journal-title":"Parallel Comput"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1080\/03052159808941240","volume":"30","author":"J Baugh","year":"1998","unstructured":"Baugh J, Kakivaya G, Stone J (1998) Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Eng Optim 30:91\u2013123","journal-title":"Eng Optim"},{"key":"6_CR4","unstructured":"Bergvinsdottir K, Larsen J, Jorgensen R (2004) Solving the dial-a-ride problem using genetic algorithms. Technical Report 2004-20, Informatics and Mathematical Modelling, Technical University of Denmark, Denmark"},{"key":"6_CR5","unstructured":"B\u00f6rjesson M (2001) Erfarenheter av samordning av f\u00e4rdtj\u00e4nst och sjukresor i Dalsland. Vinnova Rapport 2001:27"},{"key":"6_CR6","unstructured":"Bornd\u00f6rfer R, Gr\u00f6tschel M, Klostermeier F, K\u00fcttner C (1997) Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97-23, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin"},{"key":"6_CR7","unstructured":"Chan S (2004) Metaheuristics for solving the dial-a-ride problem. PhD Thesis, North Carolina State University, USA"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"J Cordeau","year":"2006","unstructured":"Cordeau J (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper Res 54:573\u2013586","journal-title":"Oper Res"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"J Cordeau","year":"2003","unstructured":"Cordeau J, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp Res Part B 37:579\u2013594","journal-title":"Transp Res Part B"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/j.trb.2003.07.001","volume":"38","author":"M Diana","year":"2004","unstructured":"Diana M, Dessouky M (2004) A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transp Res Part B 38:539\u2013557","journal-title":"Transp Res Part B"},{"key":"6_CR11","unstructured":"Hickman M, Blume K (2001) An investigation of integrated transit service. Research Report SWUTC\/01\/472840-00023-1, Texas Transportation Institute, USA"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.trc.2002.08.001","volume":"12","author":"M Horn","year":"2004","unstructured":"Horn M (2004) Procedures for planning multi-leg journeys with fixed-route and demand-responsive passenger transport services. Transp Res Part C 12:33\u201355","journal-title":"Transp Res Part C"},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/trsc.29.1.63","volume":"29","author":"I Ioachim","year":"1995","unstructured":"Ioachim I, Desrosiers J, Dumas Y, Solomon M, Villeneuve D (1995) A request clustering algorithm for door-to-door handicapped transportation. Transp Sci 29:63\u201378","journal-title":"Transp Sci"},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0191-2615(86)90020-2","volume":"20","author":"J Jaw","year":"1986","unstructured":"Jaw J, Odoni A, Psaraftis H, Wilson N (1986) A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transp Res Part B 20:243\u2013257","journal-title":"Transp Res Part B"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1109\/3468.531903","volume":"26","author":"C Liaw","year":"1996","unstructured":"Liaw C, White C, Bander J (1996) A decision support system for the bimodal dial-a-ride problem. IEEE Trans Syst Man Cybern Part A 26:552\u2013565","journal-title":"IEEE Trans Syst Man Cybern Part A"},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02031946","volume":"60","author":"O Madsen","year":"1995","unstructured":"Madsen O, Ravn H, Rygaard JM (1995) A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann Oper Res 60:193\u2013208","journal-title":"Ann Oper Res"},{"key":"6_CR17","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"S Parragh","year":"2008","unstructured":"Parragh S, Doerner K, Hartl R (2008) A survey on pickup and delivery problems: Part II: Transportation between pickup and delivery locations. J Betriebswirtsch 58:81\u2013117","journal-title":"J Betriebswirtsch"},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"H Psaraftis","year":"1980","unstructured":"Psaraftis H (1980) A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp Sci 14:130\u2013154","journal-title":"Transp Sci"},{"key":"6_CR19","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.17.3.351","volume":"17","author":"H Psaraftis","year":"1983","unstructured":"Psaraftis H (1983) An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transp Sci 17:351\u2013357","journal-title":"Transp Sci"},{"key":"6_CR20","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S Ropke","year":"2007","unstructured":"Ropke S, Cordeau J, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49:258\u2013272","journal-title":"Networks"},{"key":"6_CR21","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1287\/trsc.31.1.60","volume":"31","author":"P Toth","year":"1997","unstructured":"Toth P, Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem. Transp Sci 31:60\u201371","journal-title":"Transp Sci"},{"key":"6_CR22","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1109\/TVT.2002.1015354","volume":"51","author":"K Uchimura","year":"2002","unstructured":"Uchimura K, Takahashi H, Saitoh T (2002) Demand responsive services in hierarchical public transportation system. IEEE Trans Veh Technol 51:760\u2013766","journal-title":"IEEE Trans Veh Technol"},{"key":"6_CR23","unstructured":"Wilson N, Sussman J, Wang H, Higonnet B (1971) Scheduling algorithms for dial-a-ride systems. Technical Report USL-TR-71-13, Massachusetts Institute of Technology, USA"},{"key":"6_CR24","unstructured":"Wilson N, Weissberg R, Hauser J (1976) Advanced dial-a-ride algorithms research project: Final report. Technical Report 76-20, Massachusetts Institute of Technology, USA"}],"container-title":["Public Transport"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-008-0006-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12469-008-0006-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-008-0006-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T11:16:18Z","timestamp":1559474178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12469-008-0006-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,8]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["6"],"URL":"https:\/\/doi.org\/10.1007\/s12469-008-0006-1","relation":{},"ISSN":["1866-749X","1613-7159"],"issn-type":[{"value":"1866-749X","type":"print"},{"value":"1613-7159","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,8]]}}}