{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:42:59Z","timestamp":1743010979469,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030003524"},{"type":"electronic","value":"9783030003531"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00353-1_9","type":"book-chapter","created":{"date-parts":[[2018,9,12]],"date-time":"2018-09-12T14:13:10Z","timestamp":1536761590000},"page":"96-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Metaheuristic Approach for the Cumulative Capacitated Arc Routing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8735-209X","authenticated-orcid":false,"given":"Sergio Andr\u00e9s","family":"Lenis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2160-3180","authenticated-orcid":false,"given":"Juan Carlos","family":"Rivera","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,13]]},"reference":[{"key":"9_CR1","unstructured":"Archer, A., Williamson, D.P.: Faster approximation algorithms for the minimum latency problem. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2003)"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1018316919294","volume":"10","author":"JM Belenguer","year":"1998","unstructured":"Belenguer, J.M., Benavent, E.: The capacitated arc routing problem: valid inequalities and facets. Comput. Optim. Appl. 10(2), 165\u2013187 (1998)","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"9_CR3","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/S0305-0548(02)00046-1","volume":"30","author":"JM Belenguer","year":"2003","unstructured":"Belenguer, J.M., Benavent, E.: A cutting plane algorithm for the capacitated arc routing problem. Comput. Oper. Res. 30(5), 705\u2013728 (2003)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/S0377-2217(02)00334-X","volume":"147","author":"P Beullens","year":"2003","unstructured":"Beullens, P., Muyldermans, L., Cattrysse, D., Oudheusden, D.V.: A guided local search heuristic for the capacitated arc routing problem. Eur. J. Oper. Res. 147(3), 629\u2013643 (2003). https:\/\/doi.org\/10.1016\/S0377-2217(02)00334-X . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S037722170200334X","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR5","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 Twenty-Sixth Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 163\u2013171. ACM, New York (1994)","DOI":"10.1145\/195058.195125"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1016\/j.cor.2006.07.007","volume":"35","author":"J Brandao","year":"2008","unstructured":"Brandao, J., Eglese, R.: A deterministic tabu search algorithm for the capacitated arc routing problem. Comput. Oper. Res. 35(4), 1112\u20131126 (2008). https:\/\/doi.org\/10.1016\/j.cor.2006.07.007 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054806001535","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1287\/trsc.1070.0209","volume":"42","author":"AM Campbell","year":"2008","unstructured":"Campbell, A.M., Vandenbussche, D., Hermann, W.: Routing for relief efforts. Transp. Sci. 42(2), 127\u2013145 (2008). https:\/\/doi.org\/10.1287\/trsc.1070.0209","journal-title":"Transp. Sci."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Corber\u00e1n, A., Laporte, G.: Arc routing: problem, methods, and applications. In: SIAM (2014)","DOI":"10.1137\/1.9781611973679"},{"key":"9_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4495-1","volume-title":"Arc Routing. Theory, Solutions and Applications","author":"M Dror","year":"2000","unstructured":"Dror, M.: Arc Routing. Theory, Solutions and Applications. Springer, Boston (2000). https:\/\/doi.org\/10.1007\/978-1-4615-4495-1"},{"issue":"6","key":"9_CR10","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":"9_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0305-0548(83)90026-6","volume":"10","author":"B Golden","year":"1983","unstructured":"Golden, B., Dearmon, J., Baker, E.: Computational experiments with algorithms for a class of routing problems. Comput. Oper. Res. 10(1), 47\u201359 (1983). https:\/\/doi.org\/10.1016\/0305-0548(83)90026-6 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/0305054883900266","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/net.3230110308","volume":"11","author":"BL Golden","year":"1981","unstructured":"Golden, B.L., Wong, R.T.: Capacitated arc routing problems. Networks 11(3), 305\u2013315 (1981)","journal-title":"Networks"},{"key":"9_CR13","first-page":"155","volume":"9","author":"R Hirabayashi","year":"1992","unstructured":"Hirabayashi, R., Saruwatari, Y., Nishida, N.: Tour construction algorithm for the capacitated arc routing problem. Asia-Pac. J. Oper. Res. 9, 155\u2013175 (1992)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-540-24698-5_46","volume-title":"LATIN 2004: Theoretical Informatics","author":"R Jothi","year":"2004","unstructured":"Jothi, R., Raghavachari, B.: Minimum latency tours and the k-traveling repairmen problem. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 423\u2013433. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24698-5_46"},{"key":"9_CR15","volume-title":"Vehicle Routing Problem","author":"mdat Kara","year":"2008","unstructured":"Kara, I., Kara, B., Kadri, M.: Cumulative vehicle routing problems, pp. 85\u201398 (2008)"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/j.cor.2012.08.020","volume":"40","author":"L Ke","year":"2013","unstructured":"Ke, L., Feng, Z.: A two-phase metaheuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 40, 633\u2013638 (2013)","journal-title":"Comput. Oper. Res."},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/3-540-45365-2_49","volume-title":"Applications of Evolutionary Computing","author":"P Lacomme","year":"2001","unstructured":"Lacomme, P., Prins, C., Ramdane-Ch\u00e9rif, W.: A genetic algorithm for the capacitated arc routing problem and its extensions. In: Boers, E.J.W. (ed.) EvoWorkshops 2001. LNCS, vol. 2037, pp. 473\u2013483. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45365-2_49"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1016\/j.eswa.2013.07.107","volume":"41","author":"C Lin","year":"2014","unstructured":"Lin, C., Choy, K., Ho, G., Chung, S., Lam, H.: Survey of green vehicle routing problem: past and future trends. Expert. Syst. Appl. 41(4), 1118\u20131138 (2014). https:\/\/doi.org\/10.1016\/j.eswa.2013.07.107 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S095741741300609X","journal-title":"Expert. Syst. Appl."},{"issue":"3","key":"9_CR19","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":"11","key":"9_CR20","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.cor.2009.06.014","volume":"37","author":"SU Ngueveu","year":"2010","unstructured":"Ngueveu, S.U., Prins, C., Calvo, R.W.: 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":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1080\/00207540802426599","volume":"47","author":"C Prins","year":"2009","unstructured":"Prins, C., Labadi, N., Reghioui, M.: Tour splitting algorithms for vehicle routing problems. Int. J. Prod. Res. 47(2), 507\u2013535 (2009)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.cor.2011.05.005","volume":"39","author":"GM Ribeiro","year":"2012","unstructured":"Ribeiro, G.M., 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."},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/net.3230220305","volume":"22","author":"JN Tsitsiklis","year":"1992","unstructured":"Tsitsiklis, J.N.: Special cases of traveling salesman and repairman problems with time windows. Networks 22, 263\u2013282 (1992)","journal-title":"Networks"},{"key":"9_CR24","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-0-387-77778-8_2","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"S W\u00f8hlk","year":"2008","unstructured":"W\u00f8hlk, S.: A decade of capacitated arc routing. In: Wasil, E. (ed.) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research\/Computer Science Interfaces Series, vol. 43, pp. 29\u201348. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-0-387-77778-8_2"}],"container-title":["Communications in Computer and Information Science","Applied Computer Sciences in Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00353-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T00:01:02Z","timestamp":1571875262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00353-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030003524","9783030003531"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00353-1_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]}}}