Application of ant colony optimization metaheuristic on set covering problems
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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Western Libraries
2022-01-01
|
| Series: | Mathematics in Applied Sciences and Engineering |
| Subjects: | |
| Online Access: | https://ojs.lib.uwo.ca/index.php/mase/article/view/14018 |
| _version_ | 1818268793201229824 |
|---|---|
| author | Christian Alvin Buhat Jerson Ken Villamin Genaro Cuaresma |
| author_facet | Christian Alvin Buhat Jerson Ken Villamin Genaro Cuaresma |
| author_sort | Christian Alvin Buhat |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-12T20:44:08Z |
| format | Article |
| id | doaj.art-c55147de8a1f4825b452319b3f5a8b21 |
| institution | Directory Open Access Journal |
| issn | 2563-1926 |
| language | English |
| last_indexed | 2024-12-12T20:44:08Z |
| publishDate | 2022-01-01 |
| publisher | Western Libraries |
| record_format | Article |
| series | Mathematics in Applied Sciences and Engineering |
| spelling | doaj.art-c55147de8a1f4825b452319b3f5a8b212022-12-22T00:12:38ZengWestern LibrariesMathematics in Applied Sciences and Engineering2563-19262022-01-0131122310.5206/mase/140188221Application of ant colony optimization metaheuristic on set covering problemsChristian Alvin BuhatJerson Ken VillaminGenaro CuaresmaAnt 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.https://ojs.lib.uwo.ca/index.php/mase/article/view/14018heuristics,internet router ,optimization, set covering problem,wi-fi. |
| spellingShingle | Christian Alvin Buhat Jerson Ken Villamin Genaro Cuaresma Application of ant colony optimization metaheuristic on set covering problems Mathematics in Applied Sciences and Engineering heuristics, internet router , optimization, set covering problem, wi-fi. |
| title | Application of ant colony optimization metaheuristic on set covering problems |
| title_full | Application of ant colony optimization metaheuristic on set covering problems |
| title_fullStr | Application of ant colony optimization metaheuristic on set covering problems |
| title_full_unstemmed | Application of ant colony optimization metaheuristic on set covering problems |
| title_short | Application of ant colony optimization metaheuristic on set covering problems |
| title_sort | application of ant colony optimization metaheuristic on set covering problems |
| topic | heuristics, internet router , optimization, set covering problem, wi-fi. |
| url | https://ojs.lib.uwo.ca/index.php/mase/article/view/14018 |
| work_keys_str_mv | AT christianalvinbuhat applicationofantcolonyoptimizationmetaheuristiconsetcoveringproblems AT jersonkenvillamin applicationofantcolonyoptimizationmetaheuristiconsetcoveringproblems AT genarocuaresma applicationofantcolonyoptimizationmetaheuristiconsetcoveringproblems |