IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i3p2060-d1043422.html
   My bibliography  Save this article

Optimized Design of a Squeezed-Branch Pile Group Based on an Improved Particle Swarm Algorithm

Author

Listed:
  • Jiawei Chen

    (School of Civil and Hydraulic Engineering, Ningxia University, Yinchuan 750014, China)

  • Yingxin Hui

    (School of Civil and Hydraulic Engineering, Ningxia University, Yinchuan 750014, China
    Ningxia Engineering Technology Research Center for Maintenance, Yinchuan 750014, China)

Abstract

To reduce the differential settlement of pile group foundations, a squeezed-branch pile group optimization method based on an improved particle swarm algorithm is proposed in this paper. This method translates the problems of optimization design in the squeezed-branch pile group into the pile-bearing-plate distribution using the theory of variable-stiffness leveling. In the optimization process, the pile group is divided into groups according to the top axial force of the pile. The finite element analysis software is used to solve the pile group under the control of the particle swarm optimization algorithm, with the objective functions of bearing-plate number, vertical bearing capacity, settlement value and settlement difference as the constraint conditions. An engineering example is used to verify this method. The results show that the optimized design can reduce the settlement difference by 39%, while the number of the bearing plate is reduced by 56%, which makes the deformation and force of the pile group more uniform and is conducive to the normal use of the structure.

Suggested Citation

  • Jiawei Chen & Yingxin Hui, 2023. "Optimized Design of a Squeezed-Branch Pile Group Based on an Improved Particle Swarm Algorithm," Sustainability, MDPI, vol. 15(3), pages 1-13, January.
    • Handle: RePEc:gam:jsusta:v:15:y:2023:i:3:p:2060-:d:1043422
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/3/2060/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/15/3/2060/
    Download Restriction: no
    ---><---

    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:gam:jsusta:v:15:y:2023:i:3:p:2060-:d:1043422. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.