混合蜜蜂交配优化算法分配终端到集中器

E. Bernardino, A. Bernardino, J. M. Sánchez-Pérez, J. Gómez-Pulido, M. A. Vega-Rodríguez
{"title":"混合蜜蜂交配优化算法分配终端到集中器","authors":"E. Bernardino, A. Bernardino, J. M. Sánchez-Pérez, J. Gómez-Pulido, M. A. Vega-Rodríguez","doi":"10.1109/ISABEL.2010.5702845","DOIUrl":null,"url":null,"abstract":"In this paper we propose a new approach to assign terminals to concentrators using a Hybrid Honey Bees Mating Optimisation algorithm. Honey Bees Mating Optimisation (HBMO) algorithm is a swarm-based optimisation algorithm, which simulates the mating process of real honey bees. We apply a hybridisation of HBMO to solve a combinatorial optimisation problem known as Terminal Assignment Problem (TAP). The purpose is to connect a given set of terminals to a given set of concentrators and minimise the link cost to form a communication network. The feasibility of Hybrid HBMO is demonstrated and compared with the solutions obtained by other algorithms from literature over different TAP instances.","PeriodicalId":165367,"journal":{"name":"2010 3rd International Symposium on Applied Sciences in Biomedical and Communication Technologies (ISABEL 2010)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Hybrid Honey Bees Mating Optimisation algorithm to assign terminals to concentrators\",\"authors\":\"E. Bernardino, A. Bernardino, J. M. Sánchez-Pérez, J. Gómez-Pulido, M. A. Vega-Rodríguez\",\"doi\":\"10.1109/ISABEL.2010.5702845\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a new approach to assign terminals to concentrators using a Hybrid Honey Bees Mating Optimisation algorithm. Honey Bees Mating Optimisation (HBMO) algorithm is a swarm-based optimisation algorithm, which simulates the mating process of real honey bees. We apply a hybridisation of HBMO to solve a combinatorial optimisation problem known as Terminal Assignment Problem (TAP). The purpose is to connect a given set of terminals to a given set of concentrators and minimise the link cost to form a communication network. The feasibility of Hybrid HBMO is demonstrated and compared with the solutions obtained by other algorithms from literature over different TAP instances.\",\"PeriodicalId\":165367,\"journal\":{\"name\":\"2010 3rd International Symposium on Applied Sciences in Biomedical and Communication Technologies (ISABEL 2010)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 3rd International Symposium on Applied Sciences in Biomedical and Communication Technologies (ISABEL 2010)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISABEL.2010.5702845\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 3rd International Symposium on Applied Sciences in Biomedical and Communication Technologies (ISABEL 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISABEL.2010.5702845","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在本文中,我们提出了一种新的方法来分配终端集中使用混合蜜蜂交配优化算法。蜜蜂交配优化算法(HBMO)是一种基于群体的优化算法,它模拟了真实蜜蜂的交配过程。我们应用HBMO的杂交来解决被称为终端分配问题(TAP)的组合优化问题。其目的是将一组给定的终端连接到一组给定的集中器,并使链路成本最小化,从而形成一个通信网络。在不同的TAP实例上,证明了混合HBMO的可行性,并与文献中其他算法的解进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Hybrid Honey Bees Mating Optimisation algorithm to assign terminals to concentrators
In this paper we propose a new approach to assign terminals to concentrators using a Hybrid Honey Bees Mating Optimisation algorithm. Honey Bees Mating Optimisation (HBMO) algorithm is a swarm-based optimisation algorithm, which simulates the mating process of real honey bees. We apply a hybridisation of HBMO to solve a combinatorial optimisation problem known as Terminal Assignment Problem (TAP). The purpose is to connect a given set of terminals to a given set of concentrators and minimise the link cost to form a communication network. The feasibility of Hybrid HBMO is demonstrated and compared with the solutions obtained by other algorithms from literature over different TAP instances.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Generalized quantum Turing machine and its use to find an algorithm solving NP-Complete problem Quantifying the performance of compressive sensing on scalp EEG signals Cognitive radio equipments supporting spectrum agility Bio-inspired cognitive phones based on human nervous system Power efficient wireless connectivity of a wearable data glove
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1