This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2025-212447
If you've NEVER registered a DOI in your Lattes, check our tutorial!This study proposes an algorithm based on the Iterated Local Search metaheuristic specialized for the location-allocation problem of repeaters and routers in open-pit mines. The objective is to minimize the number of installed network equipment and the distances between this equipment and the operating points. The algorithm was validated in 12 instances, varying the number of operating points and candidate locations for the installation of network equipment. The results were compared to those of a mathematical solver with an MILP formulation of the problem, demonstrating the algorithm's effectiveness in finding good solutions with reduced computational time. For all the instances in which the solver found the optimal solution, the proposed algorithm also converged to this solution. Unlike the solver, the proposed algorithm succeeded in finding good solutions even for the largest instances analyzed, ensuring efficient coverage of the operational area.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper