基于和声搜索算法求解组合优化问题.docVIP

基于和声搜索算法求解组合优化问题 摘要:为了能够应用和声搜索算法（hsa）求解组合优化问题，基于has的三种操作的离散化实现提出了一种二进制和声搜索算法(bhsa)，并将bhsa用于求解著名的k.可满足性(k.sat)问题和0.1背包问题，通过与粒子群优化（bpso）和遗传算法（ga）的实例计算对比验证了新算法的可行性与有效性。 关键词:进化算法；二进制和声搜索；组合优化；k.sat问题；0.1背包问题  solving combinational optimization problems based on harmony search algorithm li ning1*, liu jian.qin 2, he yi.chao 1 ( 1. school of information engineering, shijiazhuang university of economics, shijiazhuang hebei 050031, china； 2. department of international education, shijiazhuang information engineering vocational college, shijiazhuang hebei 050035, china abstract: for solving combinational optimization problems, proposed a binary harmony search algorithm (bhsa) based on three discrete operators of harmony search algorithm （hsa）. then, use bhsa to solve the famous k-sat problem and 0-1 knapsack problem. the numeral results of bhsa, binary particle swarm optimization （bpso） and genetic algorithm (ga) show that the bhsa is feasible and high efficient. for solving combinational optimization problems, a binary harmony search algorithm (bhsa) based on three discrete operators of harmony search algorithm （hsa）was proposed. then, bhsa was used to solve the famous k.sat problem and 0.1 knapsack problem. the numeral results of bhsa, binary particle swarm optimization （bpso） and genetic algorithm (ga) show that the bhsa is feasible and highly efficient. key words: evolutionary algorithm; binary harmony search; combinational optimization; k.sat problem; 0.1 knapsack problem (kp)  0 引言 当前，演化计算领域新算法不断涌现，继遗传算法(genetic algorithm, ga)［1］、蚁群优化(ant colony optimization,aco)［2］、粒子群优化(particle swarm optimization, pso)［3］和差分演化(differential evolution, de)［4］之后，又先后出现了混合蛙跳算法(shuffled frog.leaping algorithm,sfla)［5,6］、萤火虫算法(firefly algorithm, fa)［7］与和声搜索算法(harmony search algorithm, hsa)［8］等多种新型进化算法。其中，hsa是由geem等［8］于2001年提出的一种新型进化算法，已被应用于求解数值优化问题、流水线调度问题和结构工程优化问题［8-13］。为了能够应用hsa求解具有二进制编码的组合最优化问题，本文提出了一种二进制和声搜索算法(binary harmony search algorithm,bhsa)，并利用b