{"title":"An Improved Simulated Annealing Algorithm for the Channel Allocation Problem in cellular networks","authors":"P. Girdinio, M. Nervi, M. Rossi","doi":"10.1109/CEFC-06.2006.1632918","DOIUrl":null,"url":null,"abstract":"Appropriate channel allocation on each cell is one of the most challenging issues in setting up and operating a cellular system, both for its practical importance, as the correct reuse of the available frequencies is crucial to guarantee good quality of service and good operating conditions of filters and power amplifiers, and its inherent difficulty, being the channel allocation problem (CAP) combinatorial, NP-hard and very highly constrained. In this paper an improvement to a simulated annealing based algorithm, in conjunction with several heuristics, is presented to face the problem, and its efficiency in solving a real-world application is shown","PeriodicalId":262549,"journal":{"name":"2006 12th Biennial IEEE Conference on Electromagnetic Field Computation","volume":"46 13","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 12th Biennial IEEE Conference on Electromagnetic Field Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEFC-06.2006.1632918","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Appropriate channel allocation on each cell is one of the most challenging issues in setting up and operating a cellular system, both for its practical importance, as the correct reuse of the available frequencies is crucial to guarantee good quality of service and good operating conditions of filters and power amplifiers, and its inherent difficulty, being the channel allocation problem (CAP) combinatorial, NP-hard and very highly constrained. In this paper an improvement to a simulated annealing based algorithm, in conjunction with several heuristics, is presented to face the problem, and its efficiency in solving a real-world application is shown