IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/6642620.html
   My bibliography  Save this article

Optimization Design of Oil-Immersed Iron Core Reactor Based on the Particle Swarm Algorithm and Thermal Network Model

Author

Listed:
  • Fating Yuan
  • Kai Lv
  • Bo Tang
  • Yue Wang
  • Wentao Yang
  • Shihong Qin
  • Can Ding

Abstract

In this paper, according to the design parameters of oil-immersed iron core reactor, the thermal network model of windings is established by the thermo-electric analogy method, and the temperature distribution of the windings can be obtained. Meanwhile, a fluid-thermal coupled finite element model is established, the temperature and fluid velocity distribution are extracted, and the simulation results show that the error coefficient of temperature is less than 3% compared with the thermal network model, so the correctness of thermal network model has been verified. Taking the metal conductor usage and loss of windings as the optimization objects, the optimization method based on the particle swarm algorithm and thermal network model is proposed, and the Pareto optimal solutions between the metal conductor usage and loss of windings are given. The optimization results show that the metal conductor usage is reduced by 23.05%, and the loss is reduced by 20.25% compared with the initial design parameters, and the maximum temperature of winding does not exceed the expected value. Thus, the objects of low metal conductor usage and loss of windings are conflicted and cannot be optimized simultaneously; the optimization method has an important guiding significance for the design of oil-immersed iron core.

Suggested Citation

  • Fating Yuan & Kai Lv & Bo Tang & Yue Wang & Wentao Yang & Shihong Qin & Can Ding, 2021. "Optimization Design of Oil-Immersed Iron Core Reactor Based on the Particle Swarm Algorithm and Thermal Network Model," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-14, February.
  • Handle: RePEc:hin:jnlmpe:6642620
    DOI: 10.1155/2021/6642620
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2021/6642620.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2021/6642620.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/6642620?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:hin:jnlmpe:6642620. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.