Solving Quadratic Assignment Problem for Survivable Optical Networks with Genetic Algorithm

Yrui Giovan Neris, M. Paiva, C. Pavan
{"title":"Solving Quadratic Assignment Problem for Survivable Optical Networks with Genetic Algorithm","authors":"Yrui Giovan Neris, M. Paiva, C. Pavan","doi":"10.1109/IMOC43827.2019.9317641","DOIUrl":null,"url":null,"abstract":"We propose a genetic algorithm that, given a network topology, find a bijection that minimizes the sum of link lengths. Results show the genetic algorithm is faster than a brute force algorithm to find the same outcomes, even for small topologies. However, an individual evaluation of the impact on other performance variables should be taken.","PeriodicalId":175865,"journal":{"name":"2019 SBMO/IEEE MTT-S International Microwave and Optoelectronics Conference (IMOC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 SBMO/IEEE MTT-S International Microwave and Optoelectronics Conference (IMOC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMOC43827.2019.9317641","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We propose a genetic algorithm that, given a network topology, find a bijection that minimizes the sum of link lengths. Results show the genetic algorithm is faster than a brute force algorithm to find the same outcomes, even for small topologies. However, an individual evaluation of the impact on other performance variables should be taken.
用遗传算法求解可生存光网络的二次分配问题
我们提出了一种遗传算法,给定网络拓扑,找到最小化链路长度总和的双射。结果表明,即使对于较小的拓扑结构,遗传算法也比蛮力算法更快地找到相同的结果。但是,应该单独评估对其他性能变量的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信