{"title":"度约束最小生成树问题的一种新的局部搜索遗传算法","authors":"Yong Zeng, Yu-Ping Wang","doi":"10.1109/ICCIMA.2003.1238128","DOIUrl":null,"url":null,"abstract":"A new evolutionary algorithm for degree-constrained minimum spanning tree problem, which is an NP-complete problem, is proposed, and Prufer encoding method is adopted to encode the solutions of the problem. To enhance the algorithm, two new genetic operators are specifically designed, which can avoid producing infeasible solutions. In addition, two novel local search operators are designed and combined into the algorithm to further improve the quality of solutions. As a result, the proposed evolutionary algorithm can efficiently explore the search space.","PeriodicalId":385362,"journal":{"name":"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"A new genetic algorithm with local search method for degree-constrained minimum spanning tree problem\",\"authors\":\"Yong Zeng, Yu-Ping Wang\",\"doi\":\"10.1109/ICCIMA.2003.1238128\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new evolutionary algorithm for degree-constrained minimum spanning tree problem, which is an NP-complete problem, is proposed, and Prufer encoding method is adopted to encode the solutions of the problem. To enhance the algorithm, two new genetic operators are specifically designed, which can avoid producing infeasible solutions. In addition, two novel local search operators are designed and combined into the algorithm to further improve the quality of solutions. As a result, the proposed evolutionary algorithm can efficiently explore the search space.\",\"PeriodicalId\":385362,\"journal\":{\"name\":\"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIMA.2003.1238128\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIMA.2003.1238128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new genetic algorithm with local search method for degree-constrained minimum spanning tree problem
A new evolutionary algorithm for degree-constrained minimum spanning tree problem, which is an NP-complete problem, is proposed, and Prufer encoding method is adopted to encode the solutions of the problem. To enhance the algorithm, two new genetic operators are specifically designed, which can avoid producing infeasible solutions. In addition, two novel local search operators are designed and combined into the algorithm to further improve the quality of solutions. As a result, the proposed evolutionary algorithm can efficiently explore the search space.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
