{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T01:30:19Z","timestamp":1792805419549,"version":"4.5.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,1,3]],"date-time":"2019-01-03T00:00:00Z","timestamp":1546473600000},"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":["Optim Lett"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s11590-018-1376-1","type":"journal-article","created":{"date-parts":[[2019,1,3]],"date-time":"2019-01-03T06:31:53Z","timestamp":1546497113000},"page":"671-691","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":56,"title":["A POPMUSIC approach for the Multi-Depot Cumulative Capacitated Vehicle Routing Problem"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7286-9501","authenticated-orcid":false,"given":"Eduardo","family":"Lalla-Ruiz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,1,3]]},"reference":[{"issue":"3","key":"1376_CR1","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1016\/j.ejor.2006.03.071","volume":"189","author":"L Bertacco","year":"2008","unstructured":"Bertacco, L., Brunetta, L., Fischetti, M.: The linear ordering problem with cumulative costs. Eur. J. Oper. Res. 189(3), 1345\u20131357 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"1376_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of the 26th Annual ACM Symposium on Theory of computing, pp. 163\u2013171. ACM (1994)","DOI":"10.1145\/195058.195125"},{"key":"1376_CR3","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-642-27711-5_76","volume-title":"Technology for Education and Learning","author":"P Chen","year":"2012","unstructured":"Chen, P., Dong, X., Niu, Y.: An iterated local search algorithm for the cumulative capacitated vehicle routing problem. In: Tan, H. (ed.) Technology for Education and Learning, pp. 575\u2013581. Springer, Berlin (2012)"},{"issue":"2","key":"1376_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"JF Cordeau","year":"1997","unstructured":"Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105\u2013119 (1997)","journal-title":"Networks"},{"key":"1376_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6, 80\u201391 (1959)","journal-title":"Manag. Sci."},{"issue":"6","key":"1376_CR6","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1287\/opre.41.6.1055","volume":"41","author":"M Fischetti","year":"1993","unstructured":"Fischetti, M., Laporte, G., Martello, S.: The delivery man problem and cumulative matroids. Oper. Res. 41(6), 1055\u20131064 (1993)","journal-title":"Oper. Res."},{"issue":"1","key":"1376_CR7","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/opre.2013.1231","volume":"62","author":"M Fischetti","year":"2014","unstructured":"Fischetti, M., Monaci, M.: Exploiting erraticism in search. Oper. Res. 62(1), 114\u2013122 (2014)","journal-title":"Oper. Res."},{"issue":"1","key":"1376_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0377-2217(93)E0238-S","volume":"83","author":"L Gouveia","year":"1995","unstructured":"Gouveia, L., Vo\u00df, S.: A classification of formulations for the (time-dependent) traveling salesman problem. Eur. J. Oper. Res. 83(1), 69\u201382 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1376_CR9","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s11518-016-5301-9","volume":"25","author":"E Lalla-Ruiz","year":"2016","unstructured":"Lalla-Ruiz, E., Vo\u00df, S.: Improving solver performance through redundancy. J. Syst. Sci. Syst. Eng. 25(3), 303\u2013325 (2016)","journal-title":"J. Syst. Sci. Syst. Eng."},{"issue":"1\u20132","key":"1376_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10472-014-9444-4","volume":"76","author":"E Lalla-Ruiz","year":"2016","unstructured":"Lalla-Ruiz, E., Vo\u00df, S.: Popmusic as a matheuristic for the berth allocation problem. Ann. Math. Artif. Intell. 76(1\u20132), 173\u2013189 (2016)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"1376_CR11","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/s10479-015-2055-6","volume":"253","author":"E Lalla-Ruiz","year":"2017","unstructured":"Lalla-Ruiz, E., Vo\u00df, S., Exp\u00f3sito-Izquierdo, C., Meli\u00e1n-Batista, B., Moreno-Vega, J.M.: A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations. Ann. Oper. Res. 253(2), 871\u2013897 (2017)","journal-title":"Ann. Oper. Res."},{"key":"1376_CR12","doi-asserted-by":"crossref","unstructured":"Lalla-Ruiz, E., Schwarze, S., Vo\u00df, S.: A matheuristic approach for the p-cable trench problem. In: Festa, P., Sellmann, M., Vanschoren, J. (eds.) Learning and Intelligent Optimization, pp. 247\u2013252. Springer (2016)","DOI":"10.1007\/978-3-319-50349-3_19"},{"issue":"3","key":"1376_CR13","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.ejor.2013.08.032","volume":"236","author":"J Lysgaard","year":"2014","unstructured":"Lysgaard, J., W\u00f8hlk, S.: A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem. Eur. J. Oper. Res. 236(3), 800\u2013810 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"1376_CR14","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1057\/jors.2014.92","volume":"66","author":"I Mart\u00ednez-Salazar","year":"2015","unstructured":"Mart\u00ednez-Salazar, I., Angel-Bello, F., Alvarez, A.: A customer-centric routing problem with multiple trips of a single vehicle. J. Oper. Res. Soc. 66(8), 1312\u20131323 (2015)","journal-title":"J. Oper. Res. Soc."},{"key":"1376_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.cie.2014.10.029","volume":"79","author":"JR Montoya-Torres","year":"2015","unstructured":"Montoya-Torres, J.R., Franco, J.L., Isaza, S.N., Jim\u00e9nez, H.F., Herazo-Padilla, N.: A literature review on the vehicle routing problem with multiple depots. Comput. Ind. Eng. 79, 115\u2013129 (2015)","journal-title":"Comput. Ind. Eng."},{"issue":"11","key":"1376_CR16","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.cor.2009.06.014","volume":"37","author":"S Ngueveu","year":"2010","unstructured":"Ngueveu, S., Prins, C., Wolfler-Calvo, R.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 37(11), 1877\u20131885 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1376_CR17","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0305-0548(95)O0026-P","volume":"23","author":"J Renaud","year":"1996","unstructured":"Renaud, J., Laporte, G., Boctor, F.: A tabu search heuristic for the multi-depot vehicle routing problem. Comput. Oper. Res. 23(3), 229\u2013235 (1996)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1376_CR18","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.cor.2011.05.005","volume":"39","author":"G Ribeiro","year":"2012","unstructured":"Ribeiro, G., Laporte, G.: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 39(3), 728\u2013735 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1376_CR19","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ejor.2015.08.067","volume":"249","author":"JC Rivera","year":"2016","unstructured":"Rivera, J.C., Afsar, H.M., Prins, C.: Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem. Eur. J. Oper. Res. 249(1), 93\u2013104 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1376_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10288-011-0153-0","volume":"9","author":"A Salehipour","year":"2011","unstructured":"Salehipour, A., S\u00f6rensen, K., Goos, P., Br\u00e4ysy, O.: Efficient GRASP + VND and GRASP + VNS metaheuristics for the traveling repairman problem. 4OR 9(2), 189\u2013209 (2011)","journal-title":"4OR"},{"issue":"10","key":"1376_CR21","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/0305-0548(94)00083-K","volume":"22","author":"R Sumichras","year":"1995","unstructured":"Sumichras, R., Markham, I.: A heuristic and lower bound for a multi-depot routing problem. Comput. Oper. Res. 22(10), 1047\u20131056 (1995)","journal-title":"Comput. Oper. Res."},{"key":"1376_CR22","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.trb.2017.04.003","volume":"101","author":"JF Sze","year":"2017","unstructured":"Sze, J.F., Salhi, S., Wassan, N.: The cumulative capacitated vehicle routing problem with min\u2013sum and min\u2013max objectives: an effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search. Transp. Res. Part B Methodol. 101, 162\u2013184 (2017)","journal-title":"Transp. Res. Part B Methodol."},{"key":"1376_CR23","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4_27","volume-title":"Essays and Surveys in Metaheuristics","author":"\u00c9D Taillard","year":"2002","unstructured":"Taillard, \u00c9.D., Vo\u00df, S.: POPMUSIC-partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 613\u2013629. Springer, Berlin (2002)"},{"key":"1376_CR24","doi-asserted-by":"publisher","unstructured":"Taillard, \u00c9.D., Vo\u00df, S.: Popmusic. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 687\u2013701. Springer, Berlin (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-07124-4_31","DOI":"10.1007\/978-3-319-07124-4_31"},{"key":"1376_CR25","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.cor.2014.11.006","volume":"56","author":"L Talarico","year":"2015","unstructured":"Talarico, L., Meisel, F., S\u00f6rensen, K.: Ambulance routing for disaster response with patient groups. Comput. Oper. Res. 56, 120\u2013133 (2015)","journal-title":"Comput. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1376-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1376-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1376-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T21:08:18Z","timestamp":1583960898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1376-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,3]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["1376"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1376-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,3]]},"assertion":[{"value":"14 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}