电信网络规划中自适应算法的比较

TELSIKS 2005 - 2005 uth International Conference on Telecommunication in ModernSatellite, Cable and Broadcasting Services Pub Date : 2005-09-28 DOI:10.1109/TELSKS.2005.1572174

A. Tsenov

{"title":"电信网络规划中自适应算法的比较","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":"{\"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}","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

摘要

本工作的主要目标是通过解决电信集中器网络的拓扑问题，提出一种比较两种非传统算法的方法。提出了模拟退火算法(SA)和遗传算法(GA)。将所提出的算法用于寻找一个小型网络的最优解，并对结果进行了分析，对这些算法的正确使用提出了一些建议

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

查看原文本刊更多论文

A Comparison between Adaptive Algorithms in Telecommunications Networks Planning

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

求助全文

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

来源期刊

TELSIKS 2005 - 2005 uth International Conference on Telecommunication in ModernSatellite, Cable and Broadcasting Services

自引率

0.00%

发文量