Genetic and local search algorithms applied to balanced communication networks

E. Bernardino, A. Bernardino, J. M. Sánchez-Pérez, J. Pulido, M. A. Vega-Rodríguez
{"title":"Genetic and local search algorithms applied to balanced communication networks","authors":"E. Bernardino, A. Bernardino, J. M. Sánchez-Pérez, J. Pulido, M. A. Vega-Rodríguez","doi":"10.1145/2093698.2093822","DOIUrl":null,"url":null,"abstract":"In this paper we describe the application of different heuristics to optimise large communication networks. We use Iterated Local Search (ILS), Tabu Search (TS), Simulated Annealing (SA) and Genetic Algorithm (GA) to minimise the link cost to form balanced communication networks. This paper makes a comparison among the effectiveness of ILS, TS, SA and GA on solving large communication networks. Simulation results verify the effectiveness of these algorithms.","PeriodicalId":91990,"journal":{"name":"... International Symposium on Applied Sciences in Biomedical and Communication Technologies. International Symposium on Applied Sciences in Biomedical and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"... International Symposium on Applied Sciences in Biomedical and Communication Technologies. International Symposium on Applied Sciences in Biomedical and Communication Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2093698.2093822","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper we describe the application of different heuristics to optimise large communication networks. We use Iterated Local Search (ILS), Tabu Search (TS), Simulated Annealing (SA) and Genetic Algorithm (GA) to minimise the link cost to form balanced communication networks. This paper makes a comparison among the effectiveness of ILS, TS, SA and GA on solving large communication networks. Simulation results verify the effectiveness of these algorithms.
遗传和局部搜索算法在平衡通信网络中的应用
在本文中,我们描述了不同的启发式优化大型通信网络的应用。我们使用迭代局部搜索(ILS)、禁忌搜索(TS)、模拟退火(SA)和遗传算法(GA)来最小化链路成本,以形成平衡的通信网络。本文比较了ILS、TS、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学术官方微信