Optimal Placement Algorithms for Base and Central Stations in Mining Quarries

Tatyana Golubeva, Ivan Hristov Beloev

2025

Full text Open access: Gold Metadata (CSL-JSON)

DOI 10.3390/engproc2025104048

Data confidence 70 medium

How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

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.