{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T06:03:22Z","timestamp":1773122602843,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,9,26]],"date-time":"2007-09-26T00:00:00Z","timestamp":1190764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["cent.eur.j.oper.res."],"published-print":{"date-parts":[[2007,11]]},"DOI":"10.1007\/s10100-007-0035-x","type":"journal-article","created":{"date-parts":[[2007,9,25]],"date-time":"2007-09-25T11:36:01Z","timestamp":1190720161000},"page":"329-349","source":"Crossref","is-referenced-by-count":31,"title":["Real-time split-delivery pickup and delivery time window problems with transfers"],"prefix":"10.1007","volume":"15","author":[{"given":"Sam R.","family":"Thangiah","sequence":"first","affiliation":[]},{"given":"Adel","family":"Fergany","sequence":"additional","affiliation":[]},{"given":"Salman","family":"Awan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,26]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"L Bodin","year":"1983","unstructured":"Bodin L, Golden BL and Assad AA (1983). The state of the art in the routing and scheduling of vehicles and crews. Comput Oper Res 10: 63\u2013211","journal-title":"Comput Oper Res"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Cordeau J-F, Desaulniers G, Desrosiers J, Solomon MM, Soumis F (2002a) The VRP with time windows. In: Toth P, Vigo D (eds) The vehicle routing problem. Society for Industrial and Applied Mathematics, pp 157\u2013193","DOI":"10.1137\/1.9780898718515.ch7"},{"key":"35_CR3","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J-F Cordeau","year":"2002","unstructured":"Cordeau J-F, Gendreau M, Laporte G, Potvin J-Y and Semet F (2002b). A guide to vehicle routing heuristics. J Oper Res Soc 53: 512\u2013522","journal-title":"J Oper Res Soc"},{"key":"35_CR4","unstructured":"Cordeau J-F, Laporte G (2003) The dial-a-ride problem (DARP): variants, modeling issues and algorithms (Belgian, French and Italian). 4OR Q J Oper Res Soc 1:89\u2013101"},{"key":"35_CR5","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"GN Frederickson","year":"1978","unstructured":"Frederickson GN, Hecht MS and Kim CE (1978). Approximation algorithms for some routing problems. SIAM J Comput 7: 178\u2013193","journal-title":"SIAM J Comput"},{"key":"35_CR6","unstructured":"Garey MR, Johnson DS (1976) Approximation algorithms for combinatorial problems: an annotated bibliography. In: Traub JF (ed) Algorithms and complexity: recent result and new directions. Academic, London, pp 41\u201352"},{"key":"35_CR7","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/trsc.33.4.381","volume":"33","author":"M Gendreau","year":"1999","unstructured":"Gendreau M, Guertin F, Potvin J-Y and Taillard E (1999). Parallel Tabu search for real-time vehicle routing and dispatching. Transp Sci 33: 381\u2013390","journal-title":"Transp Sci"},{"key":"35_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0191-2615(86)90020-2","volume":"20","author":"JW Jaw","year":"1986","unstructured":"Jaw JW, Odoni OR, Psaraftis P and Wilson NH (1986). A heuristic algorithm for multiple-vehicle advance request dial-a-ride problem with time windows. Transp Res 20: 243\u2013257","journal-title":"Transp Res"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher WM (eds) Complexity of computer computations. Plenum Press, New York, pp 85\u2013104","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"35_CR10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992a). The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59: 231\u2013247","journal-title":"Eur J Oper Res"},{"key":"35_CR11","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992b). The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59: 345\u2013358","journal-title":"Eur J Oper Res"},{"key":"35_CR12","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02098290","volume":"61","author":"G Laporte","year":"1995","unstructured":"Laporte G and Osman IH (1995). Routing problems: a bibliography. Ann Oper Res 61: 227\u2013262","journal-title":"Ann Oper Res"},{"key":"35_CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J Lenstra","year":"1981","unstructured":"Lenstra J and Rinnooy Kan AHG (1981). Complexity of the vehicle routing and scheduling problems. Networks 11: 221\u2013228","journal-title":"Networks"},{"key":"35_CR14","unstructured":"Potvin J-Y, Thangiah SR (1999) Vehicle routing through simulation of natural processes. In: Jain LC, Martin NM (eds) Fusion of neural networks, fuzzy sets and genetic algorithm. CRC Press, pp 143\u2013165"},{"key":"35_CR15","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"2","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 2: 130\u2013150","journal-title":"Transp Sci"},{"key":"35_CR16","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.17.3.351","volume":"3","author":"HN Psaraftis","year":"1983","unstructured":"Psaraftis HN (1983a). An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transp Sci 3: 351\u2013357","journal-title":"Transp Sci"},{"key":"35_CR17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0191-2615(83)90041-3","volume":"17","author":"HN Psaraftis","year":"1983","unstructured":"Psaraftis HN (1983b). Analysis of O(N2) heuristic for the single vehicle many-to-many euclidean dial-a-ride problem. Transp Res B 17: 133\u2013145","journal-title":"Transp Res B"},{"key":"35_CR18","unstructured":"Psaraftis HN (1988) Dynamic vehicle routing problems. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. North Holland, Amsterdam, pp 223\u2013248"},{"key":"35_CR19","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"MWP Savelsbergh","year":"1995","unstructured":"Savelsbergh MWP and Sol M (1995). The general pickup and delivery problem. Transp Sci 29: 17\u201329","journal-title":"Transp Sci"},{"key":"35_CR20","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/0360-8352(95)00181-6","volume":"30","author":"JS Shang","year":"1996","unstructured":"Shang JS and Cuff CK (1996). Multicriteria pickup and delivery problem with transfer opportunity. J Comput Ind Eng 30: 631\u2013645","journal-title":"J Comput Ind Eng"},{"key":"35_CR21","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35: 254\u2013265","journal-title":"Oper Res"},{"key":"35_CR22","doi-asserted-by":"crossref","unstructured":"Thangiah SR, Petrovic P (1998) Introduction to genetic heuristics and vehicle routing problems with complex constraints. In: Woodruff D (ed) Advances in computational and stochastic optimization, logic programming, and heuristic search. Kluwer, pp 253\u2013286","DOI":"10.1007\/978-1-4757-2807-1_10"},{"key":"35_CR23","unstructured":"Wilson NHM, Colvin NH (1977) Computer control of Rochester dial-a-ride system. Report R77-30, Department of Civil Engineering, MIT, Cambridge"},{"key":"35_CR24","unstructured":"Wilson NHM, Sussman JM (1971) Scheduling algorithms for dial-a-ride systems. Urban Systems Laboratory report USL TR-70-13. MIT, Cambridge"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-007-0035-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-007-0035-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-007-0035-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:25Z","timestamp":1559108965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-007-0035-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,26]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,11]]}},"alternative-id":["35"],"URL":"https:\/\/doi.org\/10.1007\/s10100-007-0035-x","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,26]]}}}