{"title":"Tuning Evolutionary Algorithm Performance Using Nature Inspired Heuristics","authors":"A. Abraham","doi":"10.1109/SYNASC.2006.78","DOIUrl":null,"url":null,"abstract":"Summary form only given. Evolutionary algorithms have become an important problem solving methodology among many researchers working in the area of computational intelligence. The population based collective learning process; self adaptation and robustness are some of the key features of evolutionary algorithm when compared to other global optimization techniques. Due to its simplicity, evolutionary algorithms have been widely accepted for solving several important practical applications in engineering, business, commerce etc. However, experimental evidence had indicated cases where evolutionary algorithms are inefficient at fine tuning solutions, but better at finding global basins of attraction. The efficiency of evolutionary training can be improved significantly by hybridization of some search procedures or incorporating some heuristics into the evolution process. In this talk, we will review how particle swarm optimization algorithm and bacterial foraging algorithm could be used to optimize the performance of evolutionary algorithms. The performance of the hybridized algorithms will be illustrated using some benchmark problems","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2006.78","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Summary form only given. Evolutionary algorithms have become an important problem solving methodology among many researchers working in the area of computational intelligence. The population based collective learning process; self adaptation and robustness are some of the key features of evolutionary algorithm when compared to other global optimization techniques. Due to its simplicity, evolutionary algorithms have been widely accepted for solving several important practical applications in engineering, business, commerce etc. However, experimental evidence had indicated cases where evolutionary algorithms are inefficient at fine tuning solutions, but better at finding global basins of attraction. The efficiency of evolutionary training can be improved significantly by hybridization of some search procedures or incorporating some heuristics into the evolution process. In this talk, we will review how particle swarm optimization algorithm and bacterial foraging algorithm could be used to optimize the performance of evolutionary algorithms. The performance of the hybridized algorithms will be illustrated using some benchmark problems