{"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.