Improved Ant Colony Algorithm for Cannon Arrangement for Tubing Conveyed Perforation Problem
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

吴雅娟,周红,李博.油管输送式射孔排炮优化问题的改进蚁群算法.计算机系统应用,2012,21(3):224-227

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 07,2011
  • Revised:July 29,2011
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063