IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v201y2025ip2s0960077925013165.html
   My bibliography  Save this article

Multi-objective plant root growth optimization algorithm for engineering design problems and UAV path planning

Author

Listed:
  • Yang, Jianqiang
  • Yan, Fu
  • Zhang, Jin
  • Peng, Changgen
  • Zhang, Renlong

Abstract

In this study, a new multi-objective version of Plant Root Growth Optimization Algorithm (PRGO ) called Multi-Objective Plant Root Growth Optimization Algorithm ( MOPRGO ) is proposed. MOPRGO is a combination of the traditional PRGO and elite non-dominated sorting technique to define Pareto optimal solutions by means of taproot rhizome growth and fibrous rhizome growth. Pareto archives with selection mechanisms are used to preserve and enhance the convergence and diversity of solutions. In order to validate the performance and effectiveness of MOPRGO, it is validated in 50 real engineering design problems, including 21 mechanical design problems, 3 chemical engineering problems, 5 process, design and synthesis problems, 6 power electronics problems and 15 power system optimization problems, and the statistical results are compared with those of other recognized algorithms using the same performance metrics. The comparison results show that MOPRGO is robust and superior in dealing with various multi-objective problems. To further validate the performance of the proposed algorithm, a multi-objective UAV path planning problem is also designed, and the effectiveness of MOPRGO is demonstrated by designing two complex terrain sets and comparing them with various classical and state-of-the-art multi-objective evolutionary algorithms.

Suggested Citation

  • Yang, Jianqiang & Yan, Fu & Zhang, Jin & Peng, Changgen & Zhang, Renlong, 2025. "Multi-objective plant root growth optimization algorithm for engineering design problems and UAV path planning," Chaos, Solitons & Fractals, Elsevier, vol. 201(P2).
    • Handle: RePEc:eee:chsofr:v:201:y:2025:i:p2:s0960077925013165
    DOI: 10.1016/j.chaos.2025.117303
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077925013165
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2025.117303?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:eee:chsofr:v:201:y:2025:i:p2:s0960077925013165. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.