Hyperheuristics applied to the Problem of Automatic Positioning of Wireless Network Access Points in Indoor Environments

The design of wireless networks has become crucial with the popularization of mobile devices, standing out for its scalability and ease of use, as well as installation costs. Modeled as the Access Point Positioning Problem, it is an NP-Hard problem, with no algorithm that solves it in polynomial time. This work proposes approaches based on hyper-heuristics, where each solution is accompanied by a new heuristic reusable for new instances. Random instances of wireless networks with relevant dimensions are used. Comparisons are made with ILS and BRKGA meta-heuristic approaches. Computational experiments show excellent results for larger dimensions, demonstrating that this approach is more scalable and produces reasonable solutions to the problem><.