{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T03:50:37Z","timestamp":1771818637134,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,5,18]],"date-time":"2014-05-18T00:00:00Z","timestamp":1400371200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10479-014-1605-7","type":"journal-article","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T10:53:00Z","timestamp":1400323980000},"page":"341-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":47,"title":["Dynamic programming based metaheuristics for the dial-a-ride problem"],"prefix":"10.1007","volume":"236","author":[{"given":"Ulrike","family":"Ritzinger","sequence":"first","affiliation":[]},{"given":"Jakob","family":"Puchinger","sequence":"additional","affiliation":[]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,18]]},"reference":[{"key":"1605_CR1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman, R. (1962). Dynamic programming treatment of the travelling salesman problem. JACM, 9, 61\u201363.","journal-title":"JACM"},{"issue":"4","key":"1605_CR2","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cor.2004.08.001","volume":"33","author":"R Bent","year":"2006","unstructured":"Bent, R., & Hentenryck, P. V. (2006). A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research, 33(4), 875\u2013893.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"1605_CR3","doi-asserted-by":"crossref","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G. R., & Roli, A. (2011). Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing, 11(6), 4135\u20134151.","journal-title":"Applied Soft Computing"},{"issue":"1","key":"1605_CR4","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., & Gendreau, M. (2005). Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science, 39(1), 119\u2013139.","journal-title":"Transportation Science"},{"issue":"6","key":"1605_CR5","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"JF Cordeau","year":"2003","unstructured":"Cordeau, J. F., & Laporte, G. (2003). A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological, 37(6), 579\u2013594.","journal-title":"Transportation Research Part B: Methodological"},{"key":"1605_CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"JF Cordeau","year":"2007","unstructured":"Cordeau, J. F., & Laporte, G. (2007). The dial-a-ride problem: Models and algorithms. Annals of Operations Research, 153, 29\u201346.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"1605_CR7","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.43.2.367","volume":"43","author":"Y Dumas","year":"1995","unstructured":"Dumas, Y., Desrosiers, J., Gelinas, E., & Solomon, M. M. (1995). An optimal algorithm for the traveling salesman problem with time windows. Operations Research, 43(2), 367\u2013371.","journal-title":"Operations Research"},{"key":"1605_CR8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10732-005-1997-2","volume":"11","author":"B Funke","year":"2005","unstructured":"Funke, B., Gr\u00fcnert, T., & Irnich, S. (2005). Local search for vehicle routing and scheduling problems: Review and conceptual integration. Journal of Heuristics, 11, 267\u2013306.","journal-title":"Journal of Heuristics"},{"key":"1605_CR9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/978-0-387-77778-8_7","volume-title":"The vehicle routing problem: latest advances and new challenges, operations research\/computer science interfaces series","author":"M Gendreau","year":"2008","unstructured":"Gendreau, M., Potvin, J. Y., Brumlaysy, O., Hasle, G., & L\u00f8kketangen, A. (2008). Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography. In B. Golden, S. Raghavan, & E. Wasil (Eds.), The vehicle routing problem: latest advances and new challenges, operations research\/computer science interfaces series (Vol. 43, pp. 143\u2013169). New York: Springer."},{"issue":"5","key":"1605_CR10","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1016\/j.cor.2011.07.002","volume":"39","author":"JAS Gromicho","year":"2012","unstructured":"Gromicho, J. A. S., van Hoorn, J. J., Kok, A. L., & Schutten, J. M. J. (2012). Restricted dynamic programming: A flexible framework for solving realistic VRPs. Computers & OR, 39(5), 902\u2013909.","journal-title":"Computers & OR"},{"key":"1605_CR11","unstructured":"Gschwind, T., & Irnich, S. (2012). Effective handling of dynamic time windows and synchronization with precedences for exact vehicle routing. Mainz: Chair of Logistics Management, Johannes Gutenberg University Mainz. (Technical Report LM-2012-05)."},{"key":"1605_CR12","doi-asserted-by":"crossref","unstructured":"Held, M., & Karp, R. M. (1961). A dynamic programming approach to sequencing problems. In: Proceedings of the 1961 16th ACM national meeting, ACM \u201961 (pp. 71.201\u201371.204). New York: ACM.","DOI":"10.1145\/800029.808532"},{"issue":"1","key":"1605_CR13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0377-2217(94)00299-1","volume":"90","author":"C Malandraki","year":"1996","unstructured":"Malandraki, C., & Dial, R. B. (1996). A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. European Journal of Operational Research, 90(1), 45\u201355.","journal-title":"European Journal of Operational Research"},{"key":"1605_CR14","volume-title":"Matheuristics: Hybridizing metaheuristics and mathematical programming","author":"V Maniezzo","year":"2009","unstructured":"Maniezzo, V., St\u00fctzle, T., & Vo\u00df, S. (2009). Matheuristics: Hybridizing metaheuristics and mathematical programming (1st ed.). Heidelberg: Springer.","edition":"1"},{"key":"1605_CR15","volume-title":"Paradigms of artificial intelligence programming: Case studies in common lisp","author":"P Norvig","year":"1992","unstructured":"Norvig, P. (1992). Paradigms of artificial intelligence programming: Case studies in common lisp (1st ed.). San Francisco: Morgan Kaufmann Publishers Inc.","edition":"1"},{"issue":"1","key":"1605_CR16","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/j.cor.2012.08.004","volume":"40","author":"SN Parragh","year":"2013","unstructured":"Parragh, S. N., & Schmid, V. (2013). Hybrid column generation and large neighborhood search for the dial-a-ride problem. Computers & Operations Research, 40(1), 490\u2013497.","journal-title":"Computers & Operations Research"},{"key":"1605_CR17","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008). A survey on pickup and delivery problems. Part II. Journal f\u00fcr Betriebswirtschaft, 58, 81\u2013117.","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"key":"1605_CR18","volume-title":"Wiley encyclopaedia of operations research and management science","author":"SN Parragh","year":"2010","unstructured":"Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2010a). Demand responsive transportation. In J. J. Cochran, L. A. Cox, P. Keskinocak, J. P. Kharoufeh, & J. C. Smith (Eds.), Wiley encyclopaedia of operations research and management science. Hoboken, NJ: Wiley."},{"key":"1605_CR19","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1016\/j.cor.2009.10.003","volume":"37","author":"SN Parragh","year":"2010","unstructured":"Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2010b). Variable neighborhood search for the dial-a-ride problem. Computers and Operations Research, 37, 1129\u20131138.","journal-title":"Computers and Operations Research"},{"key":"1605_CR20","first-page":"399","volume-title":"Handbook of metaheuristics. International series in operations research & management science","author":"D Pisinger","year":"2010","unstructured":"Pisinger, D., & Ropke, S. (2010). Large neighborhood search. In M. Gendreau & J. Y. Potvin (Eds.), Handbook of metaheuristics. International series in operations research & management science (Vol. 146, pp. 399\u2013419). New York: Springer."},{"issue":"2","key":"1605_CR21","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"HN Psaraftis","year":"1980","unstructured":"Psaraftis, H. N. (1980). A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science, 14(2), 130\u2013154.","journal-title":"Transportation Science"},{"key":"1605_CR22","doi-asserted-by":"crossref","unstructured":"Ritzinger, U., & Puchinger, J. (2013). Hybrid metaheuristics for dynamic and stochastic vehicle routing. In E. G. Talbi (Ed.), Hybrid metaheuristics. Studies in computational intelligence (Vol. 434, pp. 77\u201395). Berlin: Springer.","DOI":"10.1007\/978-3-642-30671-6_2"},{"issue":"4","key":"1605_CR23","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. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455\u2013472.","journal-title":"Transportation Science"},{"issue":"4","key":"1605_CR24","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S Ropke","year":"2007","unstructured":"Ropke, S., Cordeau, J. F., & Laporte, G. (2007). Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks, 49(4), 258\u2013272.","journal-title":"Networks"},{"issue":"12","key":"1605_CR25","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. (2011). Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Computers & Operations Research, 38(12), 1719\u20131730.","journal-title":"Computers & Operations Research"},{"key":"1605_CR26","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and practice of constraint programming CP98. Lecture notes in computer science","author":"P Shaw","year":"1998","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In M. Maher & J. F. Puget (Eds.), Principles and practice of constraint programming CP98. Lecture notes in computer science (Vol. 1520, pp. 417\u2013431). Berlin: Springer."},{"key":"1605_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-30671-6","volume-title":"Hybrid metaheuristics. Studies in computational intelligence","author":"EG Talbi","year":"2013","unstructured":"Talbi, E. G. (2013). Hybrid metaheuristics. Studies in computational intelligence (Vol. 434). Berlin: Springer."},{"key":"1605_CR28","volume-title":"The vehicle routing problem","author":"P Toth","year":"2001","unstructured":"Toth, P., & Vigo, D. (2001). The vehicle routing problem. Philadelphia, PA: Society for Industrial and Applied Mathematics."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1605-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1605-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1605-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:50Z","timestamp":1559153390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1605-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,18]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["1605"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1605-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,18]]}}}