Improved Ant Colony Algorithm for Cannon Arrangement for Tubing Conveyed Perforation Problem
油管输送式射孔排炮优化问题的改进蚁群算法

To solve the optimization requirement of shorting total joint length among perforators in cannon arrangement for tubing conveyed perforation problem, the mathematical model of optimization problem was build, search space was abstract to graphic explanation, then ant colony algorithm was applied to this problem. In this paper, greedy algorithm was applied in local searching, the pseudo-random proportional rule was adopted, computational formula of Pheromones Increment was improved. The results show that the solution which ant colony algorithm produces is better than the one which backtracking algorithm produce.