Scholarlink

<p>Deepwater drilling riser operability envelopes are of significant importance for guiding on-site decision-making in deepwater drilling operations. To meet the real-time computational requirements for operability envelopes, an Artificial Vine Algorithm that mimics the winding behavior of vines for searching boundary values within these envelopes was proposed. The algorithmic search strategy and theoretical model were established, and the algorithm was analyzed and compared using the drilling riser hard hang-off operability envelope as an example. The results indicate that while the root positions and exploratory growth directions of the Artificial Vine Algorithm have a certain impact on search efficiency and cost, they have little effect on search accuracy. Through a heuristic boundary search mechanism, the algorithm’s computational nodes concentrate near the boundaries, resulting in high search efficiency; with a tolerance of 2%, an average of only 2–3 simulation calculations are required to determine one boundary node. Under the same solution accuracy, the algorithm’s CPU time is only 0.8–1.1% of that of the traversal search method and less than one-fourth of that of the bisection method, saving at least 167.49&#xa0;h and 4.32&#xa0;h, respectively, demonstrating the algorithm’s significant advantage in search efficiency compared to traditional methods.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Artificial vine algorithm for calculating deepwater drilling riser operability envelopes

  • 期刊论文

  • 发表日期：

    2026年6月29日

查看全文
  • Rongyao Wang,
  • Jing Zhu,
  • Yi Tu,
  • Xiaogao Yang,
  • Songlin Deng

摘要

Deepwater drilling riser operability envelopes are of significant importance for guiding on-site decision-making in deepwater drilling operations. To meet the real-time computational requirements for operability envelopes, an Artificial Vine Algorithm that mimics the winding behavior of vines for searching boundary values within these envelopes was proposed. The algorithmic search strategy and theoretical model were established, and the algorithm was analyzed and compared using the drilling riser hard hang-off operability envelope as an example. The results indicate that while the root positions and exploratory growth directions of the Artificial Vine Algorithm have a certain impact on search efficiency and cost, they have little effect on search accuracy. Through a heuristic boundary search mechanism, the algorithm’s computational nodes concentrate near the boundaries, resulting in high search efficiency; with a tolerance of 2%, an average of only 2–3 simulation calculations are required to determine one boundary node. Under the same solution accuracy, the algorithm’s CPU time is only 0.8–1.1% of that of the traversal search method and less than one-fourth of that of the bisection method, saving at least 167.49 h and 4.32 h, respectively, demonstrating the algorithm’s significant advantage in search efficiency compared to traditional methods.