焊接条优化设计问题的混沌人工蜂群算法求解

利用混沌的特点设计了一种混沌局部搜索算子,将该算子加入到原始人工蜂群算法中提出了一种混沌蜂群算法(CABC),并用之来优化焊接条的结构设计问题。该问题的目标是在满足约束条件下使得制造焊接条所需的总费用最小,是一个典型多维多约束非线性规划问题。为了不让人工蜂群算法优化该问题时陷入局部最优解,在原始蜂群算法末期的最优值附近进行混沌局部搜索,使其跳出局部最优,有效提高了算法的局部寻优能力。最后对焊接条设计问题进行了仿真计算,并将结果与其他文献中的结果进行了对比,显示了混沌人工蜂群算法优化焊接条设计问题的优越性。     

基于MOABCO的多目标测试用例优先级排序

为了提高回归测试的效率,提出了一种基于多目标人工蜂群优化(Multi-Objective Artificial Bee Colony Optimization, MOABCO)算法的多目标测试用例优先级排序(Multi-Objective Test Case Prioritization, MOTCP)方法.针对标准多目标人工蜂群(Multi-Objective Artificial Bee Colony, MOABC)算法容易陷入局部最优解的问题,将差分变异策略融入到新蜜源更新阶段,且基于信息熵改进新蜜源选择方法,以避免算法陷入局部最优并增强了全局搜索能力;然后,将代码覆盖率和测试用例有效执行时间作为优化目标,并用MOABCO算法求Pareto最优解集,以解决MOTCP问题.实验结果表明, MOABCO算法求得的Pareto最优解集在逼近性和分布均匀性上均优于MOABC算法;在解决MOTCP问题上,相对于NSGA-II算法具有更高的收敛速度和更高的缺陷检测率.     

基于差分人工蜂群算法的梁结构裂纹识别

采用差分人工蜂群算法对裂纹梁结构进行损伤识别。人工蜂群算法是一种元启发式算法,具有结构简单,方便执行但易于陷入局部最优的特点。为改善这一不足,在引领蜂阶段引入差分进化机制增强算法的全局搜索能力,在观察蜂阶段引入新的搜索公式来加强算法的局部搜索能力。另一方面,通过利用完全开口裂纹梁的前几阶固有频率建立损伤识别的目标函数,然后利用改进方法优化目标函数得到识别结果。数值算例和实验验证的结果表明,在仅知道前几阶固有频率的情况下,差分人工蜂群算法能够有效地识别损伤参数,优于原始人工蜂群算法、遗传算法和粒子群算法并且对测量噪声不敏感。     

改进二进制人工蜂群算法求解多维背包问题

针对二进制人工蜂群算法收敛速度慢、易陷入局部最优的缺点,提出一种改进的二进制人工蜂群算法。新算法对人工蜂群算法中的邻域搜索公式进行了重新设计,并通过Bayes公式来决定食物源的取值概率。将改进后的算法应用于求解多维背包问题,在求解过程中利用贪婪算法对进化过程中的不可行解进行修复,对背包资源利用不足的可行解进行修正。通过对典型多维背包问题的仿真实验,表明了本文算法在解决多维背包问题上的可行性和有效性。     

基于人工蜂群算法的车辆主动悬架LQG控制设计

针对2自由度1/4车体汽车悬架LQG最优控制模型,综合局部精英策略局部搜索能力强和人工蜂群算法全局搜索效率高的优点,提出基于局部精英策略人工蜂群算法确定其加权系数的优化方法。利用Matlab/Simulink仿真软件,以积分白噪声模型作为地面输入和单位阶跃输入为路面输入模型,分别将传统LQG控制、人工蜂群算法LQG控制和局部精英策略人工蜂群算法LQG控制进行仿真和对比分析,结果表明,局部精英策略人工蜂群算法LQG控制方法可改善汽车的行驶平顺性和操纵稳定性。     

一种改进的人工蜂群算法及其在桁架几何优化设计中的应用研究

由于人工蜂群(artificial bee colony,ABC)算法存在收敛速度慢、易陷入局部最优的缺点,采用设置自适应缩放因子和基于适应度排序的选择方式代替传统的轮盘赌模型,提出了一种改进的快速人工蜂群算法(fast artificial bee colony,FABC).基于这种FABC算法对4个离散变量的几何优化模型进行了优化,并与遗传算法(GA)、蚁群算法(ACA)、启发式粒子群优化算法(HPSO)和群搜索算法(GSO)作了比较.结果表明,这种改进的人工蜂群算法具有较好的收敛精度.另外,ABC算法以及FABC算法结构简单,可应用在其他优化问题上.     

具有快速收敛特性蜂群算法的球度误差评定

将蜂群算法应用到球度误差评定中,给出最小区域球度误差评定模型.根据球度误差评定的特点,改进了基本蜂群算法.首先从雇佣蜂中按概率引进一组蜂群实现最优搜索,加快算法的收敛速度;再按照概率随机选择部分侦察蜂在当前最优解邻域内搜索,提高算法跳出局部最优的能力.通过典型测试函数验证了该算法的可行性.比较改进蜂群算法与几种典型群智...     

基于改进最优觅食算法的锅炉NOx排放预测研究

提出了一种改进的最优觅食算法(POFA),在最优觅食算法中引入自适应惯性权值与全局最优解来改进算法的更新公式,同时加入相空间搜索的机制。利用改进的最优觅食算法优化极端学习机(ELM)构建一个改进的极端学习机模型(POFA-ELM),并用该模型对锅炉NO_x的排放特性进行建模。将该模型与ELM、差分进化算法、粒子群算法、人工蜂群算法以及基本的最优觅食算法优化的ELM模型进行比较。结果表明:该模型的预测精度更好,泛化能力更强,可以更加准确地预测NOx的排放质量浓度。     

基于改进人工鱼群算法的DIC形变分析

针对目前在数字图像相关(digital image correlation,DIC)整像素位移测量领域中,多种算法存在容易陷入局部最优,导致部分点存在测量误差的问题,该文选择基于群体智能优化的人工鱼群算法,利用该算法本身具有的全局搜索能力,能够快速跳出局部最优的特点来改善这个问题,同时该算法还具有简单、快速、并行性等优点。为进一步提高该算法的准确率和效率,采用混沌均匀初始化和自适应视野步长的方法对原有算法进行改进。最后通过实验得出,改进人工鱼群算法可以成功应用于整像素位移搜索中,并且与常用的粒子群算法相比准确率明显提高,且位移越大,这种优势越明显。所以改进人工鱼群算法可以作为一种新的算法测量材料在变形后的整像素位移。     

GEP在桁架结构优化中的应用

介绍基因表达式编程(GEP)算法的基本原理和在参数优化中的实现过程,并将该算法应用于桁架结构的优化设计。针对标准GEP容易陷入局部最优解,且收敛速度慢的缺陷,对算法引入回溯机制,用停滞前一代的精英个体替换当前种群中所有适应度最差的个体,使较优个体有更多机会向不同方向进化,扩大最优解的搜索空间。25杆空间桁架的截面优化设计结果证明:算法改进后,搜索效率得到明显提高,并通过72杆空间桁架算例,证明了该方法在结构优化中的可行性和有效性。     

自适应人工蜂群优化极限学习机在拉曼光谱血液定量分析中的应用

提出了一种基于自适应差分进化人工蜂群优化极限学习机预测血液各组分浓度的方法。首先应用人工蜂群算法对输入权值和隐含层阈值迭代寻优;其次结合差分进化进一步提高模型精度且避免后期易陷入局部最优等问题;由于差分进化算法交叉率和变异率存在凭经验给定的不确定性,最后引入了自适应调整的思想提出自适应差分进化人工蜂群算法优化极限学习机算法的模型,将其应用于血液成分定量分析中。实验表明,自适应差分进化人工蜂群算法优化的极限学习机模型具有较高的预测精度,模型具有较强的稳健性。     

A discrete artificial bee colony algorithm for single machine scheduling problems

This paper presents a discrete artificial bee colony algorithm for a single machine earliness–tardiness scheduling problem. The objective of single machine earliness–tardiness scheduling problems is to find a job sequence that minimises the total sum of earliness–tardiness penalties. Artificial bee colony (ABC) algorithm is a swarm-based meta-heuristic, which mimics the foraging behaviour of honey bee swarms. In this study, several modifications to the original ABC algorithm are proposed for adapting the algorithm to efficiently solve combinatorial optimisation problems like single machine scheduling. In proposed study, instead of using a single search operator to generate neighbour solutions, random selection from an operator pool is employed. Moreover, novel crossover operators are presented and employed with several parent sets with different characteristics to enhance both exploration and exploitation behaviour of the proposed algorithm. The performance of the presented meta-heuristic is evaluated on several benchmark problems in detail and compared with the state-of-the-art algorithms. Computational results indicate that the algorithm can produce better solutions in terms of solution quality, robustness and computational time when compared to other algorithms.     

基于自由振动响应识别桥梁断面颤振导数的人工蜂群算法

基于桥梁节段模型风洞试验自由振动衰减时程信号,提出了桥梁断面颤振导数识别的人工蜂群算法。基于最小二乘原理,将竖弯和扭转信号的整体残差平方和作为目标函数,使用人工蜂群算法对相关参数进行寻优搜索,识别出桥梁断面的颤振导数。与其他迭代算法相比,人工蜂群算法是受生物启发产生的寻优算法,对初值没有要求,从而避免了迭代初值对识别精度的影响。为考察人工蜂群算法在桥梁断面颤振导数识别中的有效性,进行了理想平板模型仿真以及某大桥节段模型风洞试验,结果表明,桥梁断面颤振导数识别的人工蜂群算法具有较好的稳定性和可靠性。     

Improved artificial bee colony algorithm based on escaped foraging strategy

This paper presents an improved artificial bee colony algorithm. Under the framework of the basic artificial bee colony algorithm, this paper redefines the artificial bee colony and introduces search strategies for group escape and foraging based on Levy flight. The proposed algorithm is named artificial bee colony algorithm based on escaped foraging strategy (EFSABC).There are different strategies for scout bees, onlookers, and free bees searching for honey sources in the EFSABC: all working bees relinquish old honey sources due to disturbance, and select different routines to seek new honey sources. Sixteen typical high-dimensional standard functions are used to verify the effectiveness of the proposed algorithm. The EFSABC algorithm outperforms the traditional artificial bee colony algorithm in all aspects.     

Automatic Data Clustering Based Mean Best Artificial Bee Colony Algorithm

Fuzzy C-means (FCM) is a clustering method that falls under unsupervised machine learning. The main issues plaguing this clustering algorithm are the number of the unknown clusters within a particular dataset and initialization sensitivity of cluster centres. Artificial Bee Colony (ABC) is a type of swarm algorithm that strives to improve the members’ solution quality as an iterative process with the utilization of particular kinds of randomness. However, ABC has some weaknesses, such as balancing exploration and exploitation. To improve the exploration process within the ABC algorithm, the mean artificial bee colony (MeanABC) by its modified search equation that depends on solutions of mean previous and global best is used. Furthermore, to solve the main issues of FCM, Automatic clustering algorithm was proposed based on the mean artificial bee colony called (AC-MeanABC). It uses the MeanABC capability of balancing between exploration and exploitation and its capacity to explore the positive and negative directions in search space to find the best value of clusters number and centroids value. A few benchmark datasets and a set of natural images were used to evaluate the effectiveness of AC-MeanABC. The experimental findings are encouraging and indicate considerable improvements compared to other state-of-the-art approaches in the same domain.     

A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking

A flow-shop scheduling problem with blocking has important applications in a variety of industrial systems but is underrepresented in the research literature. In this study, a novel discrete artificial bee colony (ABC) algorithm is presented to solve the above scheduling problem with a makespan criterion by incorporating the ABC with differential evolution (DE). The proposed algorithm (DE-ABC) contains three key operators. One is related to the employed bee operator (i.e. adopting mutation and crossover operators of discrete DE to generate solutions with good quality); the second is concerned with the onlooker bee operator, which modifies the selected solutions using insert or swap operators based on the self-adaptive strategy; and the last is for the local search, that is, the insert-neighbourhood-based local search with a small probability is adopted to improve the algorithm's capability in exploitation. The performance of the proposed DE-ABC algorithm is empirically evaluated by applying it to well-known benchmark problems. The experimental results show that the proposed algorithm is superior to the compared algorithms in minimizing the makespan criterion.     

Improved artificial bee colony algorithm for crack identification in beam using natural frequencies only

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.     

基于人工蜂群算法与反向传播神经网络的铝热连轧轧制力预测

在分析传统的轧制力数学模型的不足之后,提出了一种基于人工蜂群算法与反向传播神经网络相结合的铝热连轧轧制力预测方法,使用人工蜂群算法优化反向传播神经网络的初始权值和阈值。以现场采集的精轧机组数据作为训练和测试样本,并与Sims数学模型和反向传播神经网络的预测结果进行比较,实验结果表明所提方法的轧制力预测精度和误差明显优于传统算法。