{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:07:32Z","timestamp":1746072452141,"version":"3.40.4"},"publisher-location":"Heidelberg","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319004099"},{"type":"electronic","value":"9783319004105"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-00410-5_3","type":"book-chapter","created":{"date-parts":[[2013,4,10]],"date-time":"2013-04-10T03:00:38Z","timestamp":1365562838000},"page":"31-50","source":"Crossref","is-referenced-by-count":2,"title":["Constraint Propagation for the Dial-a-Ride Problem with Split Loads"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Deleplanque","sequence":"first","affiliation":[]},{"given":"Alain","family":"Quilliot","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.parco.2003.12.001","volume":"30","author":"G. Ghiani","year":"2004","unstructured":"Ghiani, G., Laporte, G., Attanasio, A., Cordeau, J.F.: Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing\u00a030(3), 377\u2013387 (2004)","journal-title":"Parallel Computing"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/trsc.1040.0103","volume":"40","author":"A. Hertz","year":"2006","unstructured":"Hertz, A., Archetti, C., Speranza, M.G.: A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science\u00a040(1), 64\u201373 (2006)","journal-title":"Transportation Science"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Speranza, M.G., Archetti, C.: The split delivery vehicle routing problem: A survey. In: The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 103\u2013122. Springer US (2008)","DOI":"10.1007\/978-0-387-77778-8_5"},{"key":"3_CR4","unstructured":"Chevrier, R.: Optimisation de transport \u00e0 la demande dans des territoires polaris\u00e9s. PhD. Thesis. Universit\u00e9 d\u2019Avignon et des Pays de Vaucluse, 242 p. (2008)"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"J.-F. Cordeau","year":"2006","unstructured":"Cordeau, J.-F.: A branch-and-cut algorithm for the dial-a-ride. Operation Research\u00a054(3), 573\u2013586 (2006)","journal-title":"Operation Research"},{"key":"3_CR6","doi-asserted-by":"publisher","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.: A heuristic algorithm for the multi-vehicle many-to-many advance request dial-a-ride problem. Transportation Research B\u00a020B, 243\u2013257 (1986)","journal-title":"Transportation Research B"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"G. Laporte","year":"2003","unstructured":"Laporte, G., Cordeau, J.-F.: A tabu search heuristic algorithm for the static multi-vehicle dial-a-ride problem. Transportation Research B\u00a037, 579\u2013594 (2003)","journal-title":"Transportation Research B"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/03052159808941240","volume":"30","author":"J.R. Stone","year":"1998","unstructured":"Stone, J.R., Baugh Jr., J.W., Kakivaya, D.K.R.: Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Engineering Optimization\u00a030(2), 91\u2013124 (1998)","journal-title":"Engineering Optimization"},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1287\/trsc.23.2.141","volume":"23","author":"P. Trudeau","year":"1989","unstructured":"Trudeau, P., Dror, M.: Savings by split delivery routing. Transportation Science\u00a023(2), 141\u2013145 (1989)","journal-title":"Transportation Science"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Schrijver, A., Gr\u00f6tschel, M., Lov\u00e1sz, L.: Geometric algorithms and combinatorial optimization. Springer(1988)","DOI":"10.1007\/978-3-642-97881-4"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02031946","volume":"60","author":"J. Rygaard","year":"1995","unstructured":"Rygaard, J., Madsen, O., Ravn, H.: A heuristic algorithm for the a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research\u00a060, 193\u2013208 (1995)","journal-title":"Annals of Operations Research"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0377-2217(93)E0292-6","volume":"83","author":"R. Moll","year":"1995","unstructured":"Moll, R., Healy, P.: A new extension of local search applied to the dial-a-ride problem. European Journal of Operational Research\u00a083, 83\u2013104 (1995)","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"3_CR13","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.trc.2010.06.002","volume":"19","author":"S. Parragh","year":"2011","unstructured":"Parragh, S.: Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transportation Research Part C: Emerging Technologies\u00a019(5), 912\u2013930 (2011)","journal-title":"Transportation Research Part C : Emerging Technologies"},{"key":"3_CR14","unstructured":"Parragh, S.N.: Solving the dial-a-ride problem with split requests and profits. In: CO 2012 (2012)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1287\/trsc.17.3.351","volume":"17","author":"H. Psaraftis","year":"1983","unstructured":"Psaraftis, H.: An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science\u00a017, 351\u2013357 (1983)","journal-title":"Transportation Science"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Chatonnay, P., Josselin, D., Chevrier, R., Canalda, P.: Comparison of three algorithms for solving the convergent demand responsive transportation problem. In: ITSC 2006, 9th Int. IEEE Conf. on Intelligent Transportation Systems, Toronto, Canada, pp. 1096\u20131101 (2006)","DOI":"10.1109\/ITSC.2006.1707368"},{"issue":"10","key":"3_CR17","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1057\/palgrave.jors.2602287","volume":"58","author":"K.B. Bergvinsdottir","year":"2007","unstructured":"Bergvinsdottir, K.B., Jorgensen, R.M., Larsen, J.: Solving the dial-a-ride problem using genetic algorithms. Journal of the Operational Research Society\u00a058(10), 1321\u20131331 (2007)","journal-title":"Journal of the Operational Research Society"},{"key":"3_CR18","unstructured":"Quilliot, A., Deleplanque, S.: Dial a ride problem avec transbordement et division du chargement. In:14e Conf\u00e9rence ROADEF. 14-15-15 F\u00e9vrier (2013) (r\u00e9sum\u00e9 accept\u00e9)"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1016\/j.cor.2009.10.003","volume":"37","author":"R.F. Hartl","year":"2010","unstructured":"Hartl, R.F., Parragh, S.N., Doerner, K.F.: Variable neighborhood search for the dial-a-ride problem. Computers & Operations Research\u00a037, 1129\u20131138 (2010)","journal-title":"Computers & Operations Research"}],"container-title":["Studies in Computational Intelligence","Recent Advances in Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-00410-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T03:54:37Z","timestamp":1745985277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-00410-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319004099","9783319004105"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-00410-5_3","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}