{"title":"基于混合步长的布谷鸟搜索","authors":"A. Pandey, D. Rajpoot, M. Saraswat","doi":"10.1109/IC3.2017.8284285","DOIUrl":null,"url":null,"abstract":"Cuckoo Search is a metaheuristic optimization method which uses obligate brood parasitic conduct of cuckoos. Successive moves (steps) of a cuckoo are basically drawn from a process which uses biased random walk and follows power law step-length distribution with a heavy tail. Therefore, quick convergence and precision cannot be assured in most of the cases. To resolve the convergence and accuracy problem this paper proposes a novel cuckoo search method which uses Lévy flight and Gauss distribution in alternate iteration along with variable Pa and a. The experimental outcomes validate that the proposed method outperforms the existing methods.","PeriodicalId":147099,"journal":{"name":"2017 Tenth International Conference on Contemporary Computing (IC3)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Hybrid step size based cuckoo search\",\"authors\":\"A. Pandey, D. Rajpoot, M. Saraswat\",\"doi\":\"10.1109/IC3.2017.8284285\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cuckoo Search is a metaheuristic optimization method which uses obligate brood parasitic conduct of cuckoos. Successive moves (steps) of a cuckoo are basically drawn from a process which uses biased random walk and follows power law step-length distribution with a heavy tail. Therefore, quick convergence and precision cannot be assured in most of the cases. To resolve the convergence and accuracy problem this paper proposes a novel cuckoo search method which uses Lévy flight and Gauss distribution in alternate iteration along with variable Pa and a. The experimental outcomes validate that the proposed method outperforms the existing methods.\",\"PeriodicalId\":147099,\"journal\":{\"name\":\"2017 Tenth International Conference on Contemporary Computing (IC3)\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Tenth International Conference on Contemporary Computing (IC3)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC3.2017.8284285\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Tenth International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2017.8284285","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cuckoo Search is a metaheuristic optimization method which uses obligate brood parasitic conduct of cuckoos. Successive moves (steps) of a cuckoo are basically drawn from a process which uses biased random walk and follows power law step-length distribution with a heavy tail. Therefore, quick convergence and precision cannot be assured in most of the cases. To resolve the convergence and accuracy problem this paper proposes a novel cuckoo search method which uses Lévy flight and Gauss distribution in alternate iteration along with variable Pa and a. The experimental outcomes validate that the proposed method outperforms the existing methods.