用遗传算法求解可生存光网络的二次分配问题

2019 SBMO/IEEE MTT-S International Microwave and Optoelectronics Conference (IMOC) Pub Date : 2019-11-10 DOI:10.1109/IMOC43827.2019.9317641

Yrui Giovan Neris, M. Paiva, C. Pavan

{"title":"用遗传算法求解可生存光网络的二次分配问题","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":"{\"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}","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

摘要

我们提出了一种遗传算法，给定网络拓扑，找到最小化链路长度总和的双射。结果表明，即使对于较小的拓扑结构，遗传算法也比蛮力算法更快地找到相同的结果。但是，应该单独评估对其他性能变量的影响。

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

查看原文本刊更多论文

Solving Quadratic Assignment Problem for Survivable Optical Networks with Genetic Algorithm

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.

求助全文

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

来源期刊

2019 SBMO/IEEE MTT-S International Microwave and Optoelectronics Conference (IMOC)

自引率

0.00%

发文量