IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0317737.html
   My bibliography  Save this article

Scheduling optimization based on particle swarm optimization algorithm in emergency management of long-distance natural gas pipelines

Author

Listed:
  • Huichao Guo
  • Runhua Huang
  • Shuqin Cheng

Abstract

This paper aims to solve the scheduling optimization problem in the emergency management of long-distance natural gas pipelines, with the goal of minimizing the total scheduling time. To this end, the objective function of the minimum total scheduling time is established, and the relevant constraints are set. A scheduling optimization model based on the particle swarm optimization (PSO) algorithm is proposed. In view of the high-dimensional complexity and local optimal problems, the neighborhood adaptive constrained fractional particle swarm optimization (NACFPSO) algorithm is used to solve it. The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. In addition, with the increase of pipeline complexity, NACFPSO can still maintain its advantages in convergence speed and scheduling time, especially in scheduling time, which further verifies the optimization effect of the algorithm in emergency management.

Suggested Citation

  • Huichao Guo & Runhua Huang & Shuqin Cheng, 2025. "Scheduling optimization based on particle swarm optimization algorithm in emergency management of long-distance natural gas pipelines," PLOS ONE, Public Library of Science, vol. 20(2), pages 1-17, February.
    • Handle: RePEc:plo:pone00:0317737
    DOI: 10.1371/journal.pone.0317737
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0317737
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0317737&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0317737?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
    ---><---

    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:plo:pone00:0317737. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.