A. Rahimi, Milad Ahangaran, P. Ramezani, Tarlan Kashkooli
{"title":"An Improved Artificial Weed Colony for Continuous Optimization","authors":"A. Rahimi, Milad Ahangaran, P. Ramezani, Tarlan Kashkooli","doi":"10.1109/EMS.2011.30","DOIUrl":null,"url":null,"abstract":"In this paper, after a literature review, studies will be concentrated on standard deviation of invasive weedoptimization's normal distribution function which is used for distributing seeds of each weed over the search space. Although invasive weed optimization is a great algorithm to solve real world practical optimization problems but there is a serious drawback in distributing the seeds over the search space. A new concept will be presented to distribute seeds of each weed over the search space which increases the robustness and effectiveness of algorithm, and therefore leads to an improved invasive weed optimization. Simulation on a set of unconstrained benchmark functions reveals the superiority of the proposed algorithm in quick convergence and finding better solutions compared to the original invasive weed optimization.","PeriodicalId":131364,"journal":{"name":"2011 UKSim 5th European Symposium on Computer Modeling and Simulation","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 UKSim 5th European Symposium on Computer Modeling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMS.2011.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In this paper, after a literature review, studies will be concentrated on standard deviation of invasive weedoptimization's normal distribution function which is used for distributing seeds of each weed over the search space. Although invasive weed optimization is a great algorithm to solve real world practical optimization problems but there is a serious drawback in distributing the seeds over the search space. A new concept will be presented to distribute seeds of each weed over the search space which increases the robustness and effectiveness of algorithm, and therefore leads to an improved invasive weed optimization. Simulation on a set of unconstrained benchmark functions reveals the superiority of the proposed algorithm in quick convergence and finding better solutions compared to the original invasive weed optimization.