共查询到20条相似文献,搜索用时 137 毫秒
1.
以珠海某城际铁路盾构隧道施工建设为背景,结合已采集的盾构施工数据,采用粒子群优化算法对BP神经网络算法中的连接权值和阈值进行优化,建立了PSO-BP神经网络盾构掘进参数预测模型,并对建立的模型和预测结果进行验证,为后续复合地层盾构掘进参数的选取提供一定参考。 相似文献
2.
为提高空调冷负荷预测精度,本文提出了基于PSO-BP算法的神经网络模型。将PSO算法与BP神经网络相结合,对大型商场的空调样本数据进行冷负荷预测实验。结果表明,与BP神经预测算法相比,该算法的预测精度更高,运行速度更快。 相似文献
3.
针对混凝土内部钢筋腐蚀程度判别难、精确度低等问题,提出了将改进粒子群算法(PSO)与BP神经网络结合起来,通过对钢筋锈蚀机理及其影响因素的分析,建立了以混凝土内部温度、湿度、pH值、Cl-浓度和腐蚀电位为输入,钢筋腐蚀率为输出的改进PSO-BP监测模型,并将实测输入数据与仿真结果进行了对比。结果表明,改进PSO-BP算法的收敛性与准确性均优于PSO-BP算法和BP算法。 相似文献
4.
在分析城市用水特点、筛选相关影响因素的基础上建立城市生活需水量预测模型,并研究了模型求解过程中智能算法的应用。采用改进的粒子群优化(PSO)算法对反向传播(BP)神经网络的初始设置进行智能优化,避免了传统BP神经网络模型在训练过程中容易陷入局部极小值的缺点。应用该粒子群优化神经网络(PSO-BP)算法求解需水量预测模型,其实例结果表明,该算法提高了神经网络的训练效率,基于该算法的预测模型具有较理想的可靠性和精度。 相似文献
5.
通过TBM上升段数据预测稳定段的掘进参数,可以在每个掘进循环的起始阶段预测出各掘进参数的建议值,辅助进行TBM掘进参数的设置和优化调整。提出一种基于改进粒子群算法优化BP神经网络(Improvedparticle swarm optimization-back propagation,IPSO-BP)的TBM掘进参数预测模型,采用自适应惯性权重对标准PSO算法进行改进,并基于改进PSO算法对BP网络的连接权值和偏置进行优化。基于吉林引松工程TBM3标段802 d的TBM运行数据对训练集和测试集进行划分。选取TBM掘进上升段前30 s的刀盘扭矩、贯入度、刀盘功率、推进速度、总推进力5个掘进参数变化特征(均值和线性拟合斜率),以及岩性、围岩分级和地下水活动情况3个地质参数作为模型的输入,并通过试验法确定模型的3个关键超参数(隐含层节点数、学习率和粒子群种群规模),预测稳定掘进时的推进速度v、总推进力F和刀盘扭矩T。结果表明,所提出的模型对TBM稳定掘进段参数的预测拟合优度均达0.85以上,平均绝对百分误差均小于12.68%,相比于BP模型和PSO-BP模型具有更高的预测精度。 相似文献
6.
7.
神经网络具有结构简单,鲁棒性强,能够逼近任意函数的非线性映射能力,在多个领域得到了广泛应用。但其梯度下降法容易陷入局部最优,训练效率较低。采用粒子群算法(PSO)对BP神经网络进行改进,利用粒子群算法为BP神经网络提供精确的全局搜索能力,提高其训练效率和预测精度。基于建筑物实际沉降观测数据,对BP神经网络和PSO-BP神经网络进行对比分析。结果表明,PSO-BP神经网络的训练效果获得了较大提升,预测精度提升了约61%,预测结果明显优于传统BP神经网络。 相似文献
8.
为使地铁隧道在施工中沉降监测数据具有一定的预见性,分别采用了BP神经网络改进算法的预测模型、传统BP神经网络预模型以及基于时间序列的三次指数平滑法预测模型对地铁隧道施工中的沉降监测数据进行了预测。对其预测结果进行分析,得出了BP神经网络改进算法模型预测精度优于传统BP神经网络模型以及基于时间序列的三次指数平滑法模型预测精度的结论。 相似文献
9.
结合工程实例,针对基坑开挖过程的变形特点,应用BP神经网络和基于粒子群优化算法的BP神经网络对基坑支护结构的变形进行预测,并对两种方法预测结果进行比较分析。结果表明,基于粒子群优化算法的BP网络的泛化预测性能要优于BP网络,预测深基坑地下连续墙结构水平位移更有效。 相似文献
10.
提出利用最大相关和最小冗余(mRMR)算法、粒子群优化(PSO)算法,对BP神经网络预测模型进行优化。对某住宅楼进行供热负荷预测,评价3种神经网络预测模型(BP神经网络预测模型、mRMR-BP神经网络预测模型、PSO-mRMR-BP神经网络预测模型)的预测效果。在3种神经网络预测模型中,BP神经网络预测模型的预测效果最差,PSO-mRMR-BP神经网络预测模型的预测效果最佳。与BP神经网络预测模型相比,经过mRMR算法对输入变量进行筛选以及PSO算法对初始参数进行优化,PSO-mRMR-BP神经网络预测模型的预测效果显著提高。 相似文献
11.
《Urban Water Journal》2013,10(2):111-120
Application of particle swarm optimization (PSO) is demonstrated through design of a water distribution pipeline network. PSO is an evolutionary algorithm that utilizes the swarm intelligence to achieve the goal of optimizing a specified objective function. This algorithm uses the cognition of individuals and social behaviour in the optimization process. For the optimization of water distribution system, a simulation – optimization model, called PSONET is developed and used in which the optimization is by PSO. This formulation is applied to two benchmark optimization design problems. The results are compared with the results obtained by other optimization methods. The results show that the PSO is more efficient than other optimization methods as it requires fewer objective function evaluations. 相似文献
12.
针对遗传算法存在的问题,提出一种利用微粒群算法(PSO)优化污水管网的模型,并阐述了应用微粒群算法进行污水管网优化设计的原理、特点。在南京市某地区的污水系统设计中采用了该算法,取得了良好的社会效益和经济效益。 相似文献
13.
14.
粒子群优化算法在桁架优化设计中的应用 总被引:3,自引:0,他引:3
粒子群优化(PSO)算法是近年来发展起来的一种基于群智能的随机优化算法,具有概念简单、易于实现、占用资源低等优点。为了解决有应力约束和位移约束的桁架的尺寸优化问题,将PSO算法应用于桁架结构的尺寸优化设计。首先介绍了原始的PSO算法的基本原理,然后引入压缩因子改进了PSO算法,并提出合理的参数设置值。对几个经典问题进行了求解,并与传统的优化算法和遗传算法进行了比较。数值结果表明,改进的PSO算法具有良好的收敛性和稳定性,可以有效地进行桁架结构的尺寸优化设计。 相似文献
15.
16.
Hamed FATHNEJAT Behrouz AHMADI-NEDUSHAN 《Frontiers of Structural and Civil Engineering》2020,14(4):907
In this study, the performance of an efficient two-stage methodology which is applied in a damage detection system using a surrogate model of the structure has been investigated. In the first stage, in order to locate the damage accurately, the performance of the modal strain energy based index for using different numbers of natural mode shapes has been evaluated using the confusion matrix. In the second stage, to estimate the damage extent, the sensitivity of most used modal properties due to damage, such as natural frequency and flexibility matrix is compared with the mean normalized modal strain energy (MNMSE) of suspected damaged elements. Moreover, a modal property change vector is evaluated using the group method of data handling (GMDH) network as a surrogate model during damage extent estimation by optimization algorithm; in this part of methodology, the performance of the three popular optimization algorithms including particle swarm optimization (PSO), bat algorithm (BA), and colliding bodies optimization (CBO) is examined and in this regard, root mean square deviation (RMSD) based on the modal property change vector has been proposed as an objective function. Furthermore, the effect of noise in the measurement of structural responses by the sensors has also been studied. Finally, in order to achieve the most generalized neural network as a surrogate model, GMDH performance is compared with a properly trained cascade feed-forward neural network (CFNN) with log-sigmoid hidden layer transfer function. The results indicate that the accuracy of damage extent estimation is acceptable in the case of integration of PSO and MNMSE. Moreover, the GMDH model is also more efficient and mimics the behavior of the structure slightly better than CFNN model. 相似文献
17.
Vagelis Plevris Manolis Papadrakakis 《Computer-Aided Civil and Infrastructure Engineering》2011,26(1):48-68
Abstract: The particle swarm optimization (PSO) method is an instance of a successful application of the philosophy of bounded rationality and decentralized decision making for solving global optimization problems. A number of advantages with respect to other evolutionary algorithms are attributed to PSO making it a prospective candidate for optimum structural design. The PSO‐based algorithm is robust and well suited to handle nonlinear, nonconvex design spaces with discontinuities, exhibiting fast convergence characteristics. Furthermore, hybrid algorithms can exploit the advantages of the PSO and gradient methods. This article presents in detail the basic concepts and implementation of an enhanced PSO algorithm combined with a gradient‐based quasi‐Newton sequential quadratic programming (SQP) method for handling structural optimization problems. The proposed PSO is shown to explore the design space thoroughly and to detect the neighborhood of the global optimum. Then the mathematical optimizer, starting from the best estimate of the PSO and using gradient information, accelerates convergence toward the global optimum. A nonlinear weight update rule for PSO and a simple, yet effective, constraint handling technique for structural optimization are also proposed. The performance, the functionality, and the effect of different setting parameters are studied. The effectiveness of the approach is illustrated in some benchmark structural optimization problems. The numerical results confirm the ability of the proposed methodology to find better optimal solutions for structural optimization problems than other optimization algorithms. 相似文献
18.
The purpose of reliability-based design optimization (RBDO) is to find a balanced design that is not only economical but also reliable in the presence of uncertainty. Practical applications of RBDO involve discrete design variables, which are selected from commercially available lists, and non-smooth (non-differentiable) performance functions. In these cases, the problem becomes an NP-complete combinatorial optimization problem, which is intractable for discrete optimization methods. Moreover, the non-smooth performance functions would hinder the use of gradient-based optimizers as gradient information is of questionable accuracy. A framework is presented in this paper whereby subset simulation is integrated with a new particle swarm optimization (PSO) algorithm to solve the discrete and non-smooth RBDO problem. Subset simulation overcomes the inefficiency of direct Monte Carlo simulation (MCS) in estimating small failure probabilities, while being robust against the presence of non-smooth performance functions. The proposed PSO algorithm extends standard PSO to include two new features: auto-tuning and boundary-approaching. The former feature allows the proposed algorithm to automatically fine tune its control parameters without tedious trial-and-error procedures. The latter feature substantially increases the computational efficiency by encouraging movement toward the boundary of the safe region. The proposed auto-tuning boundary-approaching PSO algorithm (AB-PSO) is used to find the optimal design of a ten-bar truss, whose component sizes are selected from commercial standards, while reliability constraints are imposed by the current design code. In multiple trials, the AB-PSO algorithm is able to deliver competitive solutions with consistency. The superiority of the AB-PSO algorithm over standard PSO and GA (genetic algorithm) is statistically supported by non-parametric Mann-Whitney U tests with the p-value less than 0.01. 相似文献
19.
边坡非圆弧临界滑动面的粒子群优化算法 总被引:4,自引:1,他引:4
采用粒子群优化算法搜索边坡的临界滑动面及其对应的最小安全系数。粒子群优化算法不断迭代更新试算滑动面,使其安全系数不断减小,经过有限次的迭代分析可确定边坡临界滑动面及其对应的全局最小安全系数。粒子群优化算法具有较好的全局搜索和局部搜索能力,可克服多数常规的优化方法易陷入安全系数局部极小的问题,并具有较高的搜索效率。同时,粒子群优化算法易于与极限平衡法或有限元-极限平衡法相结合进行边坡稳定分析。通过数值算例及与其他学者的结果比较,证明提出的确定边坡临界滑动面方法的有效性。 相似文献
20.
利用随机方向法初始化种群提高粒子群算法初始种群的质量.将模糊推理应用于粒子群算法的参数调整克服了人为经验设定参数的不足,种群搜索过程中嵌入Metropolis准则改善粒子群算法的鲁棒性能。将改进的粒子群算法应用于桁架结构形状优化设计中。实验仿真表明.改进后的算法具有较好的搜索性能和较高的计算精度,有望实现应用在复杂的桁架结构优化设计中.其具有重要的理论研究价值和广阔的工程应用前景. 相似文献