{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T06:07:53Z","timestamp":1773382073652,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,4,18]],"date-time":"2012-04-18T00:00:00Z","timestamp":1334707200000},"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":[[2012,7]]},"DOI":"10.1007\/s12469-012-0052-6","type":"journal-article","created":{"date-parts":[[2012,4,17]],"date-time":"2012-04-17T14:27:35Z","timestamp":1334672855000},"page":"17-37","source":"Crossref","is-referenced-by-count":25,"title":["A modeling system for simulation of dial-a-ride services"],"prefix":"10.1007","volume":"4","author":[{"given":"Carl H.","family":"H\u00e4ll","sequence":"first","affiliation":[]},{"given":"Magdalena","family":"H\u00f6gberg","sequence":"additional","affiliation":[]},{"given":"Jan T.","family":"Lundgren","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,18]]},"reference":[{"key":"52_CR1","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":"52_CR2","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1145\/318371.318705","volume-title":"WSC\u201987: Proceedings of the 19th conference on winter simulation","author":"W Bailey","year":"1987","unstructured":"Bailey W, Clark T (1987) A simulation analysis of demand and fleet size effects on taxicab service rates. In: WSC\u201987: Proceedings of the 19th conference on winter simulation, pp 838\u2013844"},{"key":"52_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":"52_CR4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s00291-008-0135-6","volume":"32","author":"A Beaudry","year":"2010","unstructured":"Beaudry A, Laporte G, Melo T, Nickel S (2010) Dynamic transportation of patients in hospitals. OR Spektrum 32:77\u2013107","journal-title":"OR Spektrum"},{"key":"52_CR5","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"G Berbeglia","year":"2010","unstructured":"Berbeglia G, Cordeau J, Laporte G (2010) Dynamic pickup and delivery problems. Eur J Oper Res 202:8\u201315","journal-title":"Eur J Oper Res"},{"key":"52_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":"52_CR7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1111\/1475-3995.00256","volume":"8","author":"A Colorni","year":"2001","unstructured":"Colorni A, Righini G (2001) Modeling and optimizing dynamic dial-a-ride problems. Int Trans Oper Res 8:155\u2013166","journal-title":"Int Trans Oper Res"},{"key":"52_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":"52_CR9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10288-002-0009-8","volume":"1","author":"J Cordeau","year":"2003","unstructured":"Cordeau J, Laporte G (2003a) The dial-a-ride problem (DARP): variants, modeling issues and algorithms. 4OR 1:89\u2013101","journal-title":"4OR"},{"key":"52_CR10","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 (2003b) 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":"52_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"J Cordeau","year":"2007","unstructured":"Cordeau J, Laporte G (2007) The dial-a-ride problem: models and algorithms. Ann Oper Res 153:29\u201346","journal-title":"Ann Oper Res"},{"key":"52_CR12","unstructured":"Cordeau J, Laporte G, Potvin J, Savelsbergh M (2004) Transportation on demand. Technical report CRT-2004-25, Centre For Research on Transportation"},{"key":"52_CR13","first-page":"622","volume-title":"Proceedings of the 13th mini-Euro conference handling uncertainty in the analysis of traffic and transportation systems and the 9th meeting of the Euro working group on transportation intermodality, sustainability and intelligent transport systems","author":"F Deflorio","year":"2002","unstructured":"Deflorio F, Chiara BD, Murro A (2002) Simulation and performance of DRTS in a realistic environment. In: Proceedings of the 13th mini-Euro conference handling uncertainty in the analysis of traffic and transportation systems and the 9th meeting of the Euro working group on transportation intermodality, sustainability and intelligent transport systems, pp\u00a0622\u2013628"},{"key":"52_CR14","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.trb.2005.09.005","volume":"40","author":"M Diana","year":"2006","unstructured":"Diana M, Dessouky M, Xia N (2006) A model for the fleet sizing of demand responsive transportation services with time windows. Transp Res, Part B 40:651\u2013666","journal-title":"Transp Res, Part B"},{"key":"52_CR15","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/S0191-2615(01)00014-5","volume":"36","author":"L Fu","year":"2002","unstructured":"Fu L (2002a) Scheduling dial-a-ride paratransit under time-varying, stochastic congestion. Transp Res, Part B 36:485\u2013506","journal-title":"Transp Res, Part B"},{"key":"52_CR16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0191-2615(01)00004-2","volume":"36","author":"L Fu","year":"2002","unstructured":"Fu L (2002b) A simulation model for evaluating advanced dial-a-ride paratransit systems. Transp Res, Part A 36:291\u2013307","journal-title":"Transp Res, Part A"},{"key":"52_CR17","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1111\/0885-9507.00150","volume":"14","author":"L Fu","year":"1999","unstructured":"Fu L, Teply S (1999) On-line and off-line routing and scheduling of dial-a-ride paratransit vehicles. Comput-Aided Civ Infrastruct Eng 14:309\u2013319","journal-title":"Comput-Aided Civ Infrastruct Eng"},{"key":"52_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1287\/trsc.8.2.85","volume":"8","author":"M Gerrard","year":"1974","unstructured":"Gerrard M (1974) Comparison of taxi and dial-a-bus services. Transp Sci 8:85\u2013101","journal-title":"Transp Sci"},{"key":"52_CR19","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s12469-008-0006-1","volume":"1","author":"C H\u00e4ll","year":"2009","unstructured":"H\u00e4ll C, Andersson H, Lundgren J, V\u00e4rbrand P (2009) The integrated dial-a-ride problem. Public Transp 1:39\u201354","journal-title":"Public Transp"},{"key":"52_CR20","first-page":"170","volume-title":"Lecture notes in computer science","author":"D Haugland","year":"2010","unstructured":"Haugland D, Ho S (2010) Feasibility testing for dial-a-ride problems. In: Chen B (ed) Lecture notes in computer science, vol 6124. Springer, Berlin, pp 170\u2013179"},{"key":"52_CR21","first-page":"26","volume":"251","author":"K Heathington","year":"1968","unstructured":"Heathington K, Miller J, Knox R, Hoff G, Bruggeman J (1968) Computer simulation of a demand scheduled bus system offering door-to-door service. Highw Res Rec 251:26\u201340","journal-title":"Highw Res Rec"},{"key":"52_CR22","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1007\/s00291-009-0175-6","volume":"33","author":"S Ho","year":"2011","unstructured":"Ho S, Haugland D (2011) Local search heuristics for the probabilistic dial-a-ride problem. OR Spektrum 33:961\u2013988","journal-title":"OR Spektrum"},{"key":"52_CR23","unstructured":"H\u00f6gberg M (2008) On improving paratransit scheduling by using more accurate distance matrices, local search and demand estimation. Master thesis E332, Optimization and Systems Theory, KTH"},{"key":"52_CR24","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0167-6377(02)00120-7","volume":"30","author":"B Hunsaker","year":"2002","unstructured":"Hunsaker B, Savelsbergh M (2002) Efficient feasibility testing for dial-a-ride problems. Oper Res Lett 30:169\u2013173","journal-title":"Oper Res Lett"},{"key":"52_CR25","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":"52_CR26","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":"52_CR27","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02031946","volume":"60","author":"O Madsen","year":"1995","unstructured":"Madsen O, Ravn H, Moberg Rygaard J (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":"52_CR28","first-page":"139","volume-title":"Proc of fourth international workshop on multi-agent-based simulation","author":"I Noda","year":"2003","unstructured":"Noda I, Ohta M, Shinoda K, Kumada Y, Nakashima H (2003) Evaluation of usability of dial-a-ride systems by social simulation. In: Proc of fourth international workshop on multi-agent-based simulation, pp\u00a0139\u2013152"},{"key":"52_CR29","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":"52_CR30","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":"52_CR31","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":"52_CR32","first-page":"718","volume":"42","author":"L Quadrifoglio","year":"2008","unstructured":"Quadrifoglio L, Dessouky M, Ord\u00f3\u00f1ez F (2008) A simulation study of demand responsive transit system design. Transp Res, Part A 42:718\u2013737","journal-title":"Transp Res, Part A"},{"key":"52_CR33","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":"52_CR34","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.orl.2010.05.002","volume":"38","author":"J Tang","year":"2010","unstructured":"Tang J, Kong Y, Lau H, Ip A (2010) A note on \u201cEfficient feasibility testing for dial-a-ride problems\u201d. Oper Res Lett 38:405\u2013407","journal-title":"Oper Res Lett"},{"key":"52_CR35","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0165-0114(99)00035-4","volume":"116","author":"D Teodorovic","year":"2000","unstructured":"Teodorovic D, Radivojevic G (2000) A fuzzy logic approach to dynamic dial-a-ride problem. Fuzzy Sets Syst 116:23\u201333","journal-title":"Fuzzy Sets Syst"},{"key":"52_CR36","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":"52_CR37","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":"52_CR38","first-page":"171","volume-title":"Proceedings of the third conference on applications of simulation","author":"N Wilson","year":"1969","unstructured":"Wilson N, Sussman J, Goodman L, Higonnet B (1969) Simulation of a computer aided routing system (CARS). In: Proceedings of the third conference on applications of simulation, pp 171\u2013183"}],"container-title":["Public Transport"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-012-0052-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12469-012-0052-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12469-012-0052-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T11:16:19Z","timestamp":1559474179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12469-012-0052-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,18]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["52"],"URL":"https:\/\/doi.org\/10.1007\/s12469-012-0052-6","relation":{},"ISSN":["1866-749X","1613-7159"],"issn-type":[{"value":"1866-749X","type":"print"},{"value":"1613-7159","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,18]]}}}