钻井布局问题的搜索算法  

Solving the Distribution Problem of Mine Via Search Algorithm

作　　者：蒲飞[1] 龚玉龙[1] 吴齐峰 宋燕霞 

机构地区：[1]怀化师专数学系,湖南怀化418008

出　　处：《怀化师专学报》2000年第2期24-29,共6页Journal of Huaihua Teachers College

摘　　要：研究了钻井布局问题 ,采用将网格移动而井不动转化为井动而网不动的思想 ,对平移情形提出了两种搜索算法 ,一种是全程搜索 ,另一种是逐井优化搜索 ,并对后一种算法的有效性在理论上给出两个定理作保证 对旋转情形也采用全程搜索算法 ,并对所提算法进行了数值实验 通过比较 ,对平移情形 ,逐井优化搜索算法比全程搜索算法效率高得多 ,大大节省了搜索时间 ,且所得结果与全程搜索完全一致 最后 ,分别对所提算法的数值结果可视化 所给例子 ,求得只可平移时有 4个旧井可利用 ,对可旋转又可平移的情况 ,求得有This paper considers the distribution problem of mine In the first case,that parallel vertical movement of mesh is only permitted,two search algorithms are given One is called global search algorithm,the other is called optimal search algorithm for each mine,which efficiency is proved by two theorems In the second case,the rotation of mesh is also permitted,the global search algorithm is given All algorithms are experienced by numeral experiment Through a giving example,it shows that four mines can be used in the first case,and six mines can be used in the second case

关 键 词：平移 旋转 全程搜索 逐井优化搜索 参照井 钻井布局 搜索算法 系统勘探 网格 

分 类 号：P628.3[天文地球—地质矿产勘探] O242[天文地球—地质学]