基于整数染色体遗传算法的电信网分布路径优化——一个实际应用

J. Medina, L. García-Santander, M. Retamal, Rosa Figueroa Iturrieta
{"title":"基于整数染色体遗传算法的电信网分布路径优化——一个实际应用","authors":"J. Medina, L. García-Santander, M. Retamal, Rosa Figueroa Iturrieta","doi":"10.1109/CONIELECOMP.2006.44","DOIUrl":null,"url":null,"abstract":"This paper presents the new method based on Genetic Algorithm (GA) to find the optimal route of the main communication line with multi-pair copper cable. The chromosomes representation used was the integer number. The objective function considered a minimization cost of generates routes keeping the minimum cost per subscriber value. The proposed method was proven with a real demand of subscribers located in a defined area using two tests, with or without Demand Factor (DF). The results obtained when applying the proposed method with or without DF allow us to conclude that the method is efficient and it gives coherent results according to the characteristics of the analyzed nets.","PeriodicalId":371526,"journal":{"name":"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal Route in Distribution of Telecommunications Networks Based on Genetic Algorithm with Integer Chromosomes, a Practical Application\",\"authors\":\"J. Medina, L. García-Santander, M. Retamal, Rosa Figueroa Iturrieta\",\"doi\":\"10.1109/CONIELECOMP.2006.44\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents the new method based on Genetic Algorithm (GA) to find the optimal route of the main communication line with multi-pair copper cable. The chromosomes representation used was the integer number. The objective function considered a minimization cost of generates routes keeping the minimum cost per subscriber value. The proposed method was proven with a real demand of subscribers located in a defined area using two tests, with or without Demand Factor (DF). The results obtained when applying the proposed method with or without DF allow us to conclude that the method is efficient and it gives coherent results according to the characteristics of the analyzed nets.\",\"PeriodicalId\":371526,\"journal\":{\"name\":\"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CONIELECOMP.2006.44\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONIELECOMP.2006.44","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种基于遗传算法的多对铜缆主通信线路最优路由求解方法。使用的染色体表示是整数。目标函数考虑的是生成的路由的最小开销,保持每个用户的最小开销。通过有或没有需求因子(DF)的两个测试,对指定区域内用户的实际需求进行了验证。采用该方法得到的结果表明,该方法是有效的,并根据所分析网的特点给出了一致的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal Route in Distribution of Telecommunications Networks Based on Genetic Algorithm with Integer Chromosomes, a Practical Application
This paper presents the new method based on Genetic Algorithm (GA) to find the optimal route of the main communication line with multi-pair copper cable. The chromosomes representation used was the integer number. The objective function considered a minimization cost of generates routes keeping the minimum cost per subscriber value. The proposed method was proven with a real demand of subscribers located in a defined area using two tests, with or without Demand Factor (DF). The results obtained when applying the proposed method with or without DF allow us to conclude that the method is efficient and it gives coherent results according to the characteristics of the analyzed nets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信