An Iterated Local Search-based Algorithm for the Problem of Repeater and Router Allocation and Location in Open-Pit Mines

- 325707
Complete Articles (CA)
Favorite this paper
How to cite this paper?
Abstract

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.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Institutions
  • 1 Universidade Federal de Ouro Preto
  • 2 Vale Technological Institute
  • 3 Toronto Arts Foundation
Track
  • 21. POI-PO na Indústria
Keywords
Iterated Local Search
Allocation and location problem
Routers and Repeaters
Open-pit mines
PO in Mining industry