IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v53y2022i1p154-167.html
   My bibliography  Save this article

A multi-objective optimisation algorithm for a drilling trajectory constrained to wellbore stability

Author

Listed:
  • Wendi Huang
  • Min Wu
  • Jie Hu
  • Luefeng Chen
  • Chengda Lu
  • Xin Chen
  • Weihua Cao

Abstract

The design of a trajectory is significant to the efficiency and safety of a drilling process. In this paper, wellbore stability, indicated by the safe mud weight, is introduced as constraints to formulate a drilling trajectory optimisation problem. The upper and lower bounds of the safe mud weight are analysed according to the real data of a well. To solve the optimisation problem with strict constraints, we devise a new multi-objective optimisation algorithm. The devised algorithm takes advantage of inverted generational distance and knee points, and improves the convergence and diversity of the obtained solutions by modifying the selection process. Simulation results show that the devised algorithm is effective on the drilling trajectory optimisation problem constrained to wellbore stability.

Suggested Citation

  • Wendi Huang & Min Wu & Jie Hu & Luefeng Chen & Chengda Lu & Xin Chen & Weihua Cao, 2022. "A multi-objective optimisation algorithm for a drilling trajectory constrained to wellbore stability," International Journal of Systems Science, Taylor & Francis Journals, vol. 53(1), pages 154-167, January.
  • Handle: RePEc:taf:tsysxx:v:53:y:2022:i:1:p:154-167
    DOI: 10.1080/00207721.2021.1941396
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2021.1941396
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2021.1941396?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:53:y:2022:i:1:p:154-167. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.