论文部分内容阅读
本文对钻井布局问题的研究 ,是从全局搜索入手 ,逐步深入讨论了各种算法的有效性、适用性和复杂性 ,得到不同条件下求最多可利用旧井数的较好算法 .对问题 1 ,我们给出了全局搜索模型、局部精化模型与图论模型 ,讨论了各种算法的可行性和复杂度 .得到的答案为 :最多可使用 4口旧井 ,井号为 2 ,4 ,5,1 0 .对问题 2 ,我们给出了全局搜索、局部精化和旋转矢量等模型 ,并对局部精化模型给出了理论证明 ,答案为 :最多可使用 6口旧井 ,井号为 1 ,6,7,8,9,1 1 ,此时的网格逆时针旋转 4 4.37度 ,网格原点坐标为 (0 .4 7,0 .62 ) .对问题 3,给出判断 n口井是否均可利用的几个充分条件、必要条件和充要条件及其有效算法
In this paper, the study of the drilling layout problem starts from the global search and gradually discusses the validity, applicability and complexity of various algorithms, and obtains a better algorithm for finding the most available old wells under different conditions. , We give a global search model, a partial refinement model and a graph theory model, and discuss the feasibility and complexity of various algorithms. The answers we get are as follows: up to 4 old wells with pound signs of 2, 4, 5,1 0. For problem 2, we give global search, local refinement and rotation vector models, and give a theoretical proof of the local refinement model, the answer is: up to 6 old wells, pound sign 1, 6, 7, 8, 9, 1 1, the grid at this time rotates 4 4.37 degrees counterclockwise and the grid origin coordinate is (0 .4 7,0 .62). For question 3, Several Sufficient Conditions, Necessary, Sufficient and Sufficient Conditions and Their Effective Algorithms