Numerical Optimisation of Excavation Pit Design Using Finite Element Analyses

The present study focusses on optimising a single supported excavation pit to achieve a more economical design using finite element analyses. Two methods for automating the derivation of the excavation pit’s necessary embedment depth are presented, which involve either embedment depth reduction usin...

Full description

Saved in:
Bibliographic Details
Published in:Geotechnical and geological engineering Vol. 42; no. 3; pp. 1659 - 1673
Main Authors: Jürgens, Hauke, Henke, Sascha
Format: Journal Article
Language:English
Published: Cham Springer International Publishing 01.05.2024
Springer Nature B.V
Subjects:
ISSN:0960-3182, 1573-1529
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The present study focusses on optimising a single supported excavation pit to achieve a more economical design using finite element analyses. Two methods for automating the derivation of the excavation pit’s necessary embedment depth are presented, which involve either embedment depth reduction using additional calculation phases or adapting the entire model with renewed discretisation. The bending moments as well as the earth pressure distribution along the wall show good agreement, indicating that both methods are suitable for application. Subsequently, the feasibility of using optimisation algorithms (Particle Swarm Optimisation and Differential Evolution) for dimensioning the single supported excavation pit regarding stress analysis of the wall is investigated. Therefore, the embedment depth and the position of the strut are varied for five different sheet pile walls and three different strut profiles. The results demonstrate that both algorithms perform well, particularly with a higher number of calculation steps. After varying iteration steps and population size, the Differential Evolution approach shows better performance compared to Particle Swarm Optimisation by means of finding the optimal solution after a lower number of computational steps.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0960-3182
1573-1529
DOI:10.1007/s10706-023-02639-7