论文部分内容阅读
本文是讨论钻井布局最优化问题,针对原题所给定的假定,我们首先针对问题1)给出了一个比较直观的算法,然后集中精力对其作了较大的优化。最后,在问题1)的基础上,我们较容易的解决了问题2)。前后一共给出了三个主要的数值算法(即算法1,算法5和算法7),通过选取适当的步长搜寻最优解,并用C语言实现,对所给的数值例子,通过计算机计算,对两个问题分别得到了两个最优钻井布局,使问题1)中可利用的旧井数达到最大为4;使问题2)中可利用的旧井数达到最大为6。文后我们还对本模型的优缺点和推广作了讨论。
In this paper, we discuss the layout optimization of drilling. For the assumptions given in the original question, we first give an intuitive algorithm for problem 1) and then concentrate on optimizing it. Finally, on the basis of Question 1), we can more easily solve the problem 2). Before and after giving a total of three major numerical algorithms (Algorithm 1, Algorithm 5 and Algorithm 7), by selecting the appropriate step search for the optimal solution, and C language to achieve, the numerical examples given by the computer, Two optimal well layouts are obtained for each of the two problems, maximizing the number of available wells in question 1) to 4 and maximizing the number of available wells in question 2). After that, we also discussed the advantages and disadvantages of this model and its promotion.