{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T19:47:21Z","timestamp":1776282441451,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,2,11]],"date-time":"2017-02-11T00:00:00Z","timestamp":1486771200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61371201"],"award-info":[{"award-number":["61371201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"The National Basic Research Program (973 Program) of China","award":["2013CB329402"],"award-info":[{"award-number":["2013CB329402"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s12293-017-0224-7","type":"journal-article","created":{"date-parts":[[2017,2,11]],"date-time":"2017-02-11T14:20:07Z","timestamp":1486822807000},"page":"81-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Quantum-Inspired Immune Clonal Algorithm for solving large-scale capacitated arc routing problems"],"prefix":"10.1007","volume":"10","author":[{"given":"Ronghua","family":"Shang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bingqi","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaiyun","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Licheng","family":"Jiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir M. Ghalamzan","family":"Esfahani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rustam","family":"Stolkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,11]]},"reference":[{"issue":"1","key":"224_CR1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.asoc.2014.03.005","volume":"19","author":"RH Shang","year":"2014","unstructured":"Shang RH, Wang J, Jiao LC, Wang YY (2014) An improved decomposition-based memetic algorithm for multi-objective capacitated arc routing problem. Appl Soft Comput 19(1):343\u2013361","journal-title":"Appl Soft Comput"},{"issue":"1","key":"224_CR2","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ins.2014.10.040","volume":"295","author":"XZ Wen","year":"2015","unstructured":"Wen XZ, Shao L, Xue Y, Fang W (2015) A rapid learning algorithm for vehicle classification. Inform Sci 295(1):395\u2013406","journal-title":"Inform Sci"},{"issue":"2","key":"224_CR3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TEVC.2010.2051446","volume":"15","author":"Y Mei","year":"2011","unstructured":"Mei Y, Tang K, Yao X (2011) Decomposition-based memetic algorithm for multi-objective capacitated arc routing problems. IEEE Trans Evolut Comput 15(2):151\u2013165","journal-title":"IEEE Trans Evolut Comput"},{"issue":"1","key":"224_CR4","first-page":"171","volume":"16","author":"J Shen","year":"2015","unstructured":"Shen J, Tan HW, Wang J, Wang JW, Lee SY (2015) A novel routing protocol providing good transmission reliability in underwater sensor networks. J Internet Technol 16(1):171\u2013178","journal-title":"J Internet Technol"},{"issue":"1","key":"224_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0305-0548(83)90026-6","volume":"10","author":"BL Golden","year":"1983","unstructured":"Golden BL, DeArmon JS, Baker EK (1983) Computational experiments with algorithms for a class of routing problems. Comput Oper Res 10(1):47\u201359","journal-title":"Comput Oper Res"},{"issue":"3","key":"224_CR6","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0377-2217(85)90252-8","volume":"22","author":"G Ulusoy","year":"1985","unstructured":"Ulusoy G (1985) The fleet size and mix problem for capacitated arc routing. Eur J Oper Res 22(3):329\u2013337","journal-title":"Eur J Oper Res"},{"issue":"2","key":"224_CR7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0305-0548(91)90089-A","volume":"18","author":"WL Pearn","year":"1991","unstructured":"Pearn WL (1991) Augment-insert algorithms for the capacitated arc routing problem. Comput Oper Res 18(2):189\u2013198","journal-title":"Comput Oper Res"},{"issue":"6","key":"224_CR8","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/0305-0548(89)90044-0","volume":"16","author":"WL Pearn","year":"1989","unstructured":"Pearn WL (1989) Approximate solutions for the capacitated arc routing problem. Comput Oper Res 16(6):589\u2013600","journal-title":"Comput Oper Res"},{"key":"224_CR9","volume-title":"Multi-objective evolutionary algorithms and applications","author":"KC Tan","year":"2005","unstructured":"Tan KC, Khor EF, Lee TH (2005) Multi-objective evolutionary algorithms and applications. Springer, Berlin"},{"issue":"2","key":"224_CR10","first-page":"340","volume":"27","author":"ZH Xia","year":"2015","unstructured":"Xia ZH, Wang XH, Sun XM, Wang Q (2015) A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst 27(2):340\u2013352","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"224_CR11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.asoc.2013.10.017","volume":"15","author":"M Reed","year":"2014","unstructured":"Reed M, Yiannakou A, Evering R (2014) An ant colony algorithm for the multi-compartment vehicle routing problem. Appl Soft Comput 15:169\u2013176","journal-title":"Appl Soft Comput"},{"key":"224_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic, Boston"},{"issue":"6","key":"224_CR13","doi-asserted-by":"crossref","first-page":"1654","DOI":"10.1109\/TSMCB.2011.2158307","volume":"41","author":"Y Mei","year":"2011","unstructured":"Mei Y, Tang K, Yao X (2011) A memetic algorithm for periodic capacitated arc routing problem. IEEE Trans Syst Man Cybern B 41(6):1654\u20131667","journal-title":"IEEE Trans Syst Man Cybern B"},{"issue":"2","key":"224_CR14","doi-asserted-by":"crossref","first-page":"961","DOI":"10.3233\/IFS-141378","volume":"28","author":"YH Zheng","year":"2015","unstructured":"Zheng YH, Jeon B, Xu DH, Wu QMJ, Zhang H (2015) Image segmentation by generalized hierarchical fuzzy C-means algorithm. J Intell Fuzzy Syst 28(2):961\u2013973","journal-title":"J Intell Fuzzy Syst"},{"issue":"2","key":"224_CR15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s12293-011-0070-y","volume":"4","author":"MC Goldbarg","year":"2012","unstructured":"Goldbarg MC, Asconavieta PH (2012) Memetic algorithm for the traveling car renter problem: an experimental investigation. Memet Comput 4(2):89\u2013108","journal-title":"Memet Comput"},{"issue":"3","key":"224_CR16","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s12293-015-0166-x","volume":"7","author":"L Feng","year":"2015","unstructured":"Feng L, Ong YS, Tan AH, Tsang IW (2015) Memes as building blocks: a case study on evolutionary optimization+transfer learning for routing problems. Memet Comput 7(3):159\u2013180","journal-title":"Memet Comput"},{"issue":"1","key":"224_CR17","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 (2000) A tabu search heuristic for the capacitated arc routing problem. Oper Res 48(1):129\u2013135","journal-title":"Oper Res"},{"issue":"4","key":"224_CR18","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 (2001) A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Trans Sci 35(4):425\u2013434","journal-title":"Trans Sci"},{"issue":"1\u20134","key":"224_CR19","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 (2004) Competitive memetic algorithms for arc routing problem. Ann Oper Res 131(1\u20134):159\u2013185","journal-title":"Ann Oper Res"},{"issue":"1","key":"224_CR20","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TEVC.2010.2046328","volume":"16","author":"RH Shang","year":"2012","unstructured":"Shang RH, Jiao LC, Liu F (2012) A novel immune clonal algorithm for MO problems. IEEE Trans Evolut Comput 16(1):35\u201349","journal-title":"IEEE Trans Evolut Comput"},{"issue":"1","key":"224_CR21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s12293-009-0028-5","volume":"2","author":"M Gong","year":"2010","unstructured":"Gong M, Liu C, Jiao L, Cheng G (2010) Hybrid immune algorithm with Lamarckian local search for multi-objective optimization. Memet Comput 2(1):47\u201367","journal-title":"Memet Comput"},{"issue":"5","key":"224_CR22","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 (2009) Memetic algorithm with extended neighborhood search for capacitated arc routing problems. IEEE Trans Evolut Comput 13(5):1151\u20131166","journal-title":"IEEE Trans Evolut Comput"},{"issue":"3","key":"224_CR23","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1109\/TEVC.2013.2281503","volume":"18","author":"Y Mei","year":"2014","unstructured":"Mei Y, Li XD, Yao X (2014) Cooperative co-evolution with route distance grouping for large-scale capacitated arc routing problems. IEEE Trans Evolut Comput 18(3):435\u2013449","journal-title":"IEEE Trans Evolut Comput"},{"issue":"4","key":"224_CR24","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s12293-012-0095-x","volume":"4","author":"A Tonda","year":"2012","unstructured":"Tonda A, Lutton E, Squillero G (2012) A benchmark for cooperative coevolution. Memet Comput 4(4):263\u2013277","journal-title":"Memet Comput"},{"issue":"1","key":"224_CR25","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s12293-012-0077-z","volume":"4","author":"ML Nguyen","year":"2012","unstructured":"Nguyen ML, Hui SC, Fong ACM (2012) Divide-and-conquer memetic algorithm for online multi-objective test paper generation. Memet Comput 4(1):33\u201347","journal-title":"Memet Comput"},{"issue":"7","key":"224_CR26","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.ins.2014.03.008","volume":"27","author":"RH Shang","year":"2014","unstructured":"Shang RH, Wang YY, Wang J, Jiao LC, Wang S, Qi LP (2014) A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem. Inform Sci 27(7):609\u2013642","journal-title":"Inform Sci"},{"issue":"1","key":"224_CR27","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1959","unstructured":"Dijkstra E (1959) A note on two problems in connexion with graphs. Number Math 1(1):269\u2013271","journal-title":"Number Math"},{"issue":"3","key":"224_CR28","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s12293-015-0161-2","volume":"7","author":"M Marinaki","year":"2015","unstructured":"Marinaki M, Marinakis Y (2015) A hybridization of clonal selection algorithm with iterated local search and variable neighborhood search for the feature selection problem. Memet Comput 7(3):181\u2013201","journal-title":"Memet Comput"},{"issue":"3","key":"224_CR29","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/TEVC.2002.1011539","volume":"6","author":"LN Castro De","year":"2002","unstructured":"De Castro LN, Von Zuben FJ (2002) Learning and optimization using the clonal selection principle. IEEE Trans Evolut Comput 6(3):239\u2013251","journal-title":"IEEE Trans Evolut Comput"},{"issue":"5","key":"224_CR30","doi-asserted-by":"crossref","first-page":"1234","DOI":"10.1109\/TSMCB.2008.927271","volume":"38","author":"LC Jiao","year":"2008","unstructured":"Jiao LC, Li YY, Gong MG, Zhang XR (2008) Quantum-inspired immune clonal algorithm for global optimization. IEEE Trans Syst Man Cybern B (Cybernetics) 38(5):1234\u20131253","journal-title":"IEEE Trans Syst Man Cybern B (Cybernetics)"},{"key":"224_CR31","doi-asserted-by":"crossref","unstructured":"Li YY, Jiao LC (2005) Quantum-inspired immune clonal algorithm. In: Proceedings of the 4th international conference on artificial immune systems, Banff, pp 304\u2013317","DOI":"10.1007\/11536444_23"},{"issue":"1","key":"224_CR32","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/MCI.2006.1597056","volume":"1","author":"H Handa","year":"2006","unstructured":"Handa H, Chapman L, Yao X (2006) Robust route optimization for gritting\/salting trucks: a CERCIA experience. IEEE Comput Intell Mag 1(1):6\u20139","journal-title":"IEEE Comput Intell Mag"},{"issue":"3","key":"224_CR33","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1109\/TSMCB.2008.2008906","volume":"39","author":"Y Mei","year":"2009","unstructured":"Mei Y, Tang K, Yao X (2009) A global repair operator for capacitated arc routing problem. IEEE Trans Syst Man Cyber B 39(3):723\u2013734","journal-title":"IEEE Trans Syst Man Cyber B"},{"key":"224_CR34","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/j.asoc.2015.08.003","volume":"37","author":"ZR Wang","year":"2015","unstructured":"Wang ZR, Jin HY, Tian MM (2015) Rank-based memetic algorithm for capacitated arc routing problems. Appl Soft Comput 37:572\u2013584","journal-title":"Appl Soft Comput"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-017-0224-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-017-0224-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-017-0224-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T08:30:54Z","timestamp":1601627454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-017-0224-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,11]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["224"],"URL":"https:\/\/doi.org\/10.1007\/s12293-017-0224-7","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,11]]}}}