Application of ant colony optimization metaheuristic on set covering problems

IF 0.4 Q4 MATHEMATICS, APPLIED Mathematics in applied sciences and engineering Pub Date : 2022-01-20 DOI:10.5206/mase/14018
C. A. Buhat, Jerson Ken Villamin, G. Cuaresma
{"title":"Application of ant colony optimization metaheuristic on set covering problems","authors":"C. A. Buhat, Jerson Ken Villamin, G. Cuaresma","doi":"10.5206/mase/14018","DOIUrl":null,"url":null,"abstract":"Ant Colony Optimization (ACO) metaheuristic is a multi-agent system in which the behaviour of each ant is inspired by the foraging behaviour of real ants to solve optimization problem. Set Covering Problems (SCP), on the other hand, deal with maximizing the coverage of every subset while the weight nodes used must be minimized. In this paper, ACO was adapted and used to solve a case of Set Covering Problem. The adapted ACO for solving the SCP was implemented as a computer program using SciLab 5.4.1. The problem of determining the optimal location of Wi-Fi Access Points using the 802.11n protocol in the UP Los Banos Math Building was solved using this metaheuristic. Results show that in order to have 100% coverage of the MB, 7 access points are required. Methodology of the study can be adapted and results of the study can be used by decision makers on related optimization problems.","PeriodicalId":93797,"journal":{"name":"Mathematics in applied sciences and engineering","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2022-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics in applied sciences and engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5206/mase/14018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

Ant Colony Optimization (ACO) metaheuristic is a multi-agent system in which the behaviour of each ant is inspired by the foraging behaviour of real ants to solve optimization problem. Set Covering Problems (SCP), on the other hand, deal with maximizing the coverage of every subset while the weight nodes used must be minimized. In this paper, ACO was adapted and used to solve a case of Set Covering Problem. The adapted ACO for solving the SCP was implemented as a computer program using SciLab 5.4.1. The problem of determining the optimal location of Wi-Fi Access Points using the 802.11n protocol in the UP Los Banos Math Building was solved using this metaheuristic. Results show that in order to have 100% coverage of the MB, 7 access points are required. Methodology of the study can be adapted and results of the study can be used by decision makers on related optimization problems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
蚁群优化元启发式算法在集覆盖问题中的应用
蚁群优化(ACO)元启发式是一个多智能体系统,其中每个蚂蚁的行为都受到真实蚂蚁觅食行为的启发,以解决优化问题。另一方面,集覆盖问题(SCP)处理的是最大化每个子集的覆盖,而使用的权重节点必须最小化。本文将ACO方法应用于一个集覆盖问题的求解。使用SciLab 5.4.1将用于解决SCP的自适应ACO实现为计算机程序。使用这种元启发式方法解决了在UP Los Banos数学大楼中使用802.11n协议确定Wi-Fi接入点的最佳位置的问题。结果显示,为了实现MB的100%覆盖,需要7个接入点。研究方法可以进行调整,决策者可以将研究结果用于相关的优化问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.40
自引率
0.00%
发文量
0
审稿时长
21 weeks
期刊最新文献
Optimal actuator design for control of vibrations induced by pedestrian-bridge interactions Unraveling the role of inert biomass in membrane aerated biofilm reactors for simultaneous nitrification and denitrification Time-delayed models for the effects of toxicants on populations in contaminated aquatic ecosystems Lyapunov-Schmidt reduction in the study of bifurcation of periodic travelling wave solutions of a perturbed (1 + 1)−dimensional dispersive long wave equation Relative operator entropy properties related to some weighted metrics
×
引用
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