改进蜂群算法在平面度误差评定中的应用

为了准确快速评定平面度误差,提出将改进人工蜂群( MABC)算法用于平面度误差最小区域的评定.介绍了评定平面度误差的最小包容区域法及判别准则,并给出符合最小区域条件的平面度误差评定数学模型.叙述了MABC算法,该算法在基本人工蜂群算法( ABC)模型的基础上引入两个牵引蜂和禁忌搜索策略.阐述了算法的实现步骤,通过分析选用两个经典测试函数验证了MABC算法的有效性.最后,应用MABC算法对平面度误差进行评定,其计算结果符合最小条件.对一组测量数据的评定显示,MABC算法经过0.436 s可找到最优平面,比ABC算法节省0.411 s,其计算结果比最小二乘法和遗传算法的评定结果分别小18.03μm和6.13 μm.对由三坐标机测得的5组实例同样显示,MABC算法的计算精度比遗传算法和粒子群算法更有优势,最大相差0.9 μm.实验结果表明,MABC算法在优化效率、求解质量和稳定性上优于ABC算法,计算精度优于最小二乘法、遗传算法和粒子群算法,适用于形位误差测量仪器及三坐标测量机.     

基于改进果蝇优化的机械圆度误差评定研究

针对机械零件圆度误差的最小区域圆法评定问题,提出一种基于改进果蝇优化算法的评定圆度误差新方法。首先根据最小区域圆法圆度误差数学描述的优化模型设计了果蝇种群个体的编码方式以及新型味道浓度判定函数;其次在保持基本果蝇优化算法典型流程的基础上,引入增强搜索和交互学习机制来增强算法的学习效率以及保持种群的多样性;最后采用3个典型的圆度误差评定问题来验证算法性能。实例分析计算表明该方法是可行有效的,其结果具有较高精度且优于传统的评定方法,适用于求解圆度误差的评定优化问题。     

改进教与学算法在圆度误差评定中的应用

为了提高圆度误差的评定精度和计算收敛速度,提出了一种改进教与学算法的圆度误差评定方法。首先,通过圆度误差最小区域原则的数学模型,建立算法的目标函数。其次,在标准教与学算法的基础上,设计了两阶段爬山搜索策略增强局部开发能力,进一步提高算法精度和收敛速度。最后通过三坐标测量的圆度测量数据进行求解验证,并将计算结果与常用的最小二乘法,遗传算法,粒子群算法等进行对比。实例表明,改进教与学算法在圆度误差评定上的计算精度和收敛速度都优于传统算法,体现了其优越性。     

基于混沌蜂群算法的小型无人直升机系统辨识

针对小型无人直升机在悬停状态下飞行动力学模型的系统辨识问题,提出了一种基于混沌蜂群算法(chaotic artificial bee colony algorithm,简称CABC)的辨识方法。由于直升机的数学模型是非线性的,因此用小扰动理论对其线性化,得到纵横方向待辨识的解耦模型;进一步将系统辨识问题转变成优化问题,以蜂群为搜索单位,通过群体之间的信息交流与优胜劣汰机制,使得蜂群向更优方向进化;利用混沌算子来改进侦察蜂的搜索机制,使得人工蜂群算法脱离局部最优束缚,获得更强的全局寻优能力。根据无人机实际飞行试验数据,对辨识获得的模型进行了分析与验证,结果表明,采用该辨识方法,估计出了解耦模型中的未知参数,与遗传算法和传统人工蜂群算法相比,所提算法的辨识精度更高。     

基于遗传算法的圆度误差评估

将遗传算法应用于圆度误差的评定.首先简介了误差评定背景和遗传算法及其特点.然后根据尺寸和公差的数学定义^[1]给出满足最小区域条件的圆度公差评定的数学模型和适应度函数.接着,以最小二乘解作为初始值,对圆度误差的遗传优化过程进行了详细的论述.最后用实例对算法进行验证.优化过程和实验结果显示了遗传算法在解决形状公差的评定这类非线性问题的优越性,通过并行搜索能最大限度地保证解的全局最优,计算精度高、效率高,且易于理解和实现.     

基于变尺度教与学算法的DCT换挡毂圆度误差评定研究

针对空间圆度误差评定精度较低以及计算速度较慢的问题,提出了一种变尺度教与学算法的空间圆度误差评定方法。首先,基于误差最小区域原则建立了数学模型和目标函数,随后在标准教与学算法的基础上设计变尺度法教与学算法进行优化,提高了算法的收敛速度和计算精度。最后针对某双离合变速器(DCT)换挡毂?12j6轴颈的16个数据进行求解验证,并将计算结果与粒子群算法、改进的蜂群算法和蔡司三坐标测量机结果进行对比。实例表明,变尺度教与学算法与粒子群算法、改进的蜂群算法相比,在空间圆度误差评定上的收敛速度和计算精度均有明显的优势,体现了变尺度教与学算法的优越性。     

具有二重机制的生物地理优化算法及圆柱度 误差评定研究*

生物地理学优化算法(Biogeography-base optimization, BBO)是一种新型的智能算法,因其参数少、易于实现等优点而受到学界的广泛关注和研究,并显示出了广阔的应用前景。为了提高算法的优化性能,对BBO算法提出一种改进。改进的算法在将差分优化算法(Differential evolution, DE)中的局部搜索策略同BBO算法中的迁移策略相结合的基础上,针对迁移算子和变异算子分别做出改进,并通过基准函数的测试证明了改进后的算法在迭代过程中种群进化、寻优能力以及算法的收敛性能得到进一步提升。尝试将改进了的生物地理学优化算法应用于圆柱度误差评定。依据国家标准,结合最小区域法,以圆柱度误差数学模型为目标函数,该算法实现了误差评定优化求解。通过该寻优结果与其他方法的评定结果的比较,验证了该种算法的可行性和正确性及其优越性。     

基于ABC-BP神经网络的光纤传感器光强补偿北大核心CSCD

为了减少光纤传感器测量过程中接收光强受到非线性因素的影响,提出利用人工蜂群算法(artificial bee colony, ABC)优化反向传播神经网络(BPNN)进行光强补偿的方法。通过人工蜂群算法局部搜索最优的能力优化传统反向传播神经网络的权值与阈值,达到减少局部样本陷入极值的目的。将内圈与外圈2组接收光功率以及位移作为训练数据,优化神经网络各参数值,从而建立最优ABC-BP神经网络补偿模型。结果表明人工蜂群算法优化后平均绝对误差减少了0.001 114,均方根误差减少了0.001 182,参数值均小于传统反向传播神经网络和支持向量机补偿模型。对比实验证明该混合算法预测误差更小,能够更高精度完成光强补偿过程。     

智能圆度测量装置的推理机制的研制

为了在圆度测量中克服人工数据处理存在着效率低和准确性差的缺陷,需研制智能圆度测量装置,实现圆度误差的自动检测及评定。本文针对圆度误差的评定属求解非平凡问题的特点,提出采取推理和搜索的方法建立智能评定模块,并将它建成由规则集、综合数据库和控制系统构成的产生式系统。文中还根据评定圆度误差的最小包容区域法的原理,在对智能评定模块推理机制的研制中采用了穷举搜索的方法和深度优先的搜索策略,设计了数据处理中的算法——围点甄别法。文章最后以系统测试实例说明了该圆度测量装置具有真实数据自动采集和模拟数据人工输入之功能,能高效且准确地根据所获数据显示出圆度误差评定的最小包容区及其检测结果。     

并联机构位置正解的人工蜂群和牛顿组合算法

将智能优化算法与数值迭代方法有机组合,构造一种并联机构位置正解求解的通用算法——混合人工蜂群和Newton迭代(Hybrid artificial bee colony and Newton iteration,HABC-Newton)算法。将差分进化(Differential evolution,DE)算法融入人工蜂群(Artificial bee colony,ABC)算法,形成一种能快速收敛到问题近优解的混合人工蜂群(Hybrid ABC,HABC)算法,再以该近优解为初值,应用Newton-Шамарский迭代法求出高精度位置正解。以4自由度4-SPS-CU并联机构正运动学分析为例,阐述基于HABC-Newton算法的并联机构正运动学分析方法。为了验证算法的有效性和普适性,给出4-SPS-CU、3-RRR两种耦合并联机构位置正解的数值算例。结果表明,HABC-Newton算法能以较少计算开销求得并联机构的全部高精度位置正解。还比较了HABC-Newton、ABC、DE和粒子群算法求并联机构位置正解的性能,数值实验显示,HABC-Newton算法的精度、稳健性和计算效率高于对比算法。     

A method for axis straightness error evaluation based on improved artificial bee colony algorithm

An improved artificial bee colony (IABC) optimization algorithm for the accurate evaluation of minimum zone axis straightness error from a set of coordinate measurement data points was proposed. In the proposed algorithm, the opposition-based learning method was employed to produce initial population and scouts, the employed bees used greedy selection mechanism to update the best food source achieved so far one by one, and a new search mechanism inspired by differential evaluation was used for onlookers. The nonlinear mathematical model for axis straightness error evaluation and the fitness function of IABC were introduced in detail. Four classical test functions were selected in the experiments; the simulation results verified the feasibility of IABC algorithm. According to two practical examples, the results obtained by the IABC algorithm are more accurate and efficient than other conventional methods. It is a unified approach for other form and position error evaluations and is well suited for high-precision measuring equipments such as the CMM.     

An improved artificial bee colony algorithm for the blocking flowshop scheduling problem

This paper presents an improved artificial bee colony (IABC) algorithm for solving the blocking flowshop problem with the objective of minimizing makespan. The proposed IABC algorithm utilizes discrete job permutations to represent solutions and applies insert and swap operators to generate new solutions for the employed and onlooker bees. The differential evolution algorithm is employed to obtain solutions for the scout bees. An initialization scheme based on the problem-specific heuristics is presented to generate an initial population with a certain level of quality and diversity. A local search based on the insert neighborhood is embedded to improve the algorithm's local exploitation ability. The IABC is compared with the existing hybrid discrete differential evolution and discrete artificial bee colony algorithms based on the well-known flowshop benchmark of Taillard. The computational results and comparison demonstrate the superiority of the proposed IABC algorithm for the blocking flowshop scheduling problems with makespan criterion.     

无人机群对多目标执行多任务的协同规划方法

为了减少无人机群对多目标执行多项任务的航程,提高任务规划的稳定性,提出了基于保留潜力蜜源人工蜂群算法的协同任务规划方法( RPSABC 算法).建立了无人机群协同任务规划的约束条件和目标函数;分析了基本人工蜂群算法原理;提出了动态选择策略,观察蜂选择蜜源时兼顾优质蜜源和潜力蜜源,利于算法寻优;使用 Metropolis 准则改进蜜源选择策略,有利于算法跳出局部最优、保留潜在最优;基于以上改进,提出了保留潜力蜜源人工蜂群算法的无人机群协同任务规划方法.仿真验证结果表明:RPSABC算法收敛迭代次数比 ROABC 算法、 ABC 算法分别减少３１.９％ 、４０.４％ ;目标函数收敛均值分别下降了５.２％ 和１９.０％ ; RPSABC 算法的收敛值标准差最小,说明此算法稳定性最好.     

基于序列响应面法的汽车结构件蜂群优化设计

将蜂群算法应用于汽车结构件的优化问题。先由试验设计和序列响应面法构建目标函数及约束条件的代理模型,再应用改进的蜂群算法求解最优设计。在优化过程中调用的是代理模型,显著减少了有限元计算次数,提高了优化效率。最后,选取典型实例对该算法进行验证,比较预期值与实际值的结果表明,该算法具备了足够的求解精度,能够满足工程实际要求。     

MMSE design of nonlinear Volterra equalizers using artificial bee colony algorithm

In this paper a novel approach for channel equalization is presented, where a framework for Volterra system is used to model both the channel and the equalizer. We propose development of first-order and second-order Volterra equalizers using minimum mean square error (MMSE) approach and design these equalizers using swarm intelligence based stochastic optimization algorithm which is applied to adapt the equalizer coefficients to the time varying channel. This work proposes to use the artificial bee colony (ABC) algorithm, recently introduced for global optimization, simulating the intelligent foraging behavior of honey bee swarm in a simple, robust, and flexible manner. For comparative analysis, adaptive equalizers like least mean squares (LMSs) equalizer, recursive least squares (RLSs) equalizer and least mean p-Norm (LMP) equalizer and population based optimum equalizers employing PSO are also applied for identical problems and the superiority of the newly proposed algorithm is aptly demonstrated.     

基于并行策略的改进混合粒子群算法及其应用

针对粒子群算法在解决高维度复杂优化易陷入局部最优的问题,构建差分进化算法(DE)、人工蜂群算法(ABC)与粒子群算法(PSO)并行运算的种群更新模型,提出基于并行策略的改进混合粒子群算法(DA_PSO)。以并行策略为基础,不改变种群规模,独立运行3种算法,每隔n次比较3种算法,获得当前最优点,并用其替换粒子群算法的种群最优点,利用PSO算法个体向种群最优靠近的特点,充分吸收DE算法、ABC算法的优点,使被替换后的PSO算法跳出局部最优,提升优化结果的质量。采用五种类型测试函数分别对ABC、DE、PSO和DA_PSO进行对比验证,结果表明:较其他算法而言,DA_PSO算法精度高,稳定性好,适应性强。同时为验证所提方法的科学性与实用性,将其应用在10t~32t/31.5m系列化的桥式起重机主梁金属结构轻量化设计中。     

基于蜂群优化投影寻踪的高光谱小目标检测

为了进一步提高高光谱遥感图像小目标无监督检测方法的运算速度,并降低其虚警率,提出了一种基于改进蜂群优化投影寻踪与K最近邻的检测方法。首先,采用核主成分分析法对原始高光谱遥感图像进行降维;然后,提出以邻域像元联合定义峰度与偏度的方法,并将两者结合作为投影指标,再以改进后的蜂群算法作为寻优方法,使用投影寻踪从高光谱图像中逐层获取投影图像,再根据其直方图提取小目标;最后,利用线性判别分析进一步提取像元特征,并结合加权K最近邻方法对小目标的检测结果进行提纯。大量实验结果表明,与RX方法、独立分量分析法、混沌粒子群优化投影寻踪法相比,本文方法不但可以更精确地检测出高光谱遥感图像中的小目标,而且具有更快的运算速度。     

An improved artificial bee colony algorithm with MaxTF heuristic rule for two-sided assembly line balancing problem

Two-sided assembly line is usually used for the assembly of large products such as cars, buses, and trucks. With the development of technical progress, the assembly line needs to be reconfigured and the cycle time of the line should be optimized to satisfy the new assembly process. Two-sided assembly line balancing with the objective of minimizing the cycle time is called TALBP-2. This paper proposes an improved artificial bee colony (IABC) algorithm with the MaxTF heuristic rule. In the heuristic initialization process, the MaxTF rule defines a new task’s priority weight. On the basis of priority weight, the assignment of tasks is reasonable and the quality of an initial solution is high. In the IABC algorithm, two neighborhood strategies are embedded to balance the exploitation and exploration abilities of the algorithm. The employed bees and onlooker bees produce neighboring solutions in different promising regions to accelerate the convergence rate. Furthermore, a well-designed random strategy of scout bees is developed to escape local optima. The experimental results demonstrate that the proposed MaxTF rule performs better than other heuristic rules, as it can find the best solution for all the 10 test cases. A comparison of the IABC algorithm and other algorithms proves the effectiveness of the proposed IABC algorithm. The results also denote that the IABC algorithm is efficient and stable in minimizing the cycle time for the TALBP-2, and it can find 20 new best solutions among 25 large-sized problem cases.

     

最小二乘圆法评定圆度误差的优化算法

介绍了用最小二乘圆法评定圆度误差的准则。综合SWIFT法和混沌算法的优点,提出了改进的混沌优化算法,并通过对圆度误差测量数据处理的应用实例,说明了该优化算法的优点,从而达到全局最优。该优化算法也可推广应用于对其它测量误差的数据处理中。     

Discrete artificial bee colony algorithm for lot-streaming flowshop with total flowtime minimization

Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a number of smaller sub-lots and moving the completed portion of the sub-lots to downstream machine. In this way, the production is accelerated. This paper presents a discrete artificial bee colony (DABC) algorithm for a lot-streaming flowshop scheduling problem with total flowtime criterion. Unlike the basic ABC algorithm, the proposed DABC algorithm represents a solution as a discrete job permutation. An efficient initialization scheme based on the extended Nawaz-Enscore-Ham heuristic is utilized to produce an initial population with a certain level of quality and diversity. Employed and onlooker bees generate new solutions in their neighborhood, whereas scout bees generate new solutions by performing insert operator and swap operator to the best solution found so far. Moreover, a simple but effective local search is embedded in the algorithm to enhance local exploitation capability. A comparative experiment is carried out with the existing discrete particle swarm optimization, hybrid genetic algorithm, threshold accepting, simulated annealing and ant colony optimization algorithms based on a total of 160 randomly generated instances. The experimental results show that the proposed DABC algorithm is quite effective for the lot-streaming flowshop with total flowtime criterion in terms of searching quality, robustness and effectiveness. This research provides the references to the optimization research on lot-streaming flowshop.