采矿英语翻译

汉译英部分：3.4矿山开发网络设计3.4 Mine Development Network Design露天和地下采矿作业模型之间的主要区别之一是现实建模相关费用的复杂性。

这是一个在矿井下更加重要的问题。

了解可行的筹措和优化，然后在这样的空间下，其成本函数是一个高度复合体的问题。

这种方法和基本数学细节进一步的调查也出现在了巴西等，2001年，2002年，2004年，2005年。

One of the principal differences between the modelling of open pit and underground mining operations is the complexity of realistically modeling the costs associated with access to the ore. This is a much more significant problem in an underground mine. Understanding the space of feasible solu-tions and then optimising a cost function over such a space is a highly com-plex problem. The first serious analytic solution method is found in the work of Brazil et al. (2000). Further investigations of this approach and details of the underlying mathematics have also appeared in Brazil et al. 200l, 2002,2004, 2005.要使解决这个问题变得易于处理的关键是要树立网络优化的榜样问题，然后在合适的发展度量空间的三维空间下实施网络理论。

该网络可以被视为根据矿井的坐标被嵌入在欧氏三维空间的网络。

以这层模型给定的点和面绘制对应的网络节点，以被固定在网络中的嵌入对应的斜道中心线代表。

最后，其中3个或更多的坡道遇到的施泰纳点作为网络可变节点。

The key to finding a tractable solution technique for this problem has been to model it as a network optimisation problem, and then develop a theory of three-dimensional Steiner networks in a suitable metric space. The mine is represented using a weighted network model. The network can be treated as being embedded in Euclidean 3-space, and coordinated according to the coordinates of the mine. ln this model, the given draw points and surface portal correspond to fixed nodes of the network known as terminals.The ramps in the mine are represented by links in the network whose embeddings correspond to the centre lines of the ramps. Finally, the junc-tions at which three or more ramps meet are represented by variable nodes in the network, known as Steiner points.这个网络模型的主要假设是，所有绘制在采场点的位置已经给出，为每个点提供借鉴吨位。

以每个网络的工作费用作为蓝本，建筑和运输成本的组合。

这个成本变量组件可以被假定为成比例的欧几里德的长度。

但是，这个比例，将使不同的每一个环节，取决于矿石吨位对应地区的一部分。

The main assumptions in this network model are that the locations of all draw points at the stopes are given, together with the expected tonnage for each given draw point. The surface portal is also assumed to be fixed (or at least strongly constrained in its location). The cost of each link in the net-work is modelled as a combination of construction and haulage costs. The variable component of this cost can be assumed to be proportional to the Euclidean length of the link. This proportion, however, will be different for each link, depending on the tonnage of ore to be hauled along the cor-responding part of the mine.主要的限制条件是，坡道组件中有一个最大允许斜坡。

这里的坡度是一个绝对的梯度测量（即是在对高度变化的水平位移变化率绝对值）。

地下开采问题，根据采矿设备的规格一般的范围为l/9 到l/7。

矿山设备（定义一个最小转弯圈）和避障也很重要，但往往被视为第二制约因素，特别是在大规模的矿山设计中。

节能在3.5节讲得更详细。

对于优化的问题，现在可以表述如下：The principal constraint is that ramp components are constrained to a maximum allowable slope. This slope is measured as an absolute gradient in (i.e. in is the absolute value of the ratio of change in horizontal displacement over change in height). ln underground mining problems in is generally in the range l/9 to l/7 depending on mining equipment specifications. Other constraints such as navigability of the drives by mine equipment (defining a minimum turning circle) and obstacle avoidance (to prevent sterilisation of the ore, for example), are also important but can often be treated as second-dary constraints, particularly in large-scale designs. The navigability con-straint is discussed in more detail in Section 3.5. The optimisation problem can now be formulated as follows:1.给定：一个点集欧氏3 n维空间，以及梯度约束m>0。

2.查找：互联网络T欧氏3嵌入式空间，使得（a）内置的链接是分段光滑的曲线在每个微点，其绝对梯度米最多，（b）总建筑加上运输成本最小化l. GIVEN: A set of points N in Euclidean 3-space, and a gradient bound m > 0.2. FIND: A network T interconnecting N embedded in Euclidean 3- space,such that(a) The embedded links are piecewise smooth curves whose absolute gradient at each differentiable point is at most m,(b) The total construction plus haulage costs are minimized这实际上是一个著名的网络问题施泰纳的变化，建设成本最低的网络互联组给定的一个度量空间的点（黄禹锡等人的研究问题，1992）。

这里的控制变量是：拓扑结构（即基本图结构）的网络；变量节点的位置，对应于矿井的路口；以及在欧几里得3的每一个链接嵌入空间。

This is effectively a variation of the well-known Steiner network problem-the problem of constructing a minimum cost network interconnecting a given set of points in a metric space (Hwang et al.; 1992). The control variables here are: the topology (i.e. underlying graph structure) of the network; the locations of the variable nodes (Steiner points); corresponding to the junctions in the mine; and the embedding of each of the links in Euclidean 3-space.一种优化解决这些问题的关键是找到好的近似算法，来了解和利用其精确解的几何性质。