{"title":"模糊参数图中代价最小的κ生成树集的免疫启发算法","authors":"T.A. Almeida, A. Yamakami","doi":"10.1109/NAFIPS.2008.4531219","DOIUrl":null,"url":null,"abstract":"In this work, we present an immune-inspired algorithm based on evolutionary computation to find the set of k-spanning trees with lowest costs in graphs with uncertainties in their parameters. In order to avoid the high complexity of the traditional approaches, we present an artificial immune system for exploring the search space looking for satisfactory results, without the necessity of comparing all possible solutions.","PeriodicalId":430770,"journal":{"name":"NAFIPS 2008 - 2008 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Immune-inspired algorithm to find the set of κ-spanning trees with lowest costs in graphs with fuzzy parameters\",\"authors\":\"T.A. Almeida, A. Yamakami\",\"doi\":\"10.1109/NAFIPS.2008.4531219\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we present an immune-inspired algorithm based on evolutionary computation to find the set of k-spanning trees with lowest costs in graphs with uncertainties in their parameters. In order to avoid the high complexity of the traditional approaches, we present an artificial immune system for exploring the search space looking for satisfactory results, without the necessity of comparing all possible solutions.\",\"PeriodicalId\":430770,\"journal\":{\"name\":\"NAFIPS 2008 - 2008 Annual Meeting of the North American Fuzzy Information Processing Society\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"NAFIPS 2008 - 2008 Annual Meeting of the North American Fuzzy Information Processing Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAFIPS.2008.4531219\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"NAFIPS 2008 - 2008 Annual Meeting of the North American Fuzzy Information Processing Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAFIPS.2008.4531219","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Immune-inspired algorithm to find the set of κ-spanning trees with lowest costs in graphs with fuzzy parameters
In this work, we present an immune-inspired algorithm based on evolutionary computation to find the set of k-spanning trees with lowest costs in graphs with uncertainties in their parameters. In order to avoid the high complexity of the traditional approaches, we present an artificial immune system for exploring the search space looking for satisfactory results, without the necessity of comparing all possible solutions.