{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T23:02:56Z","timestamp":1768518176815,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,7,26]],"date-time":"2006-07-26T00:00:00Z","timestamp":1153872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2007,3,26]]},"DOI":"10.1007\/s10288-006-0018-0","type":"journal-article","created":{"date-parts":[[2006,7,25]],"date-time":"2006-07-25T08:28:55Z","timestamp":1153816135000},"page":"61-73","source":"Crossref","is-referenced-by-count":57,"title":["An effective and fast heuristic for the Dial-a-Ride problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Roberto Wolfler","family":"Calvo","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Colorni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,7,26]]},"reference":[{"issue":"94\u201395","key":"18_CR1","first-page":"5","volume":"30","author":"E Amaldi","year":"2000","unstructured":"Amaldi E, Colorni A, Fiorenzo Catalano S (2000) Feasibility study of a dial-a-ride system for a suburban area of milan. Ric Oper, 30(94\u201395):5\u201328","journal-title":"Ric Oper,"},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan R, Pardalos PM (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9: 375\u2013382","journal-title":"Oper Res Lett"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Cordeau J-F (2003) A branch and cut algorithm for a dial-a-ride problem. Oper Res (in press)","DOI":"10.1007\/s10288-002-0009-8"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Cordeau J-F, Laporte G (2003a) The dial-a-ride problem (darp): variants, modeling issues and algorithms. 4OR 1:89\u2013101","DOI":"10.1007\/s10288-002-0009-8"},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"J-F Cordeau","year":"2003b","unstructured":"Cordeau J-F, Laporte G (2003b) A tabu search heuristics for the static multi-vehicle dial-a-ride problem. Transp Res B 37:579\u2013594","journal-title":"Transp Res B"},{"key":"18_CR6","unstructured":"Cordone R, Wolfler Calvo R (1996) Note about time window constraints in routing problems. Internal report 96-005. Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Desrosiers J, Dumas Y, Soumis F (1986) A dynamic programming solution of the large-scale single-vehicle Dial-a-Ride problem with time windows. Am J Math Manag Sci 6","DOI":"10.1080\/01966324.1986.10737198"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Desrosiers J, Dumas Y, Solomon MM, Soumis F (1995) Time constrained routing and scheduling. In: Network routing. Handbooks in operations research and management science, vol 8, pp 35\u2013139. North-Holland","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","volume":"54","author":"Y Dumas","year":"1991","unstructured":"Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur J Oper Res 54:7\u201322","journal-title":"Eur J Oper Res"},{"key":"18_CR10","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 MM, Villeneuve D (1995) A request clustering algorithm for dorr-to-door handicapped transportation. Transp Sci 29:63\u201378","journal-title":"Transp Sci"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0191-2615(86)90020-2","volume":"20B","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 20B:243\u2013257","journal-title":"Transp Res"},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","volume":"7","author":"G Kontoravdis","year":"1995","unstructured":"Kontoravdis G, Bard JF (1995) A GRASP for the vehicle routing problem with time windows. ORSA J Comput 7:10\u201323","journal-title":"ORSA J Comput"},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02031946","volume":"60","author":"OBG Madsen","year":"1995","unstructured":"Madsen OBG, Ravn HF, 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":"18_CR14","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulations and traveling salesman problems. J Assoc Comput Mach 7:326\u2013329","journal-title":"J Assoc Comput Mach"},{"issue":"2","key":"18_CR15","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"HN Psaraftis","year":"1980","unstructured":"Psaraftis HN (1980) A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp Sci 14(2):130\u2013154","journal-title":"Transp Sci"},{"issue":"3","key":"18_CR16","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.17.3.351","volume":"17","author":"HN Psaraftis","year":"1983","unstructured":"Psaraftis HN (1983) An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transp Sci 17(3):351\u2013357","journal-title":"Transp Sci"},{"key":"18_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"MWP Savelsbergh","year":"1985","unstructured":"Savelsbergh MWP (1985) Local search in routing problems with time windows. Ann Oper Res 4:285\u2013305","journal-title":"Ann Oper Res"},{"issue":"1","key":"18_CR18","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"MWP Savelsbergh","year":"1995","unstructured":"Savelsbergh MWP, Sol M (1995) The general pickup and delivery problem. Transp Sci 29(1):17\u201329","journal-title":"Transp Sci"},{"key":"18_CR19","first-page":"369","volume":"6","author":"T Sexton","year":"1986","unstructured":"Sexton T, Choi Y (1986) Pick-up and delivery of partial loads sith time windows. Am J Math Manag Sci 6:369\u2013398","journal-title":"Am J Math Manag Sci"},{"issue":"1","key":"18_CR20","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(1):60\u201371","journal-title":"Transp Sci"},{"issue":"1","key":"18_CR21","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/trsc.34.1.113.12284","volume":"34","author":"R Wolfler Calvo","year":"2000","unstructured":"Wolfler Calvo R (2000) A new heuristic for the traveling salesman problem with time windows. Transp Sci 34(1):113\u2013124","journal-title":"Transp Sci"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0018-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-006-0018-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0018-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:54Z","timestamp":1559131974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-006-0018-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,26]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,26]]}},"alternative-id":["18"],"URL":"https:\/\/doi.org\/10.1007\/s10288-006-0018-0","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,26]]}}}