The Research Of Optimization Algorithm For Perforating Cannon Arrangement

perforation is a very important part in the oil and gas field exploration and development,the results of the perforation design guide perforation production.The target of perforatingcannon arrangement optimization is that, the join length is minimum for the pipelinetransportation perforation,total length of perforating gun is minimum for the cabletransportation perforation, in order to achieve the purpose of saving cost of oilfield productionand increase the production of oil and gas fields.Therefore,the optimization algorithm onperforating cannon arrangement issues is important to study.This paper focuses on the application of optimization algorithms to solve the problem ofperforating cannon arrangement, according to the characteristics of the problem,the basicsearch algorithm branch and bound algorithm and heuristic intelligent optimization algorithmson ant colony algorithm is applied to solve the problem. Optimized pruning strategy is used toimprove the efficiency of branch and bound search algorithm.In order to solve the problemthat the ant colony algorithm is prone to premature convergence, the algorithm is improved.At the same time, perforating system with perforating cannon arrangement is designed.The perforating cannon arrangement design optimization problem is analysed and theoptimization model of the problem is established. Analyzed two different perforation,amathematical model of the problem is built according to their respective optimizationneeds.Branch and bound method is applied to solve the the perforating cannon arrangementoptimization problem. Gun-type is used to build the search tree of the problem to determinethe branch and node attributes. Analyzed and determined the delimitation rules and pruningrules, described the process of the algorithm. Experiments show that the algorithm can solvethe problem effectively, for wells of oil layer thickness, the algorithm has a higher efficiency.Improved ant colony algorithm is applied to solve the perforating cannon arrangementoptimization problem. Local pheromone update rule has been improved, introduced the ratioof the current function value and the average function value to control the increment of thepheromone on the optimal path, to avoid the premature convergence problem caused byexcessive pheromones growth in better path. The experiments show that the application ofimproved ant colony algorithm is effective to the the perforating cannon arrangementoptimization problem.Based on the above research, achieved the perforating cannon arrangement designoptimization algorithm. The experiments show that the simple reservoir data using the branch and bound method more efficient and complex reservoir data more efficient use of ant colonyalgorithm. In this paper, the method to set the threshold to control the choice ofalgorithm.Finally,achieved perforating design system.