蜂窝网络的多准则优化

K. Lieska, E. Laitinen
{"title":"蜂窝网络的多准则优化","authors":"K. Lieska, E. Laitinen","doi":"10.1109/PIMRC.2001.965390","DOIUrl":null,"url":null,"abstract":"In this paper we propose a new method in order to replace the traditional network planning procedure. The new method is based on optimization of multicriteria, binomial objective function. The constraints of the objective function are formulated using a penalty method and genetic algorithms are used for solving the optimization problem. Numerical examples are presented in order to demonstrate the proper operation of the proposed method. An application to solve network planning problems in urban areas is presented.","PeriodicalId":318292,"journal":{"name":"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On multicriteria optimization of cellular networks\",\"authors\":\"K. Lieska, E. Laitinen\",\"doi\":\"10.1109/PIMRC.2001.965390\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a new method in order to replace the traditional network planning procedure. The new method is based on optimization of multicriteria, binomial objective function. The constraints of the objective function are formulated using a penalty method and genetic algorithms are used for solving the optimization problem. Numerical examples are presented in order to demonstrate the proper operation of the proposed method. An application to solve network planning problems in urban areas is presented.\",\"PeriodicalId\":318292,\"journal\":{\"name\":\"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2001.965390\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2001.965390","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

为了取代传统的网络规划程序,本文提出了一种新的网络规划方法。该方法基于多准则二项目标函数优化。采用惩罚法确定目标函数的约束条件,并采用遗传算法求解优化问题。通过数值算例验证了该方法的正确性。提出了一个解决城市网络规划问题的应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On multicriteria optimization of cellular networks
In this paper we propose a new method in order to replace the traditional network planning procedure. The new method is based on optimization of multicriteria, binomial objective function. The constraints of the objective function are formulated using a penalty method and genetic algorithms are used for solving the optimization problem. Numerical examples are presented in order to demonstrate the proper operation of the proposed method. An application to solve network planning problems in urban areas is presented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信