本文已被:浏览 1730次 下载 3112次
Received:July 07, 2011 Revised:July 29, 2011
Received:July 07, 2011 Revised:July 29, 2011
中文摘要: 为解决油管输送式射孔排炮问题中射孔枪总长最短的优化需求,建立了优化问题的数学模型,将问题的搜索空间抽象为图来表示,将蚁群算法应用于该问题的求解。算法局部搜索采用贪婪的策略,以及伪随机比例的状态转移规则,为避免算法早熟收敛,对信息素增量的计算公式进行了改进。实验结果与回溯法对比表明,蚁群算法解决此问题更有效。
Abstract: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.
文章编号: 中图分类号: 文献标志码:
基金项目:黑龙江省自然科学基金(F2007-11)
引用文本:
吴雅娟,周红,李博.油管输送式射孔排炮优化问题的改进蚁群算法.计算机系统应用,2012,21(3):224-227
WU Ya-Juan,ZHOU Hong,LI Bo.Improved Ant Colony Algorithm for Cannon Arrangement for Tubing Conveyed Perforation Problem.COMPUTER SYSTEMS APPLICATIONS,2012,21(3):224-227
吴雅娟,周红,李博.油管输送式射孔排炮优化问题的改进蚁群算法.计算机系统应用,2012,21(3):224-227
WU Ya-Juan,ZHOU Hong,LI Bo.Improved Ant Colony Algorithm for Cannon Arrangement for Tubing Conveyed Perforation Problem.COMPUTER SYSTEMS APPLICATIONS,2012,21(3):224-227