El Bouti Mohamed, El Ghazi Raouan, Benameur Lamia, A. Jihane
{"title":"Fireworks Algorithm for Frequency Assignment Problem","authors":"El Bouti Mohamed, El Ghazi Raouan, Benameur Lamia, A. Jihane","doi":"10.1145/3386723.3387823","DOIUrl":null,"url":null,"abstract":"In this paper, a new approach to resolve the problem of frequency assignment problem is proposed. (FAP) is well known in the NP-complete problems and can be modeled as an optimization problem, which the objective is to minimize the costs due to interference generated by a solution. The fireworks algorithm (FWA) is proposed for solving FAP. FWA is a recently developed swarm intelligence algorithm. FWA is a meta-heuristic method and has a good convergence property and can always find the global optimal solutions.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"178 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3386723.3387823","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this paper, a new approach to resolve the problem of frequency assignment problem is proposed. (FAP) is well known in the NP-complete problems and can be modeled as an optimization problem, which the objective is to minimize the costs due to interference generated by a solution. The fireworks algorithm (FWA) is proposed for solving FAP. FWA is a recently developed swarm intelligence algorithm. FWA is a meta-heuristic method and has a good convergence property and can always find the global optimal solutions.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
