基于EDGA的托包机构优化设计

提出了在包装机械设计中求解多参数问题的遗传算法，讨论了遗传算法中求解多参数问题的关键技术，包括一种改进的遗传算法，避免了标准遗传算法可能过早地收敛于局部最优解，并加快了全局最优解的收敛速度，给出了在凸轮连杆机构中求解多参数问题的实例。该遗传算法可以有效地解决设计中存在多个参数的优化组合问题。     

基于跳点搜索-遗传算法的自主移动机器人路径规划

为了解决采用遗传算法解析最优路径中存在的转折点较多、易陷入局部最优解、迭代次数较多以及寻优时间过长等问题，引入自适应交叉算子和变异算子，将改进后的跳点搜索（jump point search）算法与改进遗传算法融合，得到跳点搜索-遗传（jump point search-genetic,JPSG）算法。JPSG算法利用JPS算法的高效局部搜索能力来提高整体搜索能力，加速算法整体收敛趋势；利用改进遗传算法的全局搜索能力改变JPS算法不能在复杂障碍物状况下解析最优路径的状态，提高算法对动态环境的适应性。在栅格矩阵中的路径规划仿真表明，相比于改进遗传算法、传统遗传算法，JPSG算法可以有效缩短寻优执行时间，提高寻优准确率，减少运算执行次数，在稳定性、准确性、快速性上具有明显的优势。     

求解约束优化问题的退火遗传算法

针对基于罚函数遗传算法求解实际约束优化问题的困难与缺点,提出了求解约束优化问题的退火遗传算法。对种群中的个体定义了不可行度,并设计退火遗传选择操作。算法分三阶段进行,首先用退火算法搜索产生初始种群体,随后利用遗传算法使搜索逐渐收敛于可行的全局最优解或较优解,最后用退火优化算法对解进行局部优化。两个典型的仿真例子计算结果证明该算法能极大地提高计算稳定性和精度。     

基于改进遗传算法的图像分割技术

提出一种基于遗传算法的进化类图像分割方法。遗传算法是一种全局搜索的算法,但是它在解决多峰复杂问题的时候会出现局部收敛的现象,出现这个现象的主要原因在于在搜索空间中群体多样性的降低导致了搜索的停滞。基于这个原因,提出一种改进的遗传算法,改进的方法通过控制遗传算法的变异概率来平衡群体的多样性程度,改进后的方法能够在解决多峰复杂问题中较多的搜索到全局解的区域。通过将改进的算法应用于图像分割的实例验证了改进算法的有效性以及算法在收敛速度及求解成功率上的优势。     

一种基于遗传算法的盲分离方法

1引言 目前的盲信号分离(Blind Source Separation)方法大多是建立在一定的神经网络模型基础上的.遗传算法作为一种并行、全局的最优搜索算法,可以为分离网络连接权值的训练提供快速性和全局性保证.本文提出了遗传算法的一种改进形式,在个体进化过程中引入基于信息理论的自然梯度学习规则,旨在加强遗传算法对局部最优解的搜索能力.对实录语音信号的分离仿真实验表明了该改进算法可以有效地提高收敛速度.     

一种改进的广义遗传算法及其在结构动力优化问题中的应用

该文提出了一种改进的广义遗传算法。算法中引入了异种机制以提高种群的多样性,在保证收敛速度的同时防止早熟收敛。该方法应用于随机风载荷作用下有应力约束的多参数结构动力响应优化问题,数值算例表明:异种机制能够有效地提高广义遗传算法收敛于全局最优解的概率并加快收敛速度;带有异种机制的广义遗传算法能够有效地求解复杂的结构动力优化问题。     

一种实数遗传算法及其在雷达成像中的应用

提出了一种由含实数域结构和目标函数信息的实数交叉和变异算子构成的实数遗传算法，并将其用于解决最大似然多散射点定位雷达成像问题。数字仪真结果表明，对非线性实变量函数优化问题，实数遗传算法在搜索全局最优解的收敛速度和精度等方面均能得到较理想的结果。     

基于融合禁忌搜索粒子群算法的配电网无功优化

从数学角度分析,配电网无功优化是一个非线性、多变量、多约束的混合规划问题。粒子群优化搜索算法被广泛应用于求解配电网无功优化问题。由于粒子群算法粒子群在进化过程易趋向同一化,失去多样性,从而使算法陷入局部最优解。本文在分析配电网无功优化的特性基础上,提出一种改进的紧融合禁忌搜索-粒子群算法用于配电网无功优化问题的求解。通过将禁忌搜索功能融合到粒子历史最优解和全局最优解寻优过程中,避免了粒子群算法寻优过程中出现的局部最优问题,从而提高粒子群算法的全局搜索能力。通过IEEE14节点系统的仿真计算结果表明,改进的算法能取得良好的效果。     

桁架结构优化设计的遗传算法

本文提出了桁架结构系统优化设计的新方法遗传算法，它不同于常规优化算法的特点在于，从多个初始点开始寻优，并采用交迭和变异算子避免过早地收敛到局部最优解，可获得全局最优解，且不受初始值影响。     

基于混合粒子群算法的物流配送路径优化问题研究

针对物流配送路径优化问题,提出了一种融合Powell局部寻优算法和模拟退火算法的混合粒子群算法,以克服单用粒子群算法求解问题早熟收敛的不足,增加算法的开发能力,提高算法的全局搜索能力,并进行了实验计算.计算结果表明,用混合粒子群算法求解物流配送路径优化问题,可以在一定程度上提高粒子群算法在局部搜索能力和搜索全局最优解概率,从而得到质量较高的解.     

An Improved Whale Optimization Algorithm for Feature Selection

Whale optimization algorithm (WOA) is a new population-based metaheuristic algorithm. WOA uses shrinking encircling mechanism, spiral rise, and random learning strategies to update whale’s positions. WOA has merit in terms of simple calculation and high computational accuracy, but its convergence speed is slow and it is easy to fall into the local optimal solution. In order to overcome the shortcomings, this paper integrates adaptive neighborhood and hybrid mutation strategies into whale optimization algorithms, designs the average distance from itself to other whales as an adaptive neighborhood radius, and chooses to learn from the optimal solution in the neighborhood instead of random learning strategies. The hybrid mutation strategy is used to enhance the ability of algorithm to jump out of the local optimal solution. A new whale optimization algorithm (HMNWOA) is proposed. The proposed algorithm inherits the global search capability of the original algorithm, enhances the exploitation ability, improves the quality of the population, and thus improves the convergence speed of the algorithm. A feature selection algorithm based on binary HMNWOA is proposed. Twelve standard datasets from UCI repository test the validity of the proposed algorithm for feature selection. The experimental results show that HMNWOA is very competitive compared to the other six popular feature selection methods in improving the classification accuracy and reducing the number of features, and ensures that HMNWOA has strong search ability in the search feature space.     

求解约束优化问题的改进布谷鸟搜索算法

为了提高约束优化问题的求解精度和收敛速度,提出求解约束优化问题的改进布谷鸟搜索算法。首先分析了基本布谷鸟搜索算法全局搜索和局部搜索过程中的不足,对其中全局搜索和局部搜索迭代公式进行重新定义,然后以一定概率在最优解附近进行搜索。对12个标准约束优化问题和4个工程约束优化问题进行测试并与多种算法进行对比,实验结果和统计分析表明所提算法在求解约束优化问题上具有较强的优越性。     

An improved hybrid self-inertia weight adaptive particle swarm optimization algorithm with local search

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.     

基于随机权重粒子群和K-均值聚类的图像分割

K-均值聚类具有简单、快速的特点,因此被广泛应用于图像分割领域.但K-均值聚类容易陷入局部最优,影响图像分割效果.针对K-均值的缺点,提出一种基于随机权重粒子群优化（RWPSO）和K-均值聚类的图像分割算法RWPSOK.在算法运行初期,利用随机权重粒子群优化的全局搜索能力,避免算法陷入局部最优;在算法运行后期,利用K-均值聚类的局部搜索能力,实现算法快速收敛.实验表明：RWPSOK算法能有效地克服K-均值聚类易陷入局部最优的缺点,图像分割效果得到了明显改善;与传统粒子群与K-均值聚类混合算法（PSOK）相比,RWPSOK算法具有更好的分割效果和更高的分割效率.     

Speed Control of Motor Based on Improved Glowworm Swarm Optimization

To better regulate the speed of brushless DC motors, an improved algorithm based on the original Glowworm Swarm Optimization is proposed. The proposed algorithm solves the problems of poor robustness, slow convergence, and low accuracy exhibited by traditional PID controllers. When selecting the glowworm neighborhood set, an optimization scheme based on the growth and competition behavior of weeds is applied to a single glowworm to prevent falling into a local optimal solution. After the glowworm’s position is updated, the league selection operator is introduced to search for the global optimal solution. Combining the local search ability of the invasive weed optimization with the global search ability of the league selection operator enhances the robustness of the algorithm and also accelerates the convergence speed of the algorithm. The mathematical model of the brushless DC motor is established, the PID parameters are tuned and optimized using improved Glowworm Swarm Optimization algorithm, and the speed of the brushless DC motor is adjusted. In a Simulink environment, a double closed-loop speed control model was established to simulate the speed control of a brushless DC motor, and this simulation was compared with a traditional PID control. The simulation results show that the model based on the improved Glowworm Swarm Optimization algorithm has good robustness and a steady-state response speed for motor speed control.     

基于HCGA的三坐标测量路径优化

针对传统遗传算法(GA)进行三坐标测量路径优化时收敛速度慢且过早收敛的问题,提出基于爬山遗传算法(HCGA)的三坐标测量路径优化方法。根据三坐标测量路径优化的数学模型,构造适合于测量路径优化问题的遗传编码、初始种群、选择、交叉、变异等参数,通过增加爬山操作,加快GA的迭代收敛速度。仿真实验结果表明,基于HCGA的三坐标测量路径优化方法能有效提高局部寻优能力与收敛速度,可获得很好的最优解并提高了测量效率。     

基于AHP-TOPSIS的可持续包装设计最优方案的筛选

目的 针对基本灰狼算法在函数优化过程中精度低、收敛速度慢、局部搜索能力差等问题,提出一种基于收敛因子和权重动态变化的自适应灰狼优化算法。方法 为了平衡算法的全局和局部搜索能力,引入聚焦距离变化率来动态调整收敛因子;使用自适应权重因子来改变算法的位置更新公式,以提高算法的收敛速度和精度。结果 仿真实验结果表明,改进后的算法在收敛精度和速度上都有了显著的提升,并且克服了灰狼算法在处理多峰函数时易陷入局部最优的缺点;对于纸浆浓度控制系统,控制效果更加理想。结论 通过改进的灰狼算法对PID控制器参数进行整定,可以显著提高系统的控制精度和其他性能指标,能更好地满足实际应用的要求。     

多根非线性方程组求解的探路者灰狼算法

针对传统算法在多根非线性方程组求解时依赖初始值的选定,求解个数不完全,求解精度不高的问题,提出了一种结合探路者算法的灰狼优化算法 (PGWO)。由于灰狼优化算法存在后期收敛速度慢等问题,结合了探路者算法,根据探路者中跟随者的更新机制对灰狼个体的位置进行改变,进而平衡算法的全局搜索和局部搜索能力。通过 9 组多根非线性方程组的仿真实验结果和其他群智能算法进行比较,实验结果表明 PGWO 算法提高了多根非线性方程组求解的精度,在求解个数上得到明显提升,进而说明了算法的有效性。     

A problem space algorithm for single machine weighted tardiness problems

We propose a problem space genetic algorithm to solve single machine total weighted tardiness scheduling problems. The proposed algorithm utilizes global and time-dependent local dominance rules to improve the neighborhood structure of the search space. They are also a powerful exploitation (intensifying) tool since the global optimum is one of the local optimum solutions. Furthermore, the problem space search method significantly enhances the exploration (diversification) capability of the genetic algorithm. In summary, we can improve both solution quality and robustness over the other local search algorithms reported in the literature.