E. Bernardino, A. Bernardino, J. M. Sánchez-Pérez, J. Gómez-Pulido, M. A. Vega-Rodríguez
{"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}
引用次数: 3
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.