Optimal Placement Algorithms for Base and Central Stations in Mining Quarries

This paper proposes algorithms for optimal placement of base stations (BSs) and central stations (CSs) in mining quarries to ensure reliable radio communication for automated machinery. The BS placement is modeled as a minimum dominating set problem, solved using integer linear programming with cutting-plane methods. The CS placement is formulated as a nonlinear programming problem, addressed via a minimum circle covering algorithm. Applied in a 200 km2 quarry, the approach achieves full coverage with nine BSs and one CS, minimizing costs and ensuring robust performance. Comparative analyses show superior optimality, scalability, and adaptability, offering a scalable framework for industrial communication infrastructure.