{"title":"基于改进译码函数和跳变运算的动态搜索编码算法","authors":"Nam-Geun Kim, J. Yun, Sang Woo Kim","doi":"10.1109/ICNC.2007.358","DOIUrl":null,"url":null,"abstract":"In this paper, two techniques are proposed for globalizing and accelerating the dynamic encoding algorithm for searches (DEAS) method which is developed within the framework of applying the binary representation in optimization and modified for global search using a multi-start approach. These techniques make DEAS fitted better to global optimization than the previously developed ones. The results of numerical simulations show that the proposed techniques are effective in discontinuous and multimodal cost functions.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"194 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhancement of Dynamic Encoding Algorithm for Searches (DEAS) via Modified Decoding Function and Hopping Operation\",\"authors\":\"Nam-Geun Kim, J. Yun, Sang Woo Kim\",\"doi\":\"10.1109/ICNC.2007.358\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, two techniques are proposed for globalizing and accelerating the dynamic encoding algorithm for searches (DEAS) method which is developed within the framework of applying the binary representation in optimization and modified for global search using a multi-start approach. These techniques make DEAS fitted better to global optimization than the previously developed ones. The results of numerical simulations show that the proposed techniques are effective in discontinuous and multimodal cost functions.\",\"PeriodicalId\":250881,\"journal\":{\"name\":\"Third International Conference on Natural Computation (ICNC 2007)\",\"volume\":\"194 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Natural Computation (ICNC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2007.358\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Natural Computation (ICNC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2007.358","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Enhancement of Dynamic Encoding Algorithm for Searches (DEAS) via Modified Decoding Function and Hopping Operation
In this paper, two techniques are proposed for globalizing and accelerating the dynamic encoding algorithm for searches (DEAS) method which is developed within the framework of applying the binary representation in optimization and modified for global search using a multi-start approach. These techniques make DEAS fitted better to global optimization than the previously developed ones. The results of numerical simulations show that the proposed techniques are effective in discontinuous and multimodal cost functions.