{"title":"自适应进化网络编码算法:一种约束处理方法","authors":"C. Ahn, Minkyu Kim","doi":"10.1109/IWACI.2010.5585171","DOIUrl":null,"url":null,"abstract":"This paper presents a self-adaptive evolutionary network coding algorithm (SA-ENCA) that minimizes the resources of network coding while achieving the target throughput of multicast. The idea is to adaptively engage infeasible solutions as well in searching for better solutions. This is achieved by assigning fitness to the infeasible solutions by balancing corresponding objective function values against constraint violations. Dealing with the constrained network coding problems in an unconstrained manner, SA-ENCA does not suffer from the drawbacks of existing approaches. In other words, it is able to effectively cope with selection noise and automatically discover a feasible seed in the course of evolution. Empirical study has adduced grounds for the effectiveness of the proposed approach.","PeriodicalId":189187,"journal":{"name":"Third International Workshop on Advanced Computational Intelligence","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Self-adaptive evolutionary network coding algorithm: A constraint handling approach\",\"authors\":\"C. Ahn, Minkyu Kim\",\"doi\":\"10.1109/IWACI.2010.5585171\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a self-adaptive evolutionary network coding algorithm (SA-ENCA) that minimizes the resources of network coding while achieving the target throughput of multicast. The idea is to adaptively engage infeasible solutions as well in searching for better solutions. This is achieved by assigning fitness to the infeasible solutions by balancing corresponding objective function values against constraint violations. Dealing with the constrained network coding problems in an unconstrained manner, SA-ENCA does not suffer from the drawbacks of existing approaches. In other words, it is able to effectively cope with selection noise and automatically discover a feasible seed in the course of evolution. Empirical study has adduced grounds for the effectiveness of the proposed approach.\",\"PeriodicalId\":189187,\"journal\":{\"name\":\"Third International Workshop on Advanced Computational Intelligence\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Workshop on Advanced Computational Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWACI.2010.5585171\",\"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 Workshop on Advanced Computational Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWACI.2010.5585171","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Self-adaptive evolutionary network coding algorithm: A constraint handling approach
This paper presents a self-adaptive evolutionary network coding algorithm (SA-ENCA) that minimizes the resources of network coding while achieving the target throughput of multicast. The idea is to adaptively engage infeasible solutions as well in searching for better solutions. This is achieved by assigning fitness to the infeasible solutions by balancing corresponding objective function values against constraint violations. Dealing with the constrained network coding problems in an unconstrained manner, SA-ENCA does not suffer from the drawbacks of existing approaches. In other words, it is able to effectively cope with selection noise and automatically discover a feasible seed in the course of evolution. Empirical study has adduced grounds for the effectiveness of the proposed approach.