{"title":"An improved artificial immune system based on antibody remainder method for mathematical function optimization","authors":"D. Yap, A. Habibullah, S. P. Koh, S. Tiong","doi":"10.1109/SCORED.2010.5703996","DOIUrl":null,"url":null,"abstract":"Artificial immune system (AIS) is one of the nature-inspired algorithm for optimization problem. In AIS, clonal selection algorithm (CSA) is able to improve global searching ability. However, the CSA convergence and accuracy can be improved further because the hypermutation in CSA itself cannot always guarantee a better solution. Alternatively, Genetic Algorithms (GAs) and Particle Swarm Optimization (PSO) have been used efficiently in solving complex optimization problems, but they have a tendency to converge prematurely. In this study, the CSA is modified using the best solutions for each exposure (iteration) namely Remainder-CSA. The results show that the proposed algorithm is able to improve the conventional CSA in terms of accuracy and stability for single objective functions.","PeriodicalId":277771,"journal":{"name":"2010 IEEE Student Conference on Research and Development (SCOReD)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Student Conference on Research and Development (SCOReD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCORED.2010.5703996","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Artificial immune system (AIS) is one of the nature-inspired algorithm for optimization problem. In AIS, clonal selection algorithm (CSA) is able to improve global searching ability. However, the CSA convergence and accuracy can be improved further because the hypermutation in CSA itself cannot always guarantee a better solution. Alternatively, Genetic Algorithms (GAs) and Particle Swarm Optimization (PSO) have been used efficiently in solving complex optimization problems, but they have a tendency to converge prematurely. In this study, the CSA is modified using the best solutions for each exposure (iteration) namely Remainder-CSA. The results show that the proposed algorithm is able to improve the conventional CSA in terms of accuracy and stability for single objective functions.