Route optimization algorithm of open-pit mine based on Clifford algebra

Routing optimization at open pit is a combinatorial optimization problem in searching for the best transporta-tion routes under certain physical and economic constraints. It has important practical significance for reducing mine operation cost. However,some conventional routing optimization algorithms for open pit mainly start from the static road directed graph network optimization,which cannot realize the efficient analysis and optimization decision of large-scale time-varying dynamic network. In this paper,the classical directed graph network analysis method in Euclidean space is extended to Clifford algebraic space by taking Zhahannaoer open-pit as an example. The uniform expression of the node,the directed edge and the route is established. The method for calculating the route geometric topology connectiv-ity and scalar constraint indexes is proposed to separate the geometric topology calculation and the numerical optimiza-tion problem from the programming model. In order to overcome the problem that the traditional static network analysis method cannot dynamically express the change of system energy consumption,a route optimization model based on time-varying transportation work minimization is established,and the calculation method of time-varying resistance is given according to the characteristics of rolling resistance. Periodic time-varying effect of rolling resistance coefficient caused by the frequent rolling failure and periodic maintenance of haul road is studied,and a method for calculating the rolling resistance coefficient of time-varying rolling is proposed. In order to further improve the convergence effi-ciency of the algorithm,two sets of inference and one set of numerical calculation optimization strategies are proposed to improve the numerical calculation of genetic algorithm. It has been verified by many simulation experiments that the algorithm can converge to the global optimal solution quickly,which proves that the algorithm is feasible and effective to solve the practical path optimization problem of mine. Secondly,the introduction of geometric-algebraic method also provides a new method to effectively realize the decoupling of topological relation calculation and numerical calculation for traditional path optimization problems,which makes up for the deficiency of time-varying dynamic network analysis that static network cannot realize and provides a new idea to improve the efficiency of large-scale road network model of open-pit transportation system.