IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v246y2026icp440-448.html

Topology optimization of heat conduction based on U-ResNet neural network

Author

Listed:
  • Cheng, Zhen
  • Li, Yahui
  • Yang, Ping
  • Yang, Haiying

Abstract

In order to break through the thermal dissipation bottleneck limitation of microelectronic integration technology. Topological optimization based on high thermal conductivity materials and structures to achieve efficient heat dissipation has become one of the key strategies to solve this problem. The conventional topology optimization methods rely heavily on extensive finite element iterations, leading to high computational costs and significant time consumption, which restrict their application in rapid design scenarios. To substantially improve computational efficiency while maintaining optimization accuracy, this study innovatively integrates the U-Net and ResNet architectures to construct a U-ResNet model, which replaces the core iterative process of the traditional SIMP method, enabling rapid optimization. Experiments conducted on two typical types of two-dimensional heat transfer topology optimization problems demonstrate that the proposed model reduces the computation time by an average of over 91 % while achieving accuracy comparable to the SIMP method. The results indicate that U-ResNet offers a new, efficient, and reliable approach to heat transfer topology optimization, providing a viable pathway toward the intelligent development of thermal design in microelectronics.

Suggested Citation

  • Cheng, Zhen & Li, Yahui & Yang, Ping & Yang, Haiying, 2026. "Topology optimization of heat conduction based on U-ResNet neural network," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 246(C), pages 440-448.
  • Handle: RePEc:eee:matcom:v:246:y:2026:i:c:p:440-448
    DOI: 10.1016/j.matcom.2026.02.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475426000558
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2026.02.009?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:matcom:v:246:y:2026:i:c:p:440-448. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.