{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:43:24Z","timestamp":1725857004082},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319396354"},{"type":"electronic","value":"9783319396361"}],"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-39636-1_5","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T06:36:37Z","timestamp":1464071797000},"page":"62-74","source":"Crossref","is-referenced-by-count":1,"title":["Investigating Edge-Reordering Procedures in a Tabu Search Algorithm for the Capacitated Arc Routing Problem"],"prefix":"10.1007","author":[{"given":"Wasin","family":"Padungwech","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Thompson","sequence":"additional","affiliation":[]},{"given":"Rhyd","family":"Lewis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"issue":"3","key":"5_CR1","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(3), 629\u2013643 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"5_CR2","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1016\/j.cor.2006.07.007","volume":"35","author":"J Brand\u00e3o","year":"2008","unstructured":"Brand\u00e3o, J., Eglese, R.: A deterministic tabu search algorithm for the capacitated arc routing problem. Comput. Oper. Res. 35(4), 1112\u20131126 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"5_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"3","key":"5_CR4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, Part II: the rural postman problem. Oper. Res. 43(3), 399\u2013414 (1995)","journal-title":"Oper. Res."},{"issue":"3","key":"5_CR5","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/322139.322150","volume":"26","author":"GN Frederickson","year":"1979","unstructured":"Frederickson, G.N.: Approximation algorithms for some postman problems. J. ACM (JACM) 26(3), 538\u2013554 (1979)","journal-title":"J. ACM (JACM)"},{"doi-asserted-by":"crossref","unstructured":"Fu, H., Mei, Y., Tang, K., Zhu, Y.: Memetic algorithm with heuristic candidate list strategy for capacitated arc routing problem. In: 2010 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2010)","key":"5_CR6","DOI":"10.1109\/CEC.2010.5586042"},{"issue":"1","key":"5_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0305-0548(83)90026-6","volume":"10","author":"BL Golden","year":"1983","unstructured":"Golden, B.L., DeArmon, J.S., Baker, E.K.: Computational experiments with algorithms for a class of routing problems. Comput. Oper. Res. 10(1), 47\u201359 (1983)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"5_CR8","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(3), 305\u2013315 (1981)","journal-title":"Networks"},{"issue":"2","key":"5_CR9","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0360-8352(02)00178-X","volume":"44","author":"P Greistorfer","year":"2003","unstructured":"Greistorfer, P.: A tabu scatter search metaheuristic for the arc routing problem. Comput. Ind. Eng. 44(2), 249\u2013266 (2003)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"5_CR10","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(1), 129\u2013135 (2000)","journal-title":"Oper. Res."},{"issue":"1","key":"5_CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s12532-009-0002-8","volume":"1","author":"V Kolmogorov","year":"2009","unstructured":"Kolmogorov, V.: Blossom V: a new implementation of a minimum cost perfect matching algorithm. Math. Program. Comput. 1(1), 43\u201367 (2009)","journal-title":"Math. Program. Comput."},{"issue":"1\u20134","key":"5_CR12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/B:ANOR.0000039517.35989.6d","volume":"131","author":"P Lacomme","year":"2004","unstructured":"Lacomme, P., Prins, C., Ramdane-Cherif, W.: Competitive memetic algorithms for arc routing problems. Ann. Oper. Res. 131(1\u20134), 159\u2013185 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"5_CR13","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10732-007-9050-2","volume":"14","author":"M Polacek","year":"2008","unstructured":"Polacek, M., Doerner, K.F., Hartl, R.F., Maniezzo, V.: A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. J. Heuristics 14(5), 405\u2013423 (2008)","journal-title":"J. Heuristics"},{"issue":"2","key":"5_CR14","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.trb.2009.07.004","volume":"44","author":"L Santos","year":"2010","unstructured":"Santos, L., Coutinho-Rodrigues, J., Current, J.R.: An improved ant colony optimization based algorithm for the capacitated arc routing problem. Transp. Res. Part B Methodol. 44(2), 246\u2013266 (2010)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"5","key":"5_CR15","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1109\/TEVC.2009.2023449","volume":"13","author":"K Tang","year":"2009","unstructured":"Tang, K., Mei, Y., Yao, X.: Memetic algorithm with extended neighborhood search for capacitated arc routing problems. IEEE Trans. Evol. Comput. 13(5), 1151\u20131166 (2009)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39636-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T10:45:13Z","timestamp":1498301113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39636-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319396354","9783319396361"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39636-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}