一种高效的PMFAP算法

2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI:10.1109/COMSNETS.2016.7440013

Soumen Atta, P. Mahapatra

{"title":"一种高效的PMFAP算法","authors":"Soumen Atta, P. Mahapatra","doi":"10.1109/COMSNETS.2016.7440013","DOIUrl":null,"url":null,"abstract":"Perturbation-Minimizing Frequency Assignment Problem (PMFAP) is a frequency assignment problem in which newly generated demands are satisfied with minimum change in the already existing frequency assignment keeping all the interference constraints. In this paper an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorithm is compared with the existing results from literature. The proposed algorithm also works for the well-known Frequency Assignment Problem (FAP) and its performance is compared with the existing results for the standard benchmark data sets.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient algorithm for PMFAP\",\"authors\":\"Soumen Atta, P. Mahapatra\",\"doi\":\"10.1109/COMSNETS.2016.7440013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Perturbation-Minimizing Frequency Assignment Problem (PMFAP) is a frequency assignment problem in which newly generated demands are satisfied with minimum change in the already existing frequency assignment keeping all the interference constraints. In this paper an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorithm is compared with the existing results from literature. The proposed algorithm also works for the well-known Frequency Assignment Problem (FAP) and its performance is compared with the existing results for the standard benchmark data sets.\",\"PeriodicalId\":185861,\"journal\":{\"name\":\"2016 8th International Conference on Communication Systems and Networks (COMSNETS)\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 8th International Conference on Communication Systems and Networks (COMSNETS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSNETS.2016.7440013\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2016.7440013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

最小摄动频率分配问题(PMFAP)是在保持所有干扰约束的情况下，使已有频率分配变化最小以满足新产生的需求的频率分配问题。本文提出了一种有效的PMFAP启发式算法。将该算法的效率与已有的文献结果进行了比较。该算法同样适用于常见的频率分配问题(FAP)，并将其性能与现有标准基准数据集的结果进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An efficient algorithm for PMFAP

Perturbation-Minimizing Frequency Assignment Problem (PMFAP) is a frequency assignment problem in which newly generated demands are satisfied with minimum change in the already existing frequency assignment keeping all the interference constraints. In this paper an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorithm is compared with the existing results from literature. The proposed algorithm also works for the well-known Frequency Assignment Problem (FAP) and its performance is compared with the existing results for the standard benchmark data sets.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 8th International Conference on Communication Systems and Networks (COMSNETS)

自引率

0.00%

发文量