混合粒子群算法搜索土坡危险滑动面

基本粒子群优化算法存在着对惯性因子敏感、计算量大等缺点,通过借鉴和声搜索算法产生新解的策略和不连续飞行假定,构成了混合粒子群算法。首先,当粒子飞行超越边界时,采用和声搜索算法产生新解;此外还引入了不连续飞行假定,即在每次迭代步中,随机选择一些个体更新速度、位置向量,以利于减少计算量。随机给定10组参数,分别利用基本粒子群优化算法和混合粒子群优化算法对某复杂土坡的最危险滑动面进行了搜索。比较发现,混合粒子群算法能在较短的计算时间内得到更好的结果。     

滑坡综合集成智能分析方法研究进展

本文综合课题组在滑坡方面的研究,以具体的滑坡工程为实例,详细介绍了滑坡现场监测、基于GIS的滑坡三维可视化、综合集成智能滑坡分析方法,包括滑坡变形预测的进化支持向量机建模、加固方案优化设计的进化神经网络-数值方法、基于动态聚类的进化神经网络危险性分区、滑体参数反演的进化支持向量机-有限元方法、滑动面搜索的免疫连续蚁群-极限平衡分析、滑动面参教反演的粒子群优化算法等。结果表明,所提出的滑坡研究综合集成智能分析方法是适用、科学和合理的。     

基于和声策略的粒子群优化算法在土坡稳定分析中的应用

土坡极限平衡稳定分析中临界滑动面的搜索是一个复杂的优化问题,在应用常规微粒群算法搜索时往往因参数较多且难以确定以及飞行速度越界的缺陷而陷入局部最优。基于对常规微粒群算法寻优思想的分析,借鉴和声算法的搜索策略来更新粒子的位置,提出基于和声策略的微粒群优化算法,该方法继承了常规微粒群算法中利用本身经验和社会认知的优势,又借鉴了和声策略的简单易行优势。将该方法应用于土坡稳定分析中,通过算例比较分析,证明新算法的有效性。     

Dynamic construction site layout planning using max-min ant system

Construction site layout planning (CSLP) is a dynamic multi-objective optimization (MOO) problem as there are different facilities employed in the different construction phases of a construction project. In this study, a new method using continuous dynamic searching scheme to guide the max-min ant system (MMAS) algorithm, which is one of the ant colony optimization (ACO) algorithms, to solve the dynamic CSLP problem under the two congruent objective functions of minimizing safety concerns and reducing construction cost is proposed. Using weighted sum method the MOO problem can be solved by the proposed MMAS method. An office building case was used to verify the capability of the proposed method to solve dynamic CSLP problem and the results are promising. The approach could be benchmarked by researchers using other advanced optimization algorithms to solve the same problem or expand the applications to other fields.     

Performance-based seismic design of steel frames using ant colony optimization

In this paper, a performance-based optimal seismic design of frame structures is presented using the ant colony optimization (ACO) method. This discrete metaheuristic algorithm leads to a significant improvement in consistency and computational efficiency compared to other evolutionary methods. A nonlinear analysis is utilized to arrive at the structural response at various seismic performance levels, employing a simple computer-based method for push-over analysis which accounts for first-order elastic and second-order geometric stiffness properties. Two examples are presented to illustrate the capabilities of ACO in designing lightweight frames, satisfying multiple performance levels of seismic design constraints for steel moment frame buildings, and a comparison is made with a standard genetic algorithm (GA) implementation to show the superiority of ACO for the discussed optimization problem.     

基于蚁群算法的复合形法及其在边坡稳定分析中的应用

首先将基于排序的路径选择方法引入基本蚁群算法 ,并用之于连续变量的优化问题和边坡的最小安全系数搜索 ,结果发现对于设计变量较少的数值优化问题和简单边坡的最小安全系数搜索问题 ,该蚁群算法可以找到全局最优解或比较接近全局最优解。但对于复杂边坡的最小安全系数搜索问题 ,该蚁群算法很容易陷入局部最优。另外复合形法对于不同的初始复合形也会得到不同的最小安全系数 ,利用本文提出的基于最小海明距离的替换准则将蚁群算法得到的局部最优解替换掉初始复形中的一个顶点 ,则复合形法容易找到全局最优 ,成为一种全局搜索能力很强的优化算法。     

基于NURBS表示的三维土坡稳定分析

非均匀有理B样条作为计算机辅助设计领域的曲线和曲面的标准描述方式,已经得到广泛的应用。利用非均匀有理B样条产生三维土坡的滑动底面,利用极限平衡简布法计算滑动体的安全系数,在粒子群算法寻优策略的深刻理解之上,借鉴和声策略直接模拟群体的位置更新得到了新型混合粒子群算法。利用该混合粒子群算法搜索最危险的滑动体,对一均质土坡和一软弱夹层土坡进行了计算分析,比较证明本文所提方法可应用于三维土坡稳定分析。     

多目标组合箱梁设计的粒子群优化方法

提出了多级搜索技术设计一个优化的组合箱梁飞行转动叶片,搜索技术称之为粒子群优化(受到鸟群飞行的启发),将连续的几何参数(断面尺寸)和箱梁离散折角作为设计变量,使之达到指定刚度和最大弹性连接的设计目标。目前组合箱梁的最大弹性连接增加了直升机转动叶片的气体弹性稳定性。多目标设计可明确表达为组合优化问题,采用粒子群优化技术求解,得到组合箱梁设计的最佳几何夹角为10°、15°和45°。对粒子群优化方法的性质和计算效率与各种设计方法进行了比较。模拟结果清楚显示,在性能和计算时间方面,粒子群优化方法比其他方法优越。     

桁架结构优化设计的改进蚁群算法

通过对已有的优化方法进行分析,针对蚁群算法容易收敛到局部最优解的缺陷,通过遗传算法和禁忌算法来提高增加蚁群算法的全局优化能力,并改进了算法的灵活性和扩展性;将改进的蚁群算法应用到桁架结构优化设计中,提出了桁架结构优化设计的改进蚁群算法,并建立了相应的优化模型;最后,对10杆平面桁架的优化进行了研究和分析,结果表明,提出的改进蚁群算法是科学可行的。     

改进的多目标启发式粒子群算法及其在桁架结构设计中的应用

针对工程结构多目标优化设计中出现的约束条件处理能力差、编程复杂,计算效率低且收敛精度差等问题,对启发式粒子群算法(HPSO)进行改进,提出了多目标启发式粒子群算法(MOHPSO),并与多目标粒子群算法(MOPSO)和改进的多目标群搜索算法(IMGSO)进行比较。通过对15杆平面桁架、40杆平面桁架和72杆空间桁架3个经典算例的计算,证明了所提出的MOHPSO算法的有效性。结果表明:MOHPSO算法具有收敛精度高、约束处理能力强、全局最优解选取更合理、非劣解集维护效率高等特点。     

混沌扰动启发式蚁群算法及其在边坡非圆弧临界滑动面搜索中的应用

通过引入混沌扰动算子增加解的多样性和提高全局寻优能力，另外通过构造蚂蚁的启发式搜索方式提高对局部最优解的搜索能力，从而有效地克服了基本蚁群算法容易出现停滞和搜索效率低的缺陷。还利用Spencer法和Janbu法，探讨了所提出的具有混沌扰动算子启发式蚁群算法在边坡稳定性分析中的应用。实例计算和对比分析结果表明，该法有效而又可靠。     

Advanced energy‐based analyses of trusses employing hybrid metaheuristics

Total potential optimization using metaheuristic algorithm (TPO/MA) is an alternative method in structural analyses, and it is a black‐box application for nonlinear analyses. In the study, an advanced TPO/MA using hybridization of several metaheuristic algorithms is investigated to solve large‐scale structural analyses problems. The new generation algorithms considered in the study are flower pollination algorithm (FPA), teaching learning‐based optimization, and Jaya algorithm (JA). Also, the proposed methods are compared with methodologies using classic and previously used algorithms such as differential evaluation, particle swarm optimization, and harmony search. Numerical investigations were carried out for structures with four to 150 degrees of freedoms (design variables). It has been seen that in several runs, JA gets trapped into local solutions. For that reason, four different hybrid algorithms using fundamentals of JA and phases of other algorithms, namely, JA using Lévy flights, JA using Lévy flights and linear distribution, JA with consequent student phase, and JA with probabilistic student phase (JA1SP), are developed. It is observed that among the variants tried, JA1SP is seen to be more effective on approaching to the global optimum without getting trapped in a local solution.     

A Customized Particle Swarm Method to Solve Highway Alignment Optimization Problem

Abstract: Optimizing highway alignment requires a versatile set of cost functions and an efficient search method to achieve the best design. Because of numerous highway design considerations, this issue is classified as a constrained problem. Moreover, because of the infinite number of possible solutions for the problem and the continuous search space, highway alignment optimization is a complex problem. In this study, a customized particle swarm optimization algorithm was used to search for a near‐optimal highway alignment, which is a compound of several tangents, consisting of circular (for horizontal design) and parabolic (for vertical alignment) curves. The selected highway alignment should meet the constraints of highway design while minimizing total cost as the objective function. The model uses geographical information system (GIS) maps as an efficient and fast way to calculate right‐of‐way costs, earthwork costs, and any other spatial information and constraints that should be implemented in the design process. The efficiency of the algorithm was verified through a case study using an artificial map as the study region. Finally, we applied the algorithm to a real‐world example and the results were compared with the alignment found by traditional methods.     

基于改进蚁群算法的室内疏散路径优化

针对传统蚁群算法在解决室内疏散问题时存在收敛速度慢、容易陷入局部最优的缺陷问题,将火场的动态参数引入到蚁群算法中,对其路径选择策略、启发函数和信息素更新策略进行改进,为整个疏散群体求解更优的疏散路径。运用改进的蚁群算法对室内人员的疏散路径进行动态规划,考虑了路径的实时拥挤度,避免了疏散人员局部实现路径优化的瓶颈效应。将分析结果与基本蚁群算法的规划结果进行比较验证,研究结果显示,优化算法缩短了疏散时间和规划路径,提高了疏散效率和搜索速度。     

运用蚁群优化法对钢结构进行基于性能的抗震设计

运用蚁群优化法(ACO)对钢结构进行了基于性能的抗震设计。这个离散的数学运算法比其他算法更为有效并精确。采用了非线性分析以得到结构在各种地震性能水平下的结构响应,采用一个简单的计算机程序,对包含一阶弹性和二阶几何刚度的特性进行推覆分析。采用两个实例说明了ACO在轻钢结构中的应用,证明其可满足抗弯钢结构在多种地震性能水平下的要求,同时也与标准遗传算法的结果进行对比,表明ACO更适合解决此类优化问题。     

基于v-SVR和MVPSO算法的边坡位移反分析方法及其应用

 针对传统粒子群算法存在搜索空间有限、容易陷入局部最优点的缺陷,通过引入迁徙算子和自适应变异算子,提出基于粒子迁徙和变异的粒子群优化(MVPSO)算法。基准测试函数结果表明,改进的MVPSO算法较传统的粒子群优化算法在收敛效率上有大幅度提高,在处理非线性、多峰值的复杂优化问题中能快速地搜索,得到全局最优解。应用改进的MVPSO算法搜索最佳的支持向量机(v-SVR)模型参数,建立岩体力学参数与岩体位移之间的非线性支持向量机模型,提高v-SVR的预测精度和推广泛化性。然后,利用v-SVR模型的外推预测替代耗时的FLAC正向计算,利用改进的MVPSO算法搜索岩体力学参数的最优组合,提出v-SVR和MVPSO相结合的边坡位移反分析方法(v-SVR-MVPSO算法),与传统的BP-GA算法和v-SVR-GA算法相比,该算法在反演精度和反演效率上均有较大幅度提高。最后,将本文发展的v-SVR-MVPSO算法应用到大岗山水电站右岸边坡岩体参数反演分析,并对边坡后续开挖位移和稳定性进行预测,取得较好的效果。     

群体智能优化算法的研究进展与展望

针对群体智能算法在结构优化设计领域中的应用，介绍了当前存在的一些群体智能算法，包括蚁群算法、鱼群算法和粒子群算法，阐述了其工作原理和特点，同时，对该算法在结构优化设计中的应用发展进行了展望。     

Multi-objective optimal design of braced frames using hybrid genetic and ant colony optimization

In this article, multi-objective optimization of braced frames is investigated using a novel hybrid algorithm. Initially, the applied evolutionary algorithms, ant colony optimization (ACO) and genetic algorithm (GA) are reviewed, followed by developing the hybrid method. A dynamic hybridization of GA and ACO is proposed as a novel hybrid method which does not appear in the literature for optimal design of steel braced frames. Not only the cross section of the beams, columns and braces are considered to be the design variables, but also the topologies of the braces are taken into account as additional design variables. The hybrid algorithm explores the whole design space for optimum solutions. Weight and maximum displacement of the structure are employed as the objective functions for multi-objective optimal design. Subsequently, using the weighted sum method (WSM), the two objective problem are converted to a single objective optimization problem and the proposed hybrid genetic ant colony algorithm (HGAC) is developed for optimal design. Assuming different combination for weight coefficients, a trade-off between the two objectives are obtained in the numerical example section. To make the final decision easier for designers, related constraint is applied to obtain practical topologies. The achieved results show the capability of HGAC to find optimal topologies and sections for the elements.     

Design optimization of tall steel buildings by a modified particle swarm algorithm

Optimal design of tall buildings, as large‐scale structures, is a rather difficult task. To efficiently achieve this task, the computational performance of the employed standard meta‐heuristic algorithms needs to be improved. One of the most popular meta‐heuristics is particle swarm optimization (PSO) algorithm. The main aim of the present study is to propose a modified PSO (MPSO) algorithm for optimization of tall steel buildings. In order to achieve this purpose, PSO is sequentially utilized in a multi‐stage scheme where in each stage an initial swarm is generated on the basis of the information derived from the results of previous stages. Two large‐scale examples are presented to investigate the efficiency of the proposed MPSO. The numerical results demonstrate the computational advantages of the MPSO algorithm. Copyright © 2012 John Wiley & Sons, Ltd.     

粒子群优化算法在桁架优化设计中的应用

粒子群优化（PSO）算法是近年来发展起来的一种基于群智能的随机优化算法,具有概念简单、易于实现、占用资源低等优点。为了解决有应力约束和位移约束的桁架的尺寸优化问题,将PSO算法应用于桁架结构的尺寸优化设计。首先介绍了原始的PSO算法的基本原理,然后引入压缩因子改进了PSO算法,并提出合理的参数设置值。对几个经典问题进行了求解,并与传统的优化算法和遗传算法进行了比较。数值结果表明,改进的PSO算法具有良好的收敛性和稳定性,可以有效地进行桁架结构的尺寸优化设计。