Numerical Comparison of the Performance of Genetic Algorithm and Particle Swarm Optimization in Excavations
Autor(en): |
Seyyed Mohammad Hashemi
Iraj Rahmani |
---|---|
Medium: | Fachartikel |
Sprache(n): | Englisch |
Veröffentlicht in: | Civil Engineering Journal, September 2018, n. 9, v. 4 |
Seite(n): | 2186 |
DOI: | 10.28991/cej-03091149 |
Abstrakt: |
Today, the back analysis methods are known as reliable and effective approaches for estimating the soil strength parameters in the site of project. The back analysis can be performed by genetic algorithm and particle swarm optimization in the form of an optimization process. In this paper, the back analysis is carried out using genetic algorithm and particle swarm optimization in order to determine the soil strength parameters in an excavation project in Tehran city. The process is automatically accomplished by linking between MATLAB and Abaqus software using Python programming language. To assess the results of numerical method, this method is initially compared with the results of numerical studies by Babu and Singh. After the verification of numerical results, the values of the three parameters of elastic modulus, cohesion and friction angle (parameters of the Mohr–Coulomb model) of the soil are determined and optimized for three soil layers of the project site using genetic algorithm and particle swarm optimization. The results optimized by genetic algorithm and particle swarm optimization show a decrease of 72.1% and 62.4% in displacement differences in the results of project monitoring and numerical analysis, respectively. This research shows the better performance of genetic algorithm than particle swarm optimization in minimization of error and faster success in achieving termination conditions. |
Copyright: | © 2018 Seyyed Mohammad Hashemi, Iraj Rahmani |
Lizenz: | Dieses Werk wurde unter der Creative-Commons-Lizenz Namensnennung 4.0 International (CC-BY 4.0) veröffentlicht und darf unter den Lizenzbedinungen vervielfältigt, verbreitet, öffentlich zugänglich gemacht, sowie abgewandelt und bearbeitet werden. Dabei muss der Urheber bzw. Rechteinhaber genannt und die Lizenzbedingungen eingehalten werden. |
0.77 MB
- Über diese
Datenseite - Reference-ID
10340924 - Veröffentlicht am:
14.08.2019 - Geändert am:
02.06.2021