{"title":"改进的量子交叉克隆选择算法","authors":"Hongwei Dai, Yu Yang, Cunhua Li","doi":"10.1109/ICINIS.2010.56","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel quantum Clonal Selection Algorithm(NQCSA) which combines the traditional Clonal Selection Algorithm(CSA) and the improved quantum crossover for Traveling Salesman Problems (TSP). The NQCSA integrates the characteristics of both CSA and quantum mechanics. By using CSA which is derived from clonalselection theory, the solution space can be exploited and further explored parallel with more efficiency. Furthermore, the probability of local minimum can be reduced because of the quantum interference mechanics. The algorithm is applied to numerous bench-mark problems of TSP and the obtained results show effectiveness of the proposed algorithm.","PeriodicalId":319379,"journal":{"name":"2010 Third International Conference on Intelligent Networks and Intelligent Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Improved Quantum Crossover Based Clonal Selection Algorithm\",\"authors\":\"Hongwei Dai, Yu Yang, Cunhua Li\",\"doi\":\"10.1109/ICINIS.2010.56\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a novel quantum Clonal Selection Algorithm(NQCSA) which combines the traditional Clonal Selection Algorithm(CSA) and the improved quantum crossover for Traveling Salesman Problems (TSP). The NQCSA integrates the characteristics of both CSA and quantum mechanics. By using CSA which is derived from clonalselection theory, the solution space can be exploited and further explored parallel with more efficiency. Furthermore, the probability of local minimum can be reduced because of the quantum interference mechanics. The algorithm is applied to numerous bench-mark problems of TSP and the obtained results show effectiveness of the proposed algorithm.\",\"PeriodicalId\":319379,\"journal\":{\"name\":\"2010 Third International Conference on Intelligent Networks and Intelligent Systems\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Third International Conference on Intelligent Networks and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICINIS.2010.56\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Third International Conference on Intelligent Networks and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICINIS.2010.56","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improved Quantum Crossover Based Clonal Selection Algorithm
In this paper, we propose a novel quantum Clonal Selection Algorithm(NQCSA) which combines the traditional Clonal Selection Algorithm(CSA) and the improved quantum crossover for Traveling Salesman Problems (TSP). The NQCSA integrates the characteristics of both CSA and quantum mechanics. By using CSA which is derived from clonalselection theory, the solution space can be exploited and further explored parallel with more efficiency. Furthermore, the probability of local minimum can be reduced because of the quantum interference mechanics. The algorithm is applied to numerous bench-mark problems of TSP and the obtained results show effectiveness of the proposed algorithm.