This paper analyzes the equipment configuration of the smart mine, builds the corresponding Quadratic Unconstrained Binary Optimization (QUBO) model according to different application scenarios, and analyzes and solves the QUBO model by using the simulated annealing solver and the CIM simulator, to explore the optimal operation scheme of the smart mine under different scenarios. Firstly, under the budget constraint, the objective function is to maximize the sum of the discounted long-term profits of various excavators, and at the same time to meet the constraints such as budget limitation and type limitation, the mathematical model is established and transformed into the QUBO model, and then analytically solved to derive the optimal operation plan of the smart mine under this scenario. Subsequently, the mathematical model is reconstructed to derive the optimal operation scenario and expected profit, taking into account the factor of years of life. In terms of the solution method, kaiwu sdk shows good performance for small-scale problems, but it is limited by memory and less effective when facing large-scale problems. Therefore, this paper proposes the subQUBO method, which combines quantum and classical computing, as a potential improvement path. This study not only provides an optimization solution for the operation of smart mines, but also provides new ideas for solving similar large-scale optimization problems.

Shiqi Zhou, Yita Han, Xvdong Wang. Optimization Research of Smart Mine Operation Scheme Based on QUBO Model and Quantum Annealing Algorithm. Academic Journal of Computing & Information Science (2024), Vol. 7, Issue 5: 168-173. https://doi.org/10.25236/AJCIS.2024.070522.

[1] Simon D R. On the power of quantum computation[J]. SIAM journal on computing, 1997, 26(5): 1474-1483.

[2] Harrow A W, Hassidim A, Lloyd S. Quantum algorithm for linear systems of equations[J]. Physical review letters, 2009, 103(15): 150502.

[3] Yarkoni S, Raponi E, Bäck T, et al. Quantum annealing for industry applications: Introduction and review[J]. Reports on Progress in Physics, 2022, 85(10): 104001.

[4] Sack S H, Serbyn M. Quantum annealing initialization of the quantum approximate optimization algorithm[J]. quantum, 2021, 5: 491.

[5] Lin F T, Kao C Y, Hsu C C. Applying the genetic approach to simulated annealing in solving some NP-hard problems[J]. IEEE Transactions on systems, man, and cybernetics, 1993, 23(6): 1752-1767.

[6] Geng X, Chen Z, Yang W, et al. Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search[J]. Applied Soft Computing, 2011, 11(4): 3680-3689.