scholarly journals Study on Displacement Prediction Model of Foundation Pit Based on the Improved Genetic Algorithm

Author(s):  
Song Qiang ◽  
Wei Zhao ◽  
Weilin Huang
2021 ◽  
Vol 676 (1) ◽  
pp. 012124
Author(s):  
Kai Peng ◽  
Yuefei Zhou ◽  
Yaolai Liu ◽  
Liangliang Ma ◽  
Yi Xie ◽  
...  

2020 ◽  
Vol 10 (4) ◽  
pp. 280-292
Author(s):  
Allemar Jhone P. Delima

The k-nearest neighbor (KNN) algorithm is vulnerable to noise, which is rooted in the dataset and has negative effects on its accuracy. Hence, various researchers employ variable minimization techniques before predicting the KNN in the quest so as to improve its predictive capability. The genetic algorithm (GA) is the most widely used metaheuristics for such purpose; however, the GA suffers a problem that its mating scheme is bounded on its crossover operator. Thus, the use of the novel inversed bi-segmented average crossover (IBAX) is observed. In the present work, the crossover improved genetic algorithm (CIGAL) is instrumental in the enhancement of KNN’s prediction accuracy. The use of the unmodified genetic algorithm has removed 13 variables, while the CIGAL then further removes 20 variables from the 30 total variables in the faculty evaluation dataset. Consequently, the integration of the CIGAL to the KNN (CIGAL-KNN) prediction model improves the KNN prediction accuracy to 95.53%. In contrast to the model of having the unmodified genetic algorithm (GA-KNN), the use of the lone KNN algorithmand the prediction accuracy is only at 89.94% and 87.15%, respectively. To validate the accuracy of the models, the use of the 10-folds cross-validation technique reveals 93.13%, 89.27%, and 87.77% prediction accuracy of the CIGAL-KNN, GA-KNN, and KNN prediction models, respectively. As the result, the CIGAL carried out an optimized GA performance and increased the accuracy of the KNN algorithm as a prediction model.


Author(s):  
Qiang Song ◽  
Junjian Zhang ◽  
Wei Zhang ◽  
Yunsheng Liu ◽  
Xianli Cui

2013 ◽  
Vol 834-836 ◽  
pp. 679-682
Author(s):  
Qiang Song ◽  
Jun Jian Zhang ◽  
Yun Sheng Liu

The prediction model is proposed in this paper to predict the displacement of foundation pit. In the model, genetic algorithms is applied to optimize the node function of the neural network (15 node function coefficients are optimized simultaneously). Next, do the further optimization to the model, and GA-transFcn3 Model is established whose fitness evaluation takes into account the multi-step prediction error. Finally, it is verified that the GA-transFcn3 Model created in this article has the desirable prediction accuracy through engineering examples. The establishment of GA-transFcn3 Model can provide researchers and engineers with ideas and methods for the displacement prediction of foundation pit, and can be popularized and applied in practical projects.


2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Xiao-Hua Yang ◽  
Yu-Qi Li

There are many parameters which are very difficult to calibrate in the threshold autoregressive prediction model for nonlinear time series. The threshold value, autoregressive coefficients, and the delay time are key parameters in the threshold autoregressive prediction model. To improve prediction precision and reduce the uncertainties in the determination of the above parameters, a new DNA (deoxyribonucleic acid) optimization threshold autoregressive prediction model (DNAOTARPM) is proposed by combining threshold autoregressive method and DNA optimization method. The above optimal parameters are selected by minimizing objective function. Real ice condition time series at Bohai are taken to validate the new method. The prediction results indicate that the new method can choose the above optimal parameters in prediction process. Compared with improved genetic algorithm threshold autoregressive prediction model (IGATARPM) and standard genetic algorithm threshold autoregressive prediction model (SGATARPM), DNAOTARPM has higher precision and faster convergence speed for predicting nonlinear ice condition time series.


Author(s):  
Ge Weiqing ◽  
Cui Yanru

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.


Sign in / Sign up

Export Citation Format

Share Document