An Improved Harmony Search Algorithm for the Location of Critical Slip Surfaces in Slope Stability Analysis

Author(s):  
Liang Li ◽  
Guang-Ming Yu ◽  
Shi-Bao Lu ◽  
Guo-Yan Wang ◽  
Xue-Song Chu
Land ◽  
2021 ◽  
Vol 10 (11) ◽  
pp. 1250
Author(s):  
Sina Shaffiee Haghshenas ◽  
Sami Shaffiee Haghshenas ◽  
Zong Woo Geem ◽  
Tae-Hyung Kim ◽  
Reza Mikaeil ◽  
...  

Slope stability analysis is undoubtedly one of the most complex problems in geotechnical engineering and its study plays a paramount role in mitigating the risk associated with the occurrence of a landslide. This problem is commonly tackled by using limit equilibrium methods or advanced numerical techniques to assess the slope safety factor or, sometimes, even the displacement field of the slope. In this study, as an alternative approach, an attempt to assess the stability condition of homogeneous slopes was made using a machine learning (ML) technique. Specifically, a meta-heuristic algorithm (Harmony Search (HS) algorithm) and K-means algorithm were employed to perform a clustering analysis by considering two different classes, depending on whether a slope was unstable or stable. To achieve the purpose of this study, a database made up of 19 case studies with 6 model inputs including unit weight, intercept cohesion, angle of shearing resistance, slope angle, slope height and pore pressure ratio and one output (i.e., the slope safety factor) was established. Referring to this database, 17 out of 19 slopes were categorized correctly. Moreover, the obtained results showed that, referring to the considered database, the intercept cohesion was the most significant parameter in defining the class of each slope, whereas the unit weight had the smallest influence. Finally, the obtained results showed that the Harmony Search algorithm is an efficient approach for training K-means algorithms.


Author(s):  
Erwin Erwin ◽  
Saparudin Saparudin ◽  
Wulandari Saputri

This paper proposes a new method for image segmentation is hybrid multilevel thresholding and improved harmony search algorithm. Improved harmony search algorithm which is a method for finding vector solutions by increasing its accuracy. The proposed method looks for a random candidate solution, then its quality is evaluated through the Otsu objective function. Furthermore, the operator continues to evolve the solution candidate circuit until the optimal solution is found. The dataset used in this study is the retina dataset, tongue, lenna, baboon, and cameraman. The experimental results show that this method produces the high performance as seen from peak signal-to-noise ratio analysis (PNSR). The PNSR result for retinal image averaged 40.342 dB while for the average tongue image 35.340 dB. For lenna, baboon and cameramen produce an average of 33.781 dB, 33.499 dB, and 34.869 dB. Furthermore, the process of object recognition and identification is expected to use this method to produce a high degree of accuracy.


2009 ◽  
Vol 95 (4) ◽  
pp. 401-426 ◽  
Author(s):  
Prithwish Chakraborty, ◽  
Gourab Ghosh Roy ◽  
Swagatam Das ◽  
Dhaval Jain ◽  
Ajith Abraham

2013 ◽  
Vol 415 ◽  
pp. 353-356 ◽  
Author(s):  
Hong Gang Xia ◽  
Qing Liang Wang

Harmony search (HS) algorithm is a good meta-heuristic intelligent optimization method and it does depend on imitating the music improvisation process to generate a perfect state of harmony. However, intelligent optimization methods is easily trapped into local optimal, HS is no exception. In order to improve the performance of HS, a new variant of harmony search algorithm is proposed in this paper. The variant introduce a new crossover operation into HS, and design a strategy to adjust parameter pitch adjusting rate (PAR) and bandwidth (BW). Several standard benchmarks carried out to be tested. The numerical results demonstrated that the superiority of the proposed method to the HS and recently developed variants (IHS, and GHS).


Sign in / Sign up

Export Citation Format

Share Document