改进麻雀搜索算法求解作业车间调度问题

针对最小化完工时间的作业车间调度问题(JSP),提出改进麻雀搜索算法(ISSA).首先设计有效的编码转换方式,形成JSP离散决策空间与麻雀搜索算法(SSA)连续搜索空间的对应关系.然后,针对SSA在求解后期易陷入局部最优,利用量子计算、正余弦搜索和警戒者数量递减策略对SSA进行改进,同时引入多邻域搜索和高斯扰动策略以弥补SSA在求解离散问题时深度发掘能力不足的弊端.最后,进行FT、LA系列10个测试问题、6种算法和2个应用实例的对比实验.结果表明,ISSA在求解JSP时,能获得更好的最小值、平均值和寻优成功率,验证了ISSA求解JSP的有效性.     

基于布谷鸟搜索优化神经网络的锂电池荷电状态预测

锂电池荷电状态(SOC)的预测是电动汽车锂电池管理系统中最为关键的技术之一;为实现对SOC的高精度的预测,提岀了一种基于布谷鸟搜索算法(CS)优化的误差反向传播(BP)神经网络的锂电池SOC预测方法,该方法的核心难点之一,在于优化BP神经网络的初始权值和阈值,从而可以改善易陷入局部最优的情况,减小算法对初始值的依赖;Matlab仿真结果表明,CS—BP神经网络算法的均方根误差值比BP算法的均方根误差值平均降低了0.010 6,CS—BP算法具有更高的预测精度和极强的泛化性能.     

一种带有时滞和脉冲的捕食系统的性态分析

对一类具脉冲效应的依比率依赖的时滞捕食系统进行了讨论.首先,对系统中食饵绝解的有界性进行了分析.进一步,利用微分比较定理讨论了系统的永久持续生存和灭绝,得到了系统的永久持续生存和灭绝的条件.     

A hybrid cuckoo search algorithm with feasibility-based rule for constrained structural optimization

Constrained optimization problems are very important as they are encountered in many science and engineering applications. As a novel evolutionary computation technique, cuckoo search （CS） algorithm has attracted much attention and wide applications, owing to its easy implementation and quick convergence. A hybrid cuckoo pattern search algorithm （HCPS） with feasibility-based rule is proposed for solving constrained numerical and engineering design optimization problems. This algorithm can combine the stochastic exploration of the cuckoo search algorithm and the exploitation capability of the pattern search method. Simulation and comparisons based on several well-known benchmark test functions and structural design optimization problems demonstrate the effectiveness, efficiency and robustness of the proposed HCPS algorithm.     

封闭域UCT算法的实现及其性能测试

UCT算法在9×9棋盘上的水平,已经接近最优秀的专业棋手,但在19×19棋盘上还不尽人意.一种可能的改进是用多个并行的局部UCT搜索来替代全局UCT搜索,以期用同样的计算资源来达到更深的有效搜索深度.本文力图沿着此研究思路做一些初步的尝试.我们通过改写Fuego的全局UCT搜索算法,本文实现了封闭域UCT搜索算法,并在64个封闭域围棋死活问题上进行了测试.初步结果表明,封闭域UCT算法能够在不使用任何领域知识的情况下,把给定问题的初始分支系数从5~16降低到2.3以下.从正确率和速度两项指标来看,多个并行的局部UCT搜索的研究思路具备可行性.     

基于模糊熵与CS-ELM的供输弹系统早期故障识别北大核心

针对供输弹系统早期采集的信号中成分复杂,故障特征难以提取和识别的问题,提出一种基于模糊熵与布谷鸟改进的极限学习机(CS-ELM)的供输弹系统早期故障预示方法。运用改进的可调品质因子小波变换对信号进行滤波降噪,提取各子带信号的模糊熵特征;选取模糊熵值较大的5个子带进行重构,完成降噪并将其模糊熵组成特征向量;运用CS-ELM对所提取的特征向量进行早期故障预示并与ELM的诊断结果进行对比。试验结果验证了该方法的有效性,其预示准确率达90.7%。     

基于云计算的混合并行遗传算法求解最短路径

为提高最短路径求解问题的效率,提出一种基于云计算的细粒度混合并行遗传算法求解最短路径的方法。方法采用云计算中H adoop的Map Reduce并行编程模型,提高编码效率,同时将细粒度并行遗传算法和禁忌搜索算法结合,提高了寻优算法的计算速度和局部寻优能力,进而提高最短路径的求解效率。仿真结果表明,该方法在计算速度和性能上优于经典遗传算法和并行遗传算法,是一种有效的最短路径求解方法。     

Tabu search algorithm combined with global perturbation for packing arbitrary sized circles into a circular container

The arbitrary sized circle packing problem （ACP） is concerned about how to pack a number of arbitrary sized circles into a smallest possible circular container without overlapping. As a classical NP-hard problem, ACP is theoretically important and is often encountered in practical applications. Based on the already existing Quasi-physical method, this paper proposes a hybrid algorithm named GP-TS which combines tabu search with global perturbation to solve the two-dimensional ACP. The Quasi-physical method is a continuous optimization method which is used to obtain a local optimal configuration from any initial configuration. The tabu search procedure iteratively updates the incumbent configuration with its best neighboring configuration according to some forbidden rule and aspiration criterion. If the configuration obtained by the tabu search procedure does not satisfy the constraints, the global perturbation operator is subsequently applied in order that the search jumps out of the current local optimum without destroying the incumbent configuration too much. After that, the tabu search procedure is launched again. GP-TS is performed by repeating this process until the stop criterion is met. Computational experiments based on 3 sets of representative instances show that GP-TS can improve many best known results within reasonable time.     

用于迷宫电脑鼠的一种迷宫补全算法

摘要：在IEEE电脑鼠走迷宫竞赛规则的基础上,介绍了一种基于对迷宫分析补全思想的路径规划算法。详细阐述了算法流程和实现过程,对搜索过程中的算法提出一种改进思想。实验表明,该算法可以提高电脑鼠的搜索效率,有效地减少迷宫搜索时间,提高竞赛成绩。     

基于大训练样本集的ε-SVR改进算法研究

在改进算法的研究中,从大训练样本集中进行样本抽样是构建大样本支持向量回归机的重要手段.根据ε-SVR支持向量分布的特有属性和支持向量逐步回归机算法求解ε-SVR的缺陷,为改善训练时间,优化收敛性,从大训练样本集中抽取的小样本集的ε-SVR超平面出发,通过计算大训练样本集样本点距近似超平面距离d,剔除大训练样本集中在ε≤d≤dmax外的训练样本点,逐步搜索SVs,建立大训练样本集ε-SVR.提出了构建大训练样本集ε-SVR的逐步搜索算法,理论分析和仿真实验验证了搜索算法的收敛性和有效性.