Research on Modeling Method for Optimal Allocation of Wellhead Targets in Large Well Clusters

• Published in: Processes Vol. 12; no. 8; p. 1705
• Main Authors: Wang, Liupeng, Duan, Haonan, Liu, Zhikun, Peng, Yuanchao, Liu, Xuyang
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.08.2024
• Subjects: Algorithms; Ant colony optimization; Behavior; Clusters; Convergence; Efficiency; Feedback; Genetic algorithms; Heuristic; Heuristic methods; Mutation; Optimization techniques; Pheromones; Principles; Traveling salesman problem; Wellheads
• ISSN: 2227-9717; 2227-9717
• DOI: 10.3390/pr12081705

The paper proposes a genetic ant colony algorithm that integrates genetic and ant colony algorithms, enhancing the heuristic function of the latter, to address target point distribution issues in large well clusters. This algorithm utilizes genetic algorithms for initial pheromone distribution and employs the ant colony algorithm to achieve rapid convergence. Introducing genetic operators in each iteration addresses the ant colony system’s drawbacks, including scarcity of initial pheromones, susceptibility to local optima, and slow convergence speed. The model aims to minimize the sum of horizontal displacement and intersections in line connections from wellheads to target points as its dual-objective function. It validates the effectiveness of the genetic ACO algorithm in optimizing target point allocation at wellheads through a case study, highlighting its advantages over traditional methods in reducing displacement, ensuring result stability, and preventing collisions.