{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T14:38:34Z","timestamp":1784644714005,"version":"3.55.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319684956","type":"print"},{"value":"9783319684963","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68496-3_5","type":"book-chapter","created":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T08:25:00Z","timestamp":1506414300000},"page":"64-78","source":"Crossref","is-referenced-by-count":8,"title":["Maximizing the Number of Served Requests in an Online Shared Transport System by Solving a Dynamic DARP"],"prefix":"10.1007","author":[{"given":"Sven","family":"Vall\u00e9e","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ammar","family":"Oulamara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wahiba Ramdane","family":"Cherif-Khettaf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.parco.2003.12.001","volume":"30","author":"A Attanasio","year":"2004","unstructured":"Attanasio, A., Cordeau, J.-F., Ghiani, G., Laporte, G.: Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing 30(3), 8\u201315 (2004)","journal-title":"Parallel Computing"},{"issue":"1","key":"5_CR2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s00291-008-0135-6","volume":"32","author":"A Beaudry","year":"2010","unstructured":"Beaudry, A., Laporte, G., Melo, T., Nickel, S.: Dynamic transportation of patients in hospitals. OR Spectrum 32(1), 77\u2013107 (2010)","journal-title":"OR Spectrum"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1023\/B:COAP.0000044187.23143.bd","volume":"29","author":"W Ben-Ameur","year":"2004","unstructured":"Ben-Ameur, W.: Computing the initial temperature of simulated annealing. Computational Optimization and Applications 29, 369\u2013385 (2004)","journal-title":"Computational Optimization and Applications"},{"key":"5_CR4","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00483-4","volume-title":"Tuning Metaheuristics : A Machine Learning Perspective","author":"M Birattari","year":"2009","unstructured":"Birattari, M.: Tuning Metaheuristics : A Machine Learning Perspective. Studies in Computational Intelligence, vol. 197, 1st edn. Springer-Verlag, Heidelberg (2009). doi:\n10.1007\/978-3-642-00483-4","edition":"1"},{"issue":"6","key":"5_CR5","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.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research part B : Methodological 37(6), 579\u2013594 (2003)","journal-title":"Transportation Research part B : Methodological"},{"key":"5_CR6","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.: The dial-a-ride problems, models and algorithms. Annals of Operations Research 153, 29\u201346 (2007)","journal-title":"Annals of Operations Research"},{"issue":"3","key":"5_CR7","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1016\/j.ejor.2005.02.038","volume":"175","author":"L Coslovich","year":"2006","unstructured":"Coslovich, L., Pesenti, R., Ukovich, W.: A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. European Journal of Operational Research 175(3), 1605\u20131615 (2006)","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"5_CR8","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/j.trb.2003.07.001","volume":"38","author":"M Diana","year":"2004","unstructured":"Diana, M., Dessouky, M.M.: A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research Part B : Methodological 38(6), 539\u2013557 (2004)","journal-title":"Transportation Research Part B : Methodological"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.cor.2015.08.008","volume":"66","author":"B Li","year":"2016","unstructured":"Li, B., Krushinsky, D., Van Woensel, T., Reijers, H.A.: An adaptive large neighborhood search heuristic for the share-a-ride problem. Computers and Operations Research 66, 170\u2013180 (2016)","journal-title":"Computers and Operations Research"},{"issue":"1","key":"5_CR10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ejor.2015.12.032","volume":"252","author":"Y Li","year":"2016","unstructured":"Li, Y., Chen, H., Prins, C.: Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. European Journal of Operational Research 252(1), 27\u201338 (2016)","journal-title":"European Journal of Operational Research"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: Iterated racing for automatic algorithm configuration. Operations Research Perspectives 3, 43\u201358 (2016)","journal-title":"Operations Research Perspectives"},{"issue":"1","key":"5_CR12","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02031946","volume":"60","author":"OBG Madsen","year":"1995","unstructured":"Madsen, O.B.G., Ravn, H.F., Rygaard, J.M.: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research 60(1), 193\u2013208 (1995)","journal-title":"Annals of Operations Research"},{"issue":"3","key":"5_CR13","doi-asserted-by":"crossref","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 17(3), 351\u2013357 (1983)","journal-title":"Transportation Science"},{"issue":"4","key":"5_CR14","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40(4), 455\u2013472 (2006)","journal-title":"Transportation Science"},{"issue":"19","key":"5_CR15","doi-asserted-by":"crossref","first-page":"6728","DOI":"10.1016\/j.eswa.2015.04.060","volume":"42","author":"DO Santos","year":"2015","unstructured":"Santos, D.O., Xavier, E.C.: Taxi and ride sharing: A dynamic dial-a-ride problem with money as an incentive. Expert Systems with Applications 42(19), 6728\u20136737 (2015)","journal-title":"Expert Systems with Applications"},{"issue":"12","key":"5_CR16","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1016\/j.cor.2011.02.006","volume":"38","author":"M Schilde","year":"2011","unstructured":"Schilde, M., Doerner, K.F., Hartl, R.F.: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Computers and Operations Research 38(12), 1719\u20131730 (2011)","journal-title":"Computers and Operations Research"},{"key":"5_CR17","unstructured":"Wilson, N., Sussman, J., Wang, H., Higonnet, B.: Scheduling algorithms for dial-a-ride systems. Technical Report USL-TR-71-13 (1971)"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68496-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T11:55:05Z","timestamp":1506945305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68496-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319684956","9783319684963"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68496-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}