{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T11:12:53Z","timestamp":1770635573745,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,5,15]],"date-time":"2017-05-15T00:00:00Z","timestamp":1494806400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003074","name":"Agencia Nacional de Promoci\u00f3n Cient\u00edfica y Tecnol\u00f3gica","doi-asserted-by":"publisher","award":["PICT-2010-0304"],"award-info":[{"award-number":["PICT-2010-0304"]}],"id":[{"id":"10.13039\/501100003074","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003074","name":"Agencia Nacional de Promoci\u00f3n Cient\u00edfica y Tecnol\u00f3gica","doi-asserted-by":"publisher","award":["PICT-2011-0817"],"award-info":[{"award-number":["PICT-2011-0817"]}],"id":[{"id":"10.13039\/501100003074","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003074","name":"Agencia Nacional de Promoci\u00f3n Cient\u00edfica y Tecnol\u00f3gica","doi-asserted-by":"publisher","award":["PICT-2013-2460"],"award-info":[{"award-number":["PICT-2013-2460"]}],"id":[{"id":"10.13039\/501100003074","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005363","name":"Universidad de Buenos Aires","doi-asserted-by":"publisher","award":["UBACyT 20020100100666"],"award-info":[{"award-number":["UBACyT 20020100100666"]}],"id":[{"id":"10.13039\/501100005363","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10479-017-2520-5","type":"journal-article","created":{"date-parts":[[2017,5,15]],"date-time":"2017-05-15T06:51:07Z","timestamp":1494831067000},"page":"327-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["An ILP-based local search procedure for the VRP with pickups and deliveries"],"prefix":"10.1007","volume":"259","author":[{"given":"Agust\u00edn","family":"Montero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Jos\u00e9 Miranda-Bront","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabel","family":"M\u00e9ndez-D\u00edaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,15]]},"reference":[{"issue":"4","key":"2520_CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s13675-014-0030-7","volume":"2","author":"C Archetti","year":"2014","unstructured":"Archetti, C., & Speranza, M. (2014). A survey on matheuristics for routing problems. EURO Journal on Computational Optimization, 2(4), 223\u2013246.","journal-title":"EURO Journal on Computational Optimization"},{"issue":"2","key":"2520_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q","volume":"36","author":"N Ascheuer","year":"2000","unstructured":"Ascheuer, N., Fischetti, M., & Gr\u00f6tschel, M. (2000). A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks, 36(2), 69\u201379.","journal-title":"Networks"},{"issue":"1","key":"2520_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.sorms.2010.07.001","volume":"16","author":"MO Ball","year":"2011","unstructured":"Ball, M. O. (2011). Heuristics based on mathematical programming. Surveys in Operations Research and Management Science, 16(1), 21\u201338.","journal-title":"Surveys in Operations Research and Management Science"},{"issue":"1","key":"2520_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G Berbeglia","year":"2007","unstructured":"Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., & Laporte, G. (2007). Static pickup and delivery problems: A classification scheme and survey. Top, 15(1), 1\u201331.","journal-title":"Top"},{"issue":"1","key":"2520_CR5","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. (2007). The dial-a-ride problem: Models and algorithms. Annals of Operations Research, 153(1), 29\u201346.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2520_CR6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., & Pape, C. L. (2005). Exploring relaxation induced neighborhoods to improve mip solutions. Mathematical Programming, 102(1), 71\u201390.","journal-title":"Mathematical Programming"},{"issue":"2\u20133","key":"2520_CR7","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10107-005-0662-8","volume":"105","author":"R Franceschi De","year":"2006","unstructured":"De Franceschi, R., Fischetti, M., & Toth, P. (2006). A new ILP-based refinement heuristic for vehicle routing problems. Mathematical Programming, 105(2\u20133), 471\u2013499.","journal-title":"Mathematical Programming"},{"issue":"2","key":"2520_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10107-008-0234-9","volume":"121","author":"I Dumitrescu","year":"2008","unstructured":"Dumitrescu, I., Ropke, S., Cordeau, J.-F., & Laporte, G. (2008). The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm. Mathematical Programming, 121(2), 269\u2013305.","journal-title":"Mathematical Programming"},{"issue":"1\u20133","key":"2520_CR9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., & Lodi, A. (2003). Local branching. Mathematical Programming, 98(1\u20133), 23\u201347.","journal-title":"Mathematical Programming"},{"key":"2520_CR10","series-title":"Operations research\/computer science interfaces US","volume-title":"The vehicle routing problem : Latest advances and new challenges (Vol. 43)","year":"2008","unstructured":"Golden, B., Raghavan, S., & Wasil, E. (Eds.). (2008). The vehicle routing problem : Latest advances and new challenges (Vol. 43)., Operations research\/computer science interfaces US Boston: Springer."},{"issue":"10","key":"2520_CR11","doi-asserted-by":"crossref","first-page":"3034","DOI":"10.1016\/j.cor.2005.02.033","volume":"33","author":"P Hansen","year":"2006","unstructured":"Hansen, P., Mladenovic, N., & Urosevic, D. (2006). Variable neighborhood search and local branching. Computers & Operations Research, 33(10), 3034\u20133045.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2520_CR12","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K. (2000). An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126(1), 106\u2013130.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2520_CR13","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1016\/j.ejor.2008.05.009","volume":"196","author":"H Hern\u00e1ndez-P\u00e9rez","year":"2009","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., & Salazar-Gonz\u00e1lez, J.-J. (2009). The multi-commodity one-to-one pickup-and-delivery traveling salesman problem. European Journal of Operational Research, 196(3), 987\u2013995.","journal-title":"European Journal of Operational Research"},{"issue":"02","key":"2520_CR14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1142\/S0218213003001186","volume":"12","author":"H Li","year":"2003","unstructured":"Li, H., & Lim, A. (2003). A metaheuristic for the pickup and delivery problem with time windows. International Journal on Artificial Intelligence Tools, 12(02), 173\u2013186.","journal-title":"International Journal on Artificial Intelligence Tools"},{"issue":"2","key":"2520_CR15","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., & Kernighan, B. W. (1973). An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21(2), 498\u2013516.","journal-title":"Operations Research"},{"issue":"1","key":"2520_CR16","first-page":"47","volume":"142","author":"I Muter","year":"2012","unstructured":"Muter, I., Birbil, I., & B\u00fclb\u00fcl, K. (2012). Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows. Mathematical Programming, 142(1), 47\u201382.","journal-title":"Mathematical Programming"},{"issue":"2","key":"2520_CR17","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.ejor.2012.03.048","volume":"221","author":"I Muter","year":"2012","unstructured":"Muter, I., Birbil, I., B\u00fclb\u00fcl, K., & G\u00fcven\u00e7, (2012). A note on A LP-based heuristic for a time-constrained routing problem. European Journal of Operational Research, 221(2), 306\u2013307.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2520_CR18","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.ejor.2011.08.026","volume":"217","author":"Z Naji-Azimi","year":"2012","unstructured":"Naji-Azimi, Z., Salari, M., & Toth, P. (2012). An integer linear programming based heuristic for the capacitated m-Ring-Star problem. European Journal of Operational Research, 217(1), 17\u201325.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2520_CR19","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","volume":"34","author":"WP Nanry","year":"2000","unstructured":"Nanry, W. P., & Barnes, J. W. (2000). Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B: Methodological, 34(2), 107\u2013121.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"6","key":"2520_CR20","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1007\/s10732-012-9210-x","volume":"18","author":"I Rodr\u00edguez-Mart\u00edn","year":"2012","unstructured":"Rodr\u00edguez-Mart\u00edn, I., & Salazar-Gonz\u00e1lez, J. J. (2012). A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem. Journal of Heuristics, 18(6), 849\u2013867.","journal-title":"Journal of Heuristics"},{"issue":"4","key":"2520_CR21","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":"12","key":"2520_CR22","doi-asserted-by":"crossref","first-page":"2106","DOI":"10.1016\/j.cor.2010.02.010","volume":"37","author":"M Salari","year":"2010","unstructured":"Salari, M., Toth, P., & Tramontani, A. (2010). An ILP improvement procedure for the open vehicle routing problem. Computers & Operations Research, 37(12), 2106\u20132120.","journal-title":"Computers & Operations Research"},{"key":"2520_CR23","first-page":"275","volume":"43","author":"P Toth","year":"2008","unstructured":"Toth, P., & Tramontani, A. (2008). An integer linear programming local search for capacitated vehicle routing problems. The Vehicle Routing Problem: Latest Advances and New Challenges, 43, 275\u2013295.","journal-title":"The Vehicle Routing Problem: Latest Advances and New Challenges"},{"key":"2520_CR24","doi-asserted-by":"crossref","unstructured":"Toth, P. & Vigo, D. (eds.) (2014). Vehicle routing: Problems, methods, and applications, 2nd ed. MOS-SIAM Series on Optimization. Philadelphia, PA, USA.","DOI":"10.1137\/1.9781611973594"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2520-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2520-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2520-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T12:33:19Z","timestamp":1510835599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2520-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,15]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["2520"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2520-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,15]]}}}