{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:51:29Z","timestamp":1725861089772},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319422930"},{"type":"electronic","value":"9783319422947"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-42294-7_1","type":"book-chapter","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T15:00:47Z","timestamp":1468249247000},"page":"3-15","source":"Crossref","is-referenced-by-count":1,"title":["A Hybrid Scatter Search Algorithm to Solve the Capacitated Arc Routing Problem with Refill Points"],"prefix":"10.1007","author":[{"given":"Eduyn Ramiro","family":"L\u00f3pez-Santana","sequence":"first","affiliation":[]},{"given":"Germ\u00e1n Andr\u00e9s","family":"M\u00e9ndez-Giraldo","sequence":"additional","affiliation":[]},{"given":"Carlos Alberto","family":"Franco-Franco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,12]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Assad, A.A., Golden, B.L.: Arc routing methods and applications. In: Handbooks in Operations Research and Management Science, pp. 375\u2013483. Elsevier (1995)","DOI":"10.1016\/S0927-0507(05)80109-4"},{"key":"1_CR2","doi-asserted-by":"crossref","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, 305\u2013315 (1981)","journal-title":"Networks"},{"key":"1_CR3","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"crossref","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: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research\/Computer Science Interfaces Series, vol. 43, pp. 29\u201348. Springer, Heidelberg (2008)"},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"3363","DOI":"10.1016\/j.cor.2005.02.009","volume":"33","author":"J-M Belenguer","year":"2006","unstructured":"Belenguer, J.-M., Benavent, E., Lacomme, P., Prins, C.: Lower and upper bounds for the mixed capacitated arc routing problem. Comput. Oper. Res. 33, 3363\u20133383 (2006)","journal-title":"Comput. Oper. Res."},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1007\/3-540-36970-8_39","volume-title":"Evolutionary Multi-Criterion Optimization","author":"P Lacomme","year":"2003","unstructured":"Lacomme, P., Prins, C., Sevaux, M.: Multiobjective capacitated arc routing problem. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 550\u2013564. Springer, Heidelberg (2003)"},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"3473","DOI":"10.1016\/j.cor.2005.02.017","volume":"33","author":"P Lacomme","year":"2006","unstructured":"Lacomme, P., Prins, C., Sevaux, M.: A genetic algorithm for a bi-objective capacitated arc routing problem. Comput. Oper. Res. 33, 3473\u20133493 (2006)","journal-title":"Comput. Oper. Res."},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1007\/978-3-540-71805-5_78","volume-title":"Applications of Evolutionary Computing","author":"M Reghioui","year":"2007","unstructured":"Reghioui, M., Prins, C., Labadi, N.: GRASP with path relinking for the capacitated arc routing problem with time windows. In: Giacobini, M. (ed.) EvoWorkshops 2007. LNCS, vol. 4448, pp. 722\u2013731. Springer, Heidelberg (2007)"},{"key":"1_CR8","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1016\/j.ejor.2004.08.017","volume":"169","author":"F Chu","year":"2006","unstructured":"Chu, F., Labadi, N., Prins, C.: A scatter search for the periodic capacitated arc routing problem. Eur. J. Oper. Res. 169, 586\u2013605 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR9","unstructured":"Fleury, G., Lacomme, P., Prins, C.: Stochastic Capacitated Arc Routing Problem (2005)"},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1111\/j.1475-3995.2006.00539.x","volume":"13","author":"A Pia","year":"2006","unstructured":"Pia, A., Filippi, C.: A variable neighborhood descent algorithm for a real waste collection problem with mobile depots. Int. Trans. Oper. Res. 13, 125\u2013141 (2006)","journal-title":"Int. Trans. Oper. Res."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.orl.2005.12.009","volume":"35","author":"A Amaya","year":"2007","unstructured":"Amaya, A., Langevin, A., Tr\u00e9panier, M.: The capacitated arc routing problem with refill points. Oper. Res. Lett. 35, 45\u201353 (2007)","journal-title":"Oper. Res. Lett."},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1057\/jors.2009.58","volume":"61","author":"C-A Amaya","year":"2010","unstructured":"Amaya, C.-A., Langevin, A., Tr\u00e9panier, M.: A heuristic method for the capacitated arc routing problem with refill points and multiple loads. J. Oper. Res. Soc. 61, 1095\u20131103 (2010)","journal-title":"J. Oper. Res. Soc."},{"key":"1_CR13","first-page":"168","volume":"38","author":"HU Shan","year":"2012","unstructured":"Shan, H.U., Dan, L.I.N.: Algorithms for solving CARP-RP-ML problem. Comput. Eng. 38, 168\u2013170 (2012)","journal-title":"Comput. Eng."},{"key":"1_CR14","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":"1_CR15","doi-asserted-by":"crossref","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, 705\u2013728 (2003)","journal-title":"Comput. Oper. Res."},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1002\/net.20091","volume":"47","author":"R Baldacci","year":"2006","unstructured":"Baldacci, R., Maniezzo, V.: Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47, 52\u201360 (2006)","journal-title":"Networks"},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"1823","DOI":"10.1016\/j.cor.2004.11.020","volume":"33","author":"H Longo","year":"2006","unstructured":"Longo, H., de Arag\u00e3o, P.M., Uchoa, E.: Solving capacitated arc routing problems using a transformation to the CVRP. Comput. Oper. Res. 33, 1823\u20131837 (2006)","journal-title":"Comput. Oper. Res."},{"key":"1_CR18","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.ejor.2006.06.028","volume":"181","author":"M Tagmouti","year":"2007","unstructured":"Tagmouti, M., Gendreau, M., Potvin, J.-Y.: Arc routing problems with time-dependent service costs. Eur. J. Oper. Res. 181, 30\u201339 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(92)00003-5","volume":"48","author":"RW Eglese","year":"1994","unstructured":"Eglese, R.W.: Routeing winter gritting vehicles. Discret. Appl. Math. 48, 231\u2013244 (1994)","journal-title":"Discret. Appl. Math."},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1287\/trsc.35.4.425.10431","volume":"35","author":"A Hertz","year":"2001","unstructured":"Hertz, A., Mittaz, M.: A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transp. Sci. 35, 425\u2013434 (2001)","journal-title":"Transp. Sci."},{"key":"1_CR21","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1287\/opre.48.1.129.12455","volume":"48","author":"A Hertz","year":"2000","unstructured":"Hertz, A., Laporte, G., Mittaz, M.: A tabu search heuristic for the capacitated arc routing problem. Oper. Res. 48, 129\u2013135 (2000)","journal-title":"Oper. Res."},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tre.2012.11.003","volume":"50","author":"RYK Fung","year":"2013","unstructured":"Fung, R.Y.K., Liu, R., Jiang, Z.: A memetic algorithm for the open capacitated arc routing problem. Transp. Res. Part E: Logist. Transp. Rev. 50, 53\u201367 (2013)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"1_CR23","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.trc.2014.04.001","volume":"43","author":"M Liu","year":"2014","unstructured":"Liu, M., Singh, H.K., Ray, T.: Application specific instance generator and a memetic algorithm for capacitated arc routing problems. Transp. Res. Part C: Emerg. Technol. 43, 249\u2013266 (2014)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"1_CR24","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/j.asoc.2015.08.003","volume":"37","author":"Z Wang","year":"2015","unstructured":"Wang, Z., Jin, H., Tian, M.: Rank-based memetic algorithm for capacitated arc routing problems. Appl. Soft Comput. 37, 572\u2013584 (2015)","journal-title":"Appl. Soft Comput."},{"key":"1_CR25","doi-asserted-by":"crossref","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., Van Oudheusden, D.: A guided local search heuristic for the capacitated arc routing problem. Eur. J. Oper. Res. 147, 629\u2013643 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR26","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8, 156\u2013166 (1977)","journal-title":"Decis. Sci."},{"key":"1_CR27","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/0-387-23667-8_1","volume-title":"Metaheuristic Optimization via Memory and Evolution","author":"C Rego","year":"2005","unstructured":"Rego, C., Le\u00e3o, P.: A scatter search tutorial for graph-based permutation problems. In: Sharda, R., Vo\u00df, S., Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization via Memory and Evolution. Operations Research\/Computer Science Interfaces Series, vol. 30, pp. 1\u201324. Kluwer Academic Publishers, Boston (2005)"},{"key":"1_CR28","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/j.ejor.2004.08.018","volume":"169","author":"RA Russell","year":"2006","unstructured":"Russell, R.A., Chiang, W.-C.: Scatter search for the vehicle routing problem with time windows. Eur. J. Oper. Res. 169, 606\u2013622 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR29","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Scatter Search: Methodology and Implementations in C","author":"M Laguna","year":"2003","unstructured":"Laguna, M., Mart\u00ed, R., Mart\u00ed, R.C.: Scatter Search: Methodology and Implementations in C. Operations Research\/Computer Science Interfaces Series, vol. 1. Springer Science & Business Media, New York (2003)"},{"key":"1_CR30","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River (1993)"},{"key":"1_CR31","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1002\/net.3230220706","volume":"22","author":"E Benavent","year":"1992","unstructured":"Benavent, E., Campos, V., Corberan, A., Mota, E.: The capacitated arc routing problem: lower bounds. Networks 22, 669\u2013690 (1992)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42294-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T00:29:30Z","timestamp":1568161770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42294-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319422930","9783319422947"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42294-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}