共查询到18条相似文献,搜索用时 140 毫秒
1.
基于广义遗传算法的结构动力响应优化 总被引:5,自引:1,他引:4
为提高广义遗传算法的收敛效率,提出了防止遗传算法发生早熟收敛的异种机制,给出了一个判断种群近亲繁殖程度的判别式和两种选择异种的方法,并结合种群隔离机制、算术杂交、自适应随机变异等数值方法设计了新的广义遗传算法。将该算法应用于结构动力响应的支撑位置优化问题。数值算例表明:异种机制能够明显提高遗传算法的收敛效率,并有效防止早熟收敛;带有异种机制的新广义遗传算法能够解决具有抗弯刚度的结构动力响应支撑位置优化问题,对于求解复杂的结构动力响应支撑位置优化具有较强的适用性。 相似文献
2.
3.
4.
5.
目的使萤火虫优化算法(GSO)能够适用于车辆路径问题(VRP)的求解,同时提高该算法的求解性能。方法通过对GSO算法的改进,提出求解VRP问题的混沌模拟退火萤火虫优化算法(CSAGSO)。首先,设计改进的GSO算法(IGSO)使IGSO算法能够适应VRP问题的求解;其次,在IGSO算法中引入模拟退火机制,提出模拟退火萤火虫优化算法(SAGSO),使IGSO算法可有效避免陷入局部极小并最终趋于全局最优。然后,在SAGSO算法中引入混沌机制,提出CSAGSO算法,对SAGSO算法的荧光素浓度值进行混沌初始化和混沌扰动;最后,对标准算例集进行仿真测试。结果与遗传算法、蚁群算法和粒子群算法相比,CSAGSO算法的全局寻优能力、收敛速度及稳定性均改善了50%以上。结论对GSO算法的改进是合理的,且CSAGSO算法的全局优化能力、收敛速度和稳定性均优于遗传算法、蚁群算法和粒子群算法。 相似文献
6.
遗传算法的改进策略及其在桥梁抗震优化设计中的应用效果 总被引:14,自引:3,他引:11
本文论述了采用遗传算法进行结构优化设计时遇到的诸如计算量大、早熟收敛和边界探索不足等棘手问题,提出了三个解决对策,编制了计算程序,其在桥梁抗震代化设计中的应用效果表明,改进后的遗传算法不但提高了计算速度,而且在尽可能短的时间内找到最好的优化解。 相似文献
7.
为了解决桥梁结构健康监测中的传感器优化布置问题,提出一种基于二重结构编码遗传算法的传感器优化布置方法.首先改进了编码方法,采用二重结构编码进行种群的初始化、交叉和变异,然后选择时采用最优保存策略,交叉时采用自适应部分匹配交叉,变异时采用自适应逆位变异.该法克服了传统遗传算法应用于大型结构时收敛速度慢且易陷入局部最优的缺陷,大大加快了收敛速度,并确保能够搜索到最优解.最后通过一个桥梁工程的实例分析,证明了该法在搜索能力、计算效率和可靠性方面明显优于序列法,可广泛地应用于桥梁结构的健康监测. 相似文献
8.
摘要: 经典遗传算法存在局部搜索能力不强,“早熟”现象和后期收敛速度放慢等缺陷,本文将自适应策略与“预选择机制”的小生境技术同时引入其中,加入小生境技术后可以避免陷入局部收敛的问题;在小生境遗传算法基础上加入自适应策略,实现对种群的杂交概率和变异概率进行自适应控制,从而形成一种改进小生境遗传算法,可以有效维持种群中个体的多样性,同时可以改善全局收敛的可靠性。通过三个典型算例验证了本文算法的正确性,并通过单层球壳的算例分析表明该方法稳定性好,全局搜索能力强,但在计算时间上长于ANSYS自带的优化模块。本文算法可以应用于优化变量繁多的大中型网壳结构截面优化问题,优化效果明显。 相似文献
9.
10.
11.
12.
An improved artificial bee colony algorithm (I-ABC) is proposed for crack identification in beam structures. ABC is a heuristic algorithm and swarm technique with simple structure, which is easy to implement but with slow convergence rate. In the I-ABC, the differential evolution (DE) mechanism is introduced to employed bee phase, roulette selection strategy is replaced by tournament selection strategy and a new formula is used to simulate onlooker bee’s behaviour. A discrete open crack is used for vibration analysis of the cracked beam and only the changes in the first few natural frequencies are utilized to establish the objective function of the optimization problem for crack identification. A numerical simulation and an experimental work are studied to illustrate the efficiency of the proposed method. Studies show that the present techniques can produce more accurate damage identification results when compared with original ABC, DE algorithm, particle swarm optimization and genetic algorithm. 相似文献
13.
针对超声波天然产物萃取过程中产物浓度难以在线检测的问题,提出了一种改进果蝇优化最小二乘支持向量机(Least Squares Support Vector Machine,LSSVM)的超声波萃取产物浓度软测量建模方法。首先将混沌优化与迭代步长动态调节方法相融合,提出了一种混沌动态步长改进果蝇优化算法(Chaos Dynamic Step Fluit Fly Optimization Algorithm,CDSFOA),该算法引入动态调节因子对步长动态更新,并利用混沌优化实现各变量之间映射等操作,能够有效提高果蝇优化算法的收敛精度和收敛速度,然后利用CDSFOA对LSSVM进行参数寻优,构建最优CDSFOA-LSSVM软测量模型,最后利用超声波斛皮素萃取实验数据进行验证。结果表明,提出的模型不仅有较好的学习和泛化能力,而且具有良好的预测精度,可为超声波天然产物萃取工艺优化提供理论指导。 相似文献
14.
This article proposes an improved imperialistic competitive algorithm to solve multi-objective optimization problems. The proposed multi-objective imperialistic competitive algorithm (MOICA) uses the elitist strategy, based on the mutation and crossover as in genetic algorithms, and the Pareto concept to store simultaneously optimal solutions of multiple conflicting functions. Three performance metrics are used to evaluate the performance of the new algorithm: convergence to the true Pareto-optimal set, solution diversity and robustness, characterized by the variance over 10 runs. To validate the efficiency of the proposed algorithm, several multi-objective standard test functions with true solutions are used. The obtained results show that the MOICA outperforms most of the methods available in the literature. The proposed algorithm can also handle multi-objective engineering design problems with high dimensions. 相似文献
15.
目的 为了更加合理地进行车辆路径调度管理,提高粒子群求解车辆路径优化问题的性能。方法 提出了一种动态猴子跳跃机制的粒子群优化算法,它借助群体的动态分组,采用不同的动态惯性权重来提高算法的速度,引入猴子跳跃机制来保证全局收敛性。最后把改进算法应用到物流配送路径优化的2个实例中,同一环境下,改进算法搜寻到最优路径适应值、平均运算时间,以及求得最优解的成功次数,均优于标准粒子群优化算法。结果 结果表明,改进的算法能快速有效地确定物流配送路径。结论 改进粒子群优化算法不仅具有较快的寻优速度,而且也提高了算法的收敛性,保证了寻优质量,因此具有很大的应用价值。 相似文献
16.
As an evolutionary computing technique, particle swarm optimization (PSO) has good global search ability, but the swarm can easily lose its diversity, leading to premature convergence. To solve this problem, an improved self-inertia weight adaptive particle swarm optimization algorithm with a gradient-based local search strategy (SIW-APSO-LS) is proposed. This new algorithm balances the exploration capabilities of the improved inertia weight adaptive particle swarm optimization and the exploitation of the gradient-based local search strategy. The self-inertia weight adaptive particle swarm optimization (SIW-APSO) is used to search the solution. The SIW-APSO is updated with an evolutionary process in such a way that each particle iteratively improves its velocities and positions. The gradient-based local search focuses on the exploitation ability because it performs an accurate search following SIW-APSO. Experimental results verified that the proposed algorithm performed well compared with other PSO variants on a suite of benchmark optimization functions. 相似文献
17.
目的 针对数字化生产车间工位物料需求时间的不确定,导致物料配送不准确、不及时的问题,提出一种动态物料配送策略。方法 首先,根据工位关联度和变动时间窗确定实时的配送工位和协同配送工位,设计基于工位排序的动态物料配送路径优化策略。其次,建立以配送成本和时间窗偏离惩罚成本综合最小为目标函数的数学模型。最后,提出并采用系统动力学仿真与蚁群遗传融合算法联合的方法对模型进行求解。结果 模拟算例表明,与静态物料配送优化策略相比,该策略的平均时间成本减少率为30.1%,平均库存减少率为14.86%。结论 该策略能够根据动态时间窗确定配送工位和协同工位,并实时调整配送顺序,实现物料配送的动态自适应性调整,降低总配送成本。融合算法在迭代次数、收敛性、最优解质量方面有明显优越性。 相似文献
18.
In this paper, a bioinspired path planning approach for mobile robots is proposed. The approach is based on the sparrow search algorithm, which is an intelligent optimization algorithm inspired by the group wisdom, foraging, and anti-predation behaviors of sparrows. To obtain high-quality paths and fast convergence, an improved sparrow search algorithm is proposed with three new strategies. First, a linear path strategy is proposed, which can transform the polyline in the corner of the path into a smooth line, to enable the robot to reach the goal faster. Then, a new neighborhood search strategy is used to improve the fitness value of the global optimal individual, and a new position update function is used to speed up the convergence. Finally, a new multi-index comprehensive evaluation method is designed to evaluate these algorithms. Experimental results show that the proposed algorithm has a shorter path and faster convergence than other state-of-the-art studies.The full text can be downloaded at https://link.springer.com/article/10.1007/s40436-021-00366-x 相似文献