{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T22:27:30Z","timestamp":1769812050408,"version":"3.49.0"},"reference-count":103,"publisher":"Elsevier","isbn-type":[{"value":"9780444513465","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1016\/s0927-0507(06)14007-4","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T14:23:13Z","timestamp":1164637393000},"page":"429-466","source":"Crossref","is-referenced-by-count":63,"title":["Chapter 7 Transportation on Demand"],"prefix":"10.1016","author":[{"given":"Jean-Fran\u00e7ois","family":"Cordeau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Yves","family":"Potvin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin W.P.","family":"Savelsbergh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0927-0507(06)14007-4_bib001","series-title":"Police Field Operations","author":"Adams","year":"1997"},{"key":"10.1016\/S0927-0507(06)14007-4_bib002","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1080\/03081068608717342","article-title":"Scheduling of vehicles for transportation of elderly","volume":"11","author":"Alfa","year":"1986","journal-title":"Transportation Planning and Technology"},{"key":"10.1016\/S0927-0507(06)14007-4_bib003","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.parco.2003.12.001","article-title":"Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem","volume":"30","author":"Attanasio","year":"2004","journal-title":"Parallel Computing"},{"key":"10.1016\/S0927-0507(06)14007-4_bib004","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01585767","article-title":"The precedence-constrained asymmetric traveling salesman polytope","volume":"68","author":"Balas","year":"1995","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0927-0507(06)14007-4_bib005","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1002\/net.10079","article-title":"An exact algorithm for the traveling salesman problem with deliveries and collections","volume":"42","author":"Baldacci","year":"2003","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(06)14007-4_bib006","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1287\/opre.41.1.18","article-title":"A reliability model applied to emergency service vehicle location","volume":"41","author":"Ball","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib007","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1287\/trsc.23.4.277","article-title":"The maximal expected covering location problem: Revisited","volume":"23","author":"Batta","year":"1989","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib008","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.1040.0124","article-title":"Scenario-based planning for partially dynamic vehicle routing with stochastic customers","volume":"52","author":"Bent","year":"2004","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib009","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1109\/3468.668962","article-title":"Decision support for vehicle dispatching using genetic programming","volume":"28","author":"Benyahia","year":"1998","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"10.1016\/S0927-0507(06)14007-4_bib010","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1287\/opre.39.4.601","article-title":"A stochastic and dynamic vehicle routing problem in the Euclidean plane","volume":"39","author":"Bertsimas","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib011","first-page":"19","article-title":"Exact and heuristic procedures for the traveling salesman problem with precedence constraints, based on dynamic programming","volume":"32","author":"Bianco","year":"1994","journal-title":"INFOR"},{"key":"10.1016\/S0927-0507(06)14007-4_bib012","first-page":"73","article-title":"The multi-vehicle subscriber dial-a-ride problem","volume":"26","author":"Bodin","year":"1986","journal-title":"TIMS Studies in Management Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib013","series-title":"Computer-Aided Transit Scheduling","first-page":"391","article-title":"Telebus Berlin: Vehicle scheduling in a dial-a-ride system","volume":"vol. 471","author":"Bornd\u00f6rfer","year":"1999"},{"key":"10.1016\/S0927-0507(06)14007-4_bib014","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/S0377-2217(02)00364-8","article-title":"Ambulance location and relocation models","volume":"147","author":"Brotcorne","year":"2003","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib015","unstructured":"Campbell, A., Savelsbergh, M.W.P. (2003). Incentive schemes for attended home delivery services. Technical Report TLI-03-04, Georgia Institute of Technology, The Logistics Institute"},{"key":"10.1016\/S0927-0507(06)14007-4_bib016","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1287\/trsc.1040.0105","article-title":"Decision support for consumer direct grocery initiatives","volume":"39","author":"Campbell","year":"2005","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib017","unstructured":"Christofides, N. (1976). Worst case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA"},{"key":"10.1016\/S0927-0507(06)14007-4_bib018","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01942293","article-title":"The maximal covering location problem","volume":"32","author":"Church","year":"1974","journal-title":"Papers of the Regional Science Association"},{"key":"10.1016\/S0927-0507(06)14007-4_bib019","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.1060.0283","article-title":"A branch-and-cut algorithm for the dial-a-ride problem","volume":"54","author":"Cordeau","year":"2006","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib020","first-page":"89","article-title":"The dial-a-ride problem (DARP): Variants, modeling issues and algorithms","volume":"1","author":"Cordeau","year":"2003","journal-title":"4OR \u2013 Quarterly Journal of the Belgian, French and Italian Operations Research Societies"},{"key":"10.1016\/S0927-0507(06)14007-4_bib021","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","article-title":"A tabu search heuristic for the static multi-vehicle dial-a-ride problem","volume":"37","author":"Cordeau","year":"2003","journal-title":"Transportation Research B"},{"key":"10.1016\/S0927-0507(06)14007-4_bib022","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","article-title":"A tabu search heuristic for periodic and multi-depot vehicle routing problems","volume":"30","author":"Cordeau","year":"1997","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(06)14007-4_bib023","unstructured":"Coslovich, L., Pesenti, R., Ukovich, W. (2003). A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. Technical report, Universit\u00e0 di Trieste, Italy"},{"key":"10.1016\/S0927-0507(06)14007-4_bib024","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230110206","article-title":"Set partitioning based heuristics for interactive routing","volume":"11","author":"Cullen","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(06)14007-4_bib025","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1287\/trsc.17.1.48","article-title":"A maximum expected location model: Formulation, properties and heuristic solution","volume":"7","author":"Daskin","year":"1983","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib026","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1287\/trsc.15.2.137","article-title":"A hierarchical objective set covering model for emergency medical service vehicle deployment","volume":"15","author":"Daskin","year":"1981","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib027","series-title":"The Vehicle Routing Problem","first-page":"225","article-title":"VRP with pickup and delivery","author":"Desaulniers","year":"2002"},{"key":"10.1016\/S0927-0507(06)14007-4_bib028","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1080\/01966324.1986.10737198","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":"American Journal of Mathematical and Management Sciences"},{"key":"10.1016\/S0927-0507(06)14007-4_bib029","unstructured":"Desrosiers, J., Dumas, Y., Soumis, F., Taillefer, S., Villeneuve, D. (1991). An algorithm for mini-clustering in handicapped transport. Technical Report G-91-22, GERAD, HEC Montr\u00e9al"},{"key":"10.1016\/S0927-0507(06)14007-4_bib030","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0968-090X(95)00010-G","article-title":"Autonomous dial-a-ride transit introductory overview","volume":"3","author":"Dial","year":"1995","journal-title":"Transportation Research C"},{"key":"10.1016\/S0927-0507(06)14007-4_bib031","unstructured":"Dumas, Y., Desrosiers, J., Soumis, F. (1989). Large scale multi-vehicle dial-a-ride problems. Technical Report G-89-30, GERAD, HEC Montr\u00e9al"},{"key":"10.1016\/S0927-0507(06)14007-4_bib032","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/trsc.24.2.145","article-title":"Optimizing the schedule for a fixed vehicle path with convex inconvenience costs","volume":"24","author":"Dumas","year":"1990","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib033","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","article-title":"The pickup and delivery problem with time windows","volume":"54","author":"Dumas","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib034","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/opre.37.2.319","article-title":"An additive bounding procedure for combinatorial optimization problems","volume":"37","author":"Fischetti","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib035","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/S0191-2615(01)00014-5","article-title":"Scheduling dial-a-ride paratransit under time-varying, stochastic congestion","volume":"36","author":"Fu","year":"2002","journal-title":"Transportation Research B"},{"key":"10.1016\/S0927-0507(06)14007-4_bib036","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0377-2217(87)90130-5","article-title":"Ambulance deployment analysis: A case study of Bangkok","volume":"31","author":"Fujiwara","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib037","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0927-0507(06)14007-4_bib038","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0966-8349(97)00015-6","article-title":"Solving an ambulance location model by tabu search","volume":"5","author":"Gendreau","year":"1997","journal-title":"Location Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib039","unstructured":"Gendreau, M., Guertin, F., Potvin, J.-Y., S\u00e9guin, R. (1998). Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Technical Report CRT-98-10, Centre de recherche sur les transports, Montreal"},{"key":"10.1016\/S0927-0507(06)14007-4_bib040","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/S0305-0548(98)00085-9","article-title":"Heuristics for the traveling salesman problem with pickup and delivery","volume":"26","author":"Gendreau","year":"1999","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib041","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1016\/S0167-8191(01)00103-X","article-title":"A dynamic model and parallel tabu search heuristic for real-time ambulance relocation","volume":"27","author":"Gendreau","year":"2001","journal-title":"Parallel Computing"},{"key":"10.1016\/S0927-0507(06)14007-4_bib042","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","article-title":"Ejection chains, reference structures and alternating path methods for traveling salesman problems","volume":"65","author":"Glover","year":"1996","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0927-0507(06)14007-4_bib043","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0377-2217(90)90402-W","article-title":"Validating and applying a model for locating emergency medical services in Tucson, AZ","volume":"49","author":"Goldberg","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib044","series-title":"The Traveling Salesman Problem","first-page":"251","article-title":"Polyhedral theory","author":"Gr\u00f6tschel","year":"1985"},{"key":"10.1016\/S0927-0507(06)14007-4_bib045","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0377-2217(93)E0292-6","article-title":"A new extension of local search applied to the dial-a-ride problem","volume":"83","author":"Healy","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib046","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.dam.2003.09.013","article-title":"A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery","volume":"145","author":"Hern\u00e1ndez-P\u00e9rez","year":"2004","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0927-0507(06)14007-4_bib047","doi-asserted-by":"crossref","first-page":"1434","DOI":"10.1287\/mnsc.32.11.1434","article-title":"Concepts and applications of backup coverage","volume":"34","author":"Hogan","year":"1986","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib048","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1992"},{"key":"10.1016\/S0927-0507(06)14007-4_bib049","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0968-090X(01)00003-1","article-title":"Fleet scheduling and dispatching for demand-responsive passenger services","volume":"10","author":"Horn","year":"2002","journal-title":"Transportation Research C"},{"key":"10.1016\/S0927-0507(06)14007-4_bib050","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0167-6377(02)00120-7","article-title":"Efficient testing for dial-a-ride problems","volume":"30","author":"Hunsaker","year":"2002","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0927-0507(06)14007-4_bib051","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/trsc.29.1.63","article-title":"A request clustering algorithm for door-to-door handicapped transportation","volume":"29","author":"Ioachim","year":"1995","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib052","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":"20","author":"Jaw","year":"1986","journal-title":"Transportation Research B"},{"key":"10.1016\/S0927-0507(06)14007-4_bib053","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0377-2217(85)90257-7","article-title":"An algorithm for the traveling salesman problem with pickup and delivery customers","volume":"22","author":"Kalantari","year":"1985","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib054","series-title":"Genetic Programming","author":"Koza","year":"1992"},{"key":"10.1016\/S0927-0507(06)14007-4_bib055","series-title":"Urban Police Patrol Analysis","author":"Larson","year":"1972"},{"key":"10.1016\/S0927-0507(06)14007-4_bib056","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0305-0548(74)90076-8","article-title":"A hypercube qeueing model for facility location and redistricting in urban emergency services","volume":"1","author":"Larson","year":"1974","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib057","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1142\/S0218213002000988","article-title":"Pickup and delivery with time windows: Algorithms and test case generation","volume":"11","author":"Lau","year":"2002","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"10.1016\/S0927-0507(06)14007-4_bib058","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1111\/j.1475-3995.1997.tb00094.x","article-title":"Genetic algorithms for vehicle dispatching","volume":"4","author":"Leclerc","year":"1997","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib059","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the travelling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/S0927-0507(06)14007-4_bib060","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling-salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib061","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","article-title":"An algorithm for the traveling salesman problem","volume":"11","author":"Little","year":"1963","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib062","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02031946","article-title":"A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives","volume":"60","author":"Madsen","year":"1995","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib063","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0966-8349(98)00058-8","article-title":"Covering models for two-tiered emergency medical services systems","volume":"6","author":"Mandell","year":"1998","journal-title":"Location Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib064","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0038-0121(94)90003-5","article-title":"The queueing probabilistic location set covering problem and some extensions","volume":"28","author":"Marianov","year":"1994","journal-title":"Socio-Economic Planning Sciences"},{"key":"10.1016\/S0927-0507(06)14007-4_bib065","series-title":"Facility Location","first-page":"199","article-title":"Siting emergency services","author":"Marianov","year":"1995"},{"key":"10.1016\/S0927-0507(06)14007-4_bib066","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/j.trb.2003.09.002","article-title":"Waiting strategies for the dynamic pickup and delivery problem with time windows","volume":"38","author":"Mitrovi\u0107-Mini\u0107","year":"2004","journal-title":"Transportation Research B"},{"key":"10.1016\/S0927-0507(06)14007-4_bib067","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1016\/j.trb.2003.09.001","article-title":"Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows","volume":"38","author":"Mitrovi\u0107-Mini\u0107","year":"2004","journal-title":"Transportation Research B"},{"key":"10.1016\/S0927-0507(06)14007-4_bib068","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","article-title":"Solving the pickup and delivery problem with time windows using reactive tabu search","volume":"34","author":"Nanry","year":"2000","journal-title":"Transportation Research B"},{"key":"10.1016\/S0927-0507(06)14007-4_bib069","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.14.2.130","article-title":"A dynamic programming approach to the single-vehicle, many-to-many immediate request dial-a-ride problem","volume":"14","author":"Psaraftis","year":"1980","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib070","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":"17","author":"Psaraftis","year":"1983","journal-title":"Transportation Research B"},{"key":"10.1016\/S0927-0507(06)14007-4_bib071","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 Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib072","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":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib073","series-title":"Vehicle Routing: Methods and Studies","first-page":"223","article-title":"Dynamic vehicle routing problems","author":"Psaraftis","year":"1988"},{"key":"10.1016\/S0927-0507(06)14007-4_bib074","series-title":"Meta-Heuristics: Theory & Applications","first-page":"661","article-title":"A parallel tabu search algorithm using ejection chains for the vehicle routing problem","author":"Rego","year":"1996"},{"key":"10.1016\/S0927-0507(06)14007-4_bib075","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1287\/ijoc.8.2.134","article-title":"A fast composite heuristic for the symmetric traveling salesman problem","volume":"8","author":"Renaud","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0927-0507(06)14007-4_bib076","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/S0305-0548(99)00066-0","article-title":"A heuristic for the pickup and delivery traveling salesman problem","volume":"27","author":"Renaud","year":"2000","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib077","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1016\/S0305-0548(00)00109-X","article-title":"Perturbation heuristics for the pickup and delivery traveling salesman problem","volume":"29","author":"Renaud","year":"2002","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib078","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0377-2217(94)90297-6","article-title":"Developing and validating a decision support system for locating emergency medical vehicles in Louisville, Kentucky","volume":"75","author":"Repede","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib079","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/trsc.23.3.192","article-title":"The maximum availability location problem","volume":"23","author":"ReVelle","year":"1989","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib080","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","article-title":"Probabilistic diversification and intensification in local search for vehicle routing","volume":"1","author":"Rochat","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0927-0507(06)14007-4_bib081","unstructured":"Ropke, S., Pisinger, D. (2004). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Technical Report 2004-13, DIKU, University of Copenhagen"},{"key":"10.1016\/S0927-0507(06)14007-4_bib082","unstructured":"Ruland, K.S. (1995). Polyhedral solution to the pickup and delivery problem. PhD thesis, Sever Institute of Technology, Washington University"},{"key":"10.1016\/S0927-0507(06)14007-4_bib083","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0898-1221(97)00090-4","article-title":"The pickup and delivery problem: Faces and branch-and-cut algorithm","volume":"33","author":"Ruland","year":"1997","journal-title":"Computers and Mathematics with Applications"},{"key":"10.1016\/S0927-0507(06)14007-4_bib084","series-title":"Parallel Distributed Processing, vol. 1","first-page":"318","article-title":"Learning internal representations by error propagation","author":"Rumelhart","year":"1986"},{"key":"10.1016\/S0927-0507(06)14007-4_bib085","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02022044","article-title":"Local search in routing problems with time windows","volume":"4","author":"Savelsbergh","year":"1985","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib086","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0377-2217(90)90091-O","article-title":"An efficient implementation of local search algorithms for constrained routing problems","volume":"47","author":"Savelsbergh","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib087","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","article-title":"The vehicle routing problem with time windows: Minimizing route duration","volume":"4","author":"Savelsbergh","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0927-0507(06)14007-4_bib088","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","article-title":"The general pickup and delivery problem","volume":"29","author":"Savelsbergh","year":"1995","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib089","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","article-title":"DRIVE: Dynamic routing of independent vehicles","volume":"46","author":"Savelsbergh","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib090","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1287\/trsc.13.2.163","article-title":"The TEAM FLEET models for simultaneous facility and equipment siting","volume":"13","author":"Schilling","year":"1979","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib091","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 Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib092","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 Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib093","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02098288","article-title":"A computer assistant for vehicle dispatching with learning capabilities","volume":"61","author":"Shen","year":"1995","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib094","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 Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib095","series-title":"Operations Research and the Public Sector","first-page":"151","article-title":"The deployment of police, fire, and emergency medical units","volume":"vol. 6","author":"Swersey","year":"1994"},{"key":"10.1016\/S0927-0507(06)14007-4_bib096","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0377-2217(98)00260-4","article-title":"A stochastic and dynamic model for the single-vehicle pick-up and delivery problem","volume":"114","author":"Swihart","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib097","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0165-0114(99)00035-4","article-title":"A fuzzy logic approach to dynamic dial-a-ride problem","volume":"116","author":"Teodorovic","year":"2000","journal-title":"Fuzzy Sets and Systems"},{"key":"10.1016\/S0927-0507(06)14007-4_bib098","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","article-title":"The location of emergency service facilities","volume":"19","author":"Toregas","year":"1971","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14007-4_bib099","series-title":"Meta-Heuristics: Theory & Applications","first-page":"677","article-title":"Fast local search algorithms for the handicapped persons transportation problem","author":"Toth","year":"1996"},{"key":"10.1016\/S0927-0507(06)14007-4_bib100","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1287\/trsc.31.1.60","article-title":"Heuristic algorithms for the handicapped persons transportation problem","volume":"31","author":"Toth","year":"1997","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib101","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1287\/trsc.27.3.298","article-title":"Variable-depth search for the single-vehicle pickup and delivery problem with time windows","volume":"27","author":"Van der Bruggen","year":"1993","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14007-4_bib102","series-title":"Fire Department Deployment Analysis","author":"Walker","year":"1979"},{"key":"10.1016\/S0927-0507(06)14007-4_bib103","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/trsc.37.3.347.16044","article-title":"Solving a practical pickup and delivery problem","volume":"37","author":"Xu","year":"2003","journal-title":"Transportation Science"}],"container-title":["Handbooks in Operations Research and Management Science","Transportation"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,1,11]],"date-time":"2019-01-11T09:51:32Z","timestamp":1547200292000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0927050706140074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9780444513465"],"references-count":103,"URL":"https:\/\/doi.org\/10.1016\/s0927-0507(06)14007-4","relation":{},"ISSN":["0927-0507"],"issn-type":[{"value":"0927-0507","type":"print"}],"subject":[],"published":{"date-parts":[[2007]]}}}