基于混合策略的蝙蝠算法的研究-软件工程专业论文.docxVIP

来，包含蝙蝠算法的标准速度和位置的更新规则，同时结合遗传算法的选 来，包含蝙蝠算法的标准速度和位置的更新规则，同时结合遗传算法的选 择、交叉、变异的思想。算法融合过程中提出一种基于蝙蝠算法速度矢量 的交叉算子，该算子能够动态调整种群，避免出现早熟收敛。测试实验表 明这样不仅增加种群多样性，使个体跳出局部最优解，避免早熟收敛，又 在加快种群收敛全局最优解的速度方面取得不错效果。 (2)针对粒子群优化算法(Particles Swarm Optimization，PSO)中的惯性权 重对算法搜索能力的影响，将惯性权重概念引入蝙蝠算法。通过研究自组 织临界(Self-Organized Criticality,soc)理论中的Bak．Sneppen模型(BS模 型，生物演化模型)，提出一种基于BS模型的改变惯性权重策略的蝙蝠算 法。通过实验测试表明，此新提出的算法模型在很大程度上提高了原算法 的搜索能力，使收敛速度和精度提高明显。 (3)将改进的蝙蝠算法应用到求解O—l背包问题中。针对此类问题的特 点，将基本蝙蝠算法进行二进制改造。此外，通过修改蝙蝠个体位置的更 新公式，使算法优化过程更加符合0一I背包问题的求解。最后经MATLAB 仿真平台进行计算测试，得到最优目标值。 关键词：蝙蝠算法遗传算子惯性权重Bak-Sneppen模型0-1背包问 题 万方数据 BAT BAT ALGORITHM RESEARCH BASED oN HYBRID STRATEGY ABSTRACT Bat algorithm(BA)is one of novel metaheuristic algorithms introduced by Yang Xin-She，who is a professor in Cambridge University,in 20 1 0．Yang proposed this algorithm inspired by predation and echolocation behavior of micro—bat．Not only the BA has a simple structure，less parameter,robustness， but also it is easy to understand and program implement．In recently，more and more researchers are interested in the algorithm，which has made it gradually be one of popular research branches of swarm intelligence and intelligent optimization algorithms．It is a fresh algorithm，after all，it may has more or less defects，such as，easily trapped into local optimal solution，low convergence speed，etc．Largely,they limit the application of the algorithm．So aiming at the shortcoming，some improved strategies will be proposed in this thesis，so as to increase optimization efficiency． 0—1 Knapsack Problem(0—1 KP)is classic combinatorial optimization problem．It is widely used in many fields in actual life，such as，budget control， loading problem，project selection，investment problem，etc．It is also study as sub-problem．From foregone literatures，the method of solving O一1 KP is divided into accurate algorithm and heuristic algorithm．Because of computing 川 万方数据 complexity,the complexity,the large—scale problem cannot be solved with accurate algorithm．In that ca