{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T05:25:58Z","timestamp":1772774758528,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00291-010-0229-9","type":"journal-article","created":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T15:52:20Z","timestamp":1289231540000},"page":"593-633","source":"Crossref","is-referenced-by-count":91,"title":["Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints"],"prefix":"10.1007","volume":"34","author":[{"given":"Sophie N.","family":"Parragh","sequence":"first","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Cordeau","sequence":"additional","affiliation":[]},{"given":"Karl F.","family":"Doerner","sequence":"additional","affiliation":[]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,9]]},"reference":[{"key":"229_CR1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s00291-008-0135-6","volume":"32","author":"A Beaudry","year":"2009","unstructured":"Beaudry A, Laporte G, Melo T, Nickel S (2009) Dynamic transportation of patients to hospitals. OR Spectrum 32: 77\u2013107","journal-title":"OR Spectrum"},{"key":"229_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G Berbeglia","year":"2007","unstructured":"Berbeglia G, Cordeau J-F, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: a classification scheme and survey. TOP 15: 1\u201331","journal-title":"TOP"},{"key":"229_CR3","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-F, Laporte G (2010) Dynamic pickup and delivery problems. Eur J Oper Res 202: 8\u201315","journal-title":"Eur J Oper Res"},{"key":"229_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V C\u0306erny","year":"1985","unstructured":"C\u0306erny V (1985) Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. J Opt Theory Appl 45: 41\u201351","journal-title":"J Opt Theory Appl"},{"key":"229_CR5","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"J-F Cordeau","year":"2006","unstructured":"Cordeau J-F (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper Res 54: 573\u2013586","journal-title":"Oper Res"},{"key":"229_CR6","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"J-F Cordeau","year":"2003","unstructured":"Cordeau J-F, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transport Res B Meth 37: 579\u2013594","journal-title":"Transport Res B Meth"},{"key":"229_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"J-F Cordeau","year":"2007","unstructured":"Cordeau J-F, Laporte G (2007) The dial-a-ride problem: models and algorithms. Ann Oper Res 153: 29\u201346","journal-title":"Ann Oper Res"},{"key":"229_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/0-387-25486-2_4","volume-title":"Column generation","author":"E Danna","year":"2005","unstructured":"Danna E, Lepape C (2005) Branch-and-price heuristics: a case study on the vehicle routing problem with time windows. In: Desaulniers G, Desrosiers J, Solomon MM (eds) Column generation. Springer, New York, pp 99\u2013129"},{"issue":"3","key":"229_CR9","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1287\/trsc.34.3.312.12298","volume":"34","author":"G Desaulniers","year":"2000","unstructured":"Desaulniers G, Villeneuve D (2000) The shortest path problem with time windows and linear waiting costs. Transport Sci 34(3): 312\u2013319","journal-title":"Transport Sci"},{"key":"229_CR10","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40: 342\u2013354","journal-title":"Oper Res"},{"key":"229_CR11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F Glover","year":"1996","unstructured":"Glover F (1996) Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Appl Math 65: 223\u2013253","journal-title":"Discrete Appl Math"},{"key":"229_CR12","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1287\/inte.1080.0379","volume":"39","author":"T Hanne","year":"2009","unstructured":"Hanne T, Melo T, Nickel S (2009) Bringing robustness to patient flow management through optimized patient transports in hospitals. Interfaces 39: 241\u2013255","journal-title":"Interfaces"},{"key":"229_CR13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s00291-007-0083-6","volume":"30","author":"S Irnich","year":"2008","unstructured":"Irnich S (2008) Resource extension functions: properties, inversion, and generalization to segments. OR Spectrum 30: 113\u2013148","journal-title":"OR Spectrum"},{"key":"229_CR14","volume-title":"Column generation","author":"B Kallehauge","year":"2005","unstructured":"Kallehauge B, Larsen J, Madsen OBG, Solomon MM (2005) Vehicle routing problems with time windows. In: Desaulniers G, Desrosiers J, Solomon MM (eds) Column generation. Springer, New York"},{"key":"229_CR15","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220: 671\u2013680","journal-title":"Science"},{"key":"229_CR16","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1016\/j.cor.2005.03.024","volume":"34","author":"E Melachrinoudis","year":"2007","unstructured":"Melachrinoudis E, Ilhan AB, Min H (2007) A dial-a-ride problem for client transportation in a health-care organization. Comput Oper Res 34: 742\u2013759","journal-title":"Comput Oper Res"},{"key":"229_CR17","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24: 1097\u20131100","journal-title":"Comput Oper Res"},{"key":"229_CR18","unstructured":"Parragh SN (2009) Ambulance routing problems with rich constraints and multiple objectives. PhD thesis, University of Vienna, Faculty of Business, Economics and Statistics"},{"key":"229_CR19","doi-asserted-by":"crossref","unstructured":"Parragh SN (2010) Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transp Res C Emer (to appear)","DOI":"10.1016\/j.trc.2010.06.002"},{"key":"229_CR20","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/net.20335","volume":"54","author":"SN Parragh","year":"2009","unstructured":"Parragh SN, Doerner KF, Gandibleux X, Hartl RF (2009) A heuristic two-phase solution method for the multi-objective dial-a-ride problem. Networks 54: 227\u2013242","journal-title":"Networks"},{"key":"229_CR21","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh SN, Doerner KF, Hartl RF (2008a) A survey on pickup and delivery problems. Part I: transportation between customers and depot. J Betriebswirtschaft 58: 21\u201351","journal-title":"J Betriebswirtschaft"},{"key":"229_CR22","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh SN, Doerner KF, Hartl RF (2008b) A survey on pickup and delivery problems. Part II: transportation between pickup and delivery locations. J Betriebswirtschaft 58: 81\u2013117","journal-title":"J Betriebswirtschaft"},{"key":"229_CR23","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1016\/j.cor.2009.10.003","volume":"37","author":"SN Parragh","year":"2010","unstructured":"Parragh SN, Doerner KF, Hartl RF (2010) Variable neighborhood search for the dial-a-ride problem. Comput Oper Res 37: 1129\u20131138","journal-title":"Comput Oper Res"},{"key":"229_CR24","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/j.engappai.2005.12.013","volume":"19","author":"B Rekiek","year":"2006","unstructured":"Rekiek B, Delchambre A, Saleh HA (2006) Handicapped person transportation: an application of the grouping genetic algorithm. Eng Appl Artif Intel 19: 511\u2013520","journal-title":"Eng Appl Artif Intel"},{"key":"229_CR25","unstructured":"Ropke S (2005) Heuristic and exact algorithms for vehicle routing problems. PhD thesis, Computer Science Department at the University of Copenhagen (DIKU)"},{"key":"229_CR26","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.1090.0272","volume":"43","author":"S Ropke","year":"2009","unstructured":"Ropke S, Cordeau J-F (2009) Branch-and-cut-and-price for the pickup and delivery problem with time windows. Transport Sci 43: 267\u2013286","journal-title":"Transport Sci"},{"key":"229_CR27","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S Ropke","year":"2007","unstructured":"Ropke S, Cordeau J-F, 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":"229_CR28","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"MWP Savelsbergh","year":"1992","unstructured":"Savelsbergh MWP (1992) The vehicle routing problem with time windows: minimizing route duration. ORSA J Comput 4: 146\u2013154","journal-title":"ORSA J Comput"},{"key":"229_CR29","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","volume":"46","author":"MWP Savelsbergh","year":"1998","unstructured":"Savelsbergh MWP, Sol M (1998) DRIVE: dynamic routing of independent vehicles. Oper Res 46: 474\u2013490","journal-title":"Oper Res"},{"key":"229_CR30","doi-asserted-by":"crossref","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Proceedings CP-98 (fourth international conference on principles and practice of constraint programming)","DOI":"10.1007\/3-540-49481-2_30"},{"key":"229_CR31","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. Transport Sci 31: 60\u201371","journal-title":"Transport Sci"},{"key":"229_CR32","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/trsc.37.3.347.16044","volume":"37","author":"H Xu","year":"2003","unstructured":"Xu H, Chen Z-L, Rajagopal S, Arunapuram S (2003) Solving a practical pickup and delivery problem. Transport Sci 37: 347\u2013364","journal-title":"Transport Sci"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s00291-010-0229-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T06:54:41Z","timestamp":1636786481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-010-0229-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,9]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["229"],"URL":"https:\/\/doi.org\/10.1007\/s00291-010-0229-9","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,9]]}}}