Through studying several kinds of chaotic mappings' distributions of orbital points, we analyze the capabilityof the chaotic mutations based on these mappings. Nunerical experiments support our conclusions very we...Through studying several kinds of chaotic mappings' distributions of orbital points, we analyze the capabilityof the chaotic mutations based on these mappings. Nunerical experiments support our conclusions very well. Thecapability analysis also led to a self-adaptive mechanism of chaotic mutation. The introducing of the self-adaptivechaotic mutation can improve the performance of genetic algorithm very prominently.展开更多
A variable parameter self-adaptive control strategy based on driving condition identification is proposed to take full advantage of the fuel saving potential of the plug-in hybrid electric bus(PHEB).Firstly,the princi...A variable parameter self-adaptive control strategy based on driving condition identification is proposed to take full advantage of the fuel saving potential of the plug-in hybrid electric bus(PHEB).Firstly,the principal component analysis(PCA)and the fuzzy c-means clustering(FCM)algorithm is used to construct the comprehensive driving cycle,congestion driving cycle,urban driving cycle and suburban driving cycle of Chinese urban buses.Secondly,an improved particle swarm optimization(IPSO)algorithm is proposed,and is used to optimize the control parameters of PHEB under different driving cycles,respectively.Then,the variable parameter self-adaptive control strategy based on driving condition identification is given.Finally,for an actual running vehicle,the driving condition is identified by relevance vector machine(RVM),and the corresponding control parameters are selected to control the vehicle.The simulation results show that the fuel consumption of using the variable parameter self-adaptive control strategy is reduced by 4.2% compared with that of the fixed parameter control strategy,and the feasibility of the variable parameter self-adaptive control strategy is verified.展开更多
Through studying several kinds of chaotic mappings' distributions of orbital points, we analyze the capability of the chaotic mutations based on these mappings. Numerical experiments support our conclusions very w...Through studying several kinds of chaotic mappings' distributions of orbital points, we analyze the capability of the chaotic mutations based on these mappings. Numerical experiments support our conclusions very well. The capability analysis also led to a self-adaptive mechanism of chaotic mutation. The introducing of the self-adaptive chaotic mutation can improve the performance of genetic algorithm very prominently.展开更多
To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The se...To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.展开更多
To solve the problem of slow convergence and easy to get into the local optimum of the spider monkey optimization algorithm,this paper presents a new algorithm based on multi-strategy(ISMO).First,the initial populatio...To solve the problem of slow convergence and easy to get into the local optimum of the spider monkey optimization algorithm,this paper presents a new algorithm based on multi-strategy(ISMO).First,the initial population is generated by a refracted opposition-based learning strategy to enhance diversity and ergodicity.Second,this paper introduces a non-linear adaptive dynamic weight factor to improve convergence efficiency.Then,using the crisscross strategy,using the horizontal crossover to enhance the global search and vertical crossover to keep the diversity of the population to avoid being trapped in the local optimum.At last,we adopt a Gauss-Cauchy mutation strategy to improve the stability of the algorithm by mutation of the optimal individuals.Therefore,the application of ISMO is validated by ten benchmark functions and feature selection.It is proved that the proposed method can resolve the problem of feature selection.展开更多
针对混流装配线工序加工资源需求多样、工艺复杂、装配工期长等问题,采用Petri网和改进遗传算法对该问题进行优化求解。建立混流装配线赋时库所Petri网(timed place Petri net, TPPN)调度模型,基于模型激发序列,采用基于工序的编码方式...针对混流装配线工序加工资源需求多样、工艺复杂、装配工期长等问题,采用Petri网和改进遗传算法对该问题进行优化求解。建立混流装配线赋时库所Petri网(timed place Petri net, TPPN)调度模型,基于模型激发序列,采用基于工序的编码方式进行染色体编码;采用精英保留策略选择优异个体,改进遗传算法的交叉、变异操作,用改进后的遗传算法求解混流装配线调度问题。通过对比案例及实例数据计算结果验证了方案的有效性。展开更多
针对传统最大似然波达方向(maximum likelihood direction of arrival,ML-DOA)估计存在计算量大、估计精度差等问题,本文提出一种采用改进帝王蝶优化算法(improved monarch butterfly optimization algorithm,IMBO)的ML-DOA估计方法。I...针对传统最大似然波达方向(maximum likelihood direction of arrival,ML-DOA)估计存在计算量大、估计精度差等问题,本文提出一种采用改进帝王蝶优化算法(improved monarch butterfly optimization algorithm,IMBO)的ML-DOA估计方法。IMBO算法通过精英反向学习策略对初始帝王蝶种群进行优化,得到适应度值较优的初始帝王蝶个体,进而能够改善帝王蝶种群的多样性;引入差分进化算法启发的变异操作以及自适应策略对帝王蝶个体的寻优方式进行改进,扩大了算法的搜索空间;引入了高斯-柯西变异算子,自适应调整变异步长,避免算法陷入局部最优。将IMBO应用于ML-DOA,实验表明,与传统的DOA估计算法相比,在不同信源数目、信噪比以及种群数量下,本文提出的算法收敛性能更好,均方根误差更低,运算量更小。展开更多
针对蝴蝶优化算法(butterfly optimization algorithm,BOA)易陷入局部最优,且收敛速度慢和寻优精度低等问题,提出了一种趋优变异反向学习的樽海鞘群与蝴蝶混合优化算法(hybrid optimization algorithm for salp swarm and butterfly wit...针对蝴蝶优化算法(butterfly optimization algorithm,BOA)易陷入局部最优,且收敛速度慢和寻优精度低等问题,提出了一种趋优变异反向学习的樽海鞘群与蝴蝶混合优化算法(hybrid optimization algorithm for salp swarm and butterfly with reverse mutation towards optimization learning,OMSSBOA)。引入柯西变异对最优蝴蝶个体进行扰动,避免算法陷入局部最优;将改进的樽海鞘群优化算法(salp swarm algorithm,SSA)嵌入到BOA,平衡算法全局勘探和局部开采的比重,进而提高算法收敛速度;利用趋优变异反向学习策略扩大算法搜索范围并提升解的质量,进而提高算法的寻优精度。将改进算法在10种基准测试函数上进行仿真实验,结果表明,改进算法具有较好的寻优性能和鲁棒性。展开更多
基金The project supported by National Natural Science Foundation of China under Grant No. 60074020
文摘Through studying several kinds of chaotic mappings' distributions of orbital points, we analyze the capabilityof the chaotic mutations based on these mappings. Nunerical experiments support our conclusions very well. Thecapability analysis also led to a self-adaptive mechanism of chaotic mutation. The introducing of the self-adaptivechaotic mutation can improve the performance of genetic algorithm very prominently.
基金Supported by China Automobile Test Cycle Development Project(CATC2015)
文摘A variable parameter self-adaptive control strategy based on driving condition identification is proposed to take full advantage of the fuel saving potential of the plug-in hybrid electric bus(PHEB).Firstly,the principal component analysis(PCA)and the fuzzy c-means clustering(FCM)algorithm is used to construct the comprehensive driving cycle,congestion driving cycle,urban driving cycle and suburban driving cycle of Chinese urban buses.Secondly,an improved particle swarm optimization(IPSO)algorithm is proposed,and is used to optimize the control parameters of PHEB under different driving cycles,respectively.Then,the variable parameter self-adaptive control strategy based on driving condition identification is given.Finally,for an actual running vehicle,the driving condition is identified by relevance vector machine(RVM),and the corresponding control parameters are selected to control the vehicle.The simulation results show that the fuel consumption of using the variable parameter self-adaptive control strategy is reduced by 4.2% compared with that of the fixed parameter control strategy,and the feasibility of the variable parameter self-adaptive control strategy is verified.
文摘Through studying several kinds of chaotic mappings' distributions of orbital points, we analyze the capability of the chaotic mutations based on these mappings. Numerical experiments support our conclusions very well. The capability analysis also led to a self-adaptive mechanism of chaotic mutation. The introducing of the self-adaptive chaotic mutation can improve the performance of genetic algorithm very prominently.
文摘To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.
文摘To solve the problem of slow convergence and easy to get into the local optimum of the spider monkey optimization algorithm,this paper presents a new algorithm based on multi-strategy(ISMO).First,the initial population is generated by a refracted opposition-based learning strategy to enhance diversity and ergodicity.Second,this paper introduces a non-linear adaptive dynamic weight factor to improve convergence efficiency.Then,using the crisscross strategy,using the horizontal crossover to enhance the global search and vertical crossover to keep the diversity of the population to avoid being trapped in the local optimum.At last,we adopt a Gauss-Cauchy mutation strategy to improve the stability of the algorithm by mutation of the optimal individuals.Therefore,the application of ISMO is validated by ten benchmark functions and feature selection.It is proved that the proposed method can resolve the problem of feature selection.
文摘针对混流装配线工序加工资源需求多样、工艺复杂、装配工期长等问题,采用Petri网和改进遗传算法对该问题进行优化求解。建立混流装配线赋时库所Petri网(timed place Petri net, TPPN)调度模型,基于模型激发序列,采用基于工序的编码方式进行染色体编码;采用精英保留策略选择优异个体,改进遗传算法的交叉、变异操作,用改进后的遗传算法求解混流装配线调度问题。通过对比案例及实例数据计算结果验证了方案的有效性。
文摘针对传统最大似然波达方向(maximum likelihood direction of arrival,ML-DOA)估计存在计算量大、估计精度差等问题,本文提出一种采用改进帝王蝶优化算法(improved monarch butterfly optimization algorithm,IMBO)的ML-DOA估计方法。IMBO算法通过精英反向学习策略对初始帝王蝶种群进行优化,得到适应度值较优的初始帝王蝶个体,进而能够改善帝王蝶种群的多样性;引入差分进化算法启发的变异操作以及自适应策略对帝王蝶个体的寻优方式进行改进,扩大了算法的搜索空间;引入了高斯-柯西变异算子,自适应调整变异步长,避免算法陷入局部最优。将IMBO应用于ML-DOA,实验表明,与传统的DOA估计算法相比,在不同信源数目、信噪比以及种群数量下,本文提出的算法收敛性能更好,均方根误差更低,运算量更小。
文摘针对蝴蝶优化算法(butterfly optimization algorithm,BOA)易陷入局部最优,且收敛速度慢和寻优精度低等问题,提出了一种趋优变异反向学习的樽海鞘群与蝴蝶混合优化算法(hybrid optimization algorithm for salp swarm and butterfly with reverse mutation towards optimization learning,OMSSBOA)。引入柯西变异对最优蝴蝶个体进行扰动,避免算法陷入局部最优;将改进的樽海鞘群优化算法(salp swarm algorithm,SSA)嵌入到BOA,平衡算法全局勘探和局部开采的比重,进而提高算法收敛速度;利用趋优变异反向学习策略扩大算法搜索范围并提升解的质量,进而提高算法的寻优精度。将改进算法在10种基准测试函数上进行仿真实验,结果表明,改进算法具有较好的寻优性能和鲁棒性。
