{"title":"信道分配问题的遗传算法","authors":"Monica Cuppini","doi":"10.1002/ett.4460050219","DOIUrl":null,"url":null,"abstract":"Channel assignment problems are NP-complete optimization problems occurring during design of cellular radio systems. So far, these problems have been treated by sequential graph coloring algorithms [1, 2] and by heuristic techniques [3, 4]. On the other hand, genetic algorithms (GAs) were successfully applied to other NP-complete problems. In this paper, a strategy for using genetic algorithms to solve channel assignment problems is presented.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"10 1","pages":"285-294"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"63","resultStr":"{\"title\":\"A genetic algorithm for channel assignment problems\",\"authors\":\"Monica Cuppini\",\"doi\":\"10.1002/ett.4460050219\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Channel assignment problems are NP-complete optimization problems occurring during design of cellular radio systems. So far, these problems have been treated by sequential graph coloring algorithms [1, 2] and by heuristic techniques [3, 4]. On the other hand, genetic algorithms (GAs) were successfully applied to other NP-complete problems. In this paper, a strategy for using genetic algorithms to solve channel assignment problems is presented.\",\"PeriodicalId\":50473,\"journal\":{\"name\":\"European Transactions on Telecommunications\",\"volume\":\"10 1\",\"pages\":\"285-294\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"63\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Transactions on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/ett.4460050219\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Transactions on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/ett.4460050219","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A genetic algorithm for channel assignment problems
Channel assignment problems are NP-complete optimization problems occurring during design of cellular radio systems. So far, these problems have been treated by sequential graph coloring algorithms [1, 2] and by heuristic techniques [3, 4]. On the other hand, genetic algorithms (GAs) were successfully applied to other NP-complete problems. In this paper, a strategy for using genetic algorithms to solve channel assignment problems is presented.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
