A Comparison between Adaptive Algorithms in Telecommunications Networks Planning

A. Tsenov
{"title":"A Comparison between Adaptive Algorithms in Telecommunications Networks Planning","authors":"A. Tsenov","doi":"10.1109/TELSKS.2005.1572174","DOIUrl":null,"url":null,"abstract":"The main goal of this work is to propose a way to compare two nontraditional algorithms by solving topological problems on telecommunications concentrator networks. The algorithms suggested are the simulated annealing algorithm (SA) and the genetic algorithm (GA). The proposed algorithms are used for finding an optimal solution for a small network, the results are being analyzed and some recommendations for the proper use of these algorithms are made","PeriodicalId":422115,"journal":{"name":"TELSIKS 2005 - 2005 uth International Conference on Telecommunication in ModernSatellite, Cable and Broadcasting Services","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"TELSIKS 2005 - 2005 uth International Conference on Telecommunication in ModernSatellite, Cable and Broadcasting Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TELSKS.2005.1572174","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The main goal of this work is to propose a way to compare two nontraditional algorithms by solving topological problems on telecommunications concentrator networks. The algorithms suggested are the simulated annealing algorithm (SA) and the genetic algorithm (GA). The proposed algorithms are used for finding an optimal solution for a small network, the results are being analyzed and some recommendations for the proper use of these algorithms are made
电信网络规划中自适应算法的比较
本工作的主要目标是通过解决电信集中器网络的拓扑问题,提出一种比较两种非传统算法的方法。提出了模拟退火算法(SA)和遗传算法(GA)。将所提出的算法用于寻找一个小型网络的最优解,并对结果进行了分析,对这些算法的正确使用提出了一些建议
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信