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

摘要

For solving combinational optimization problems, a Binary Harmony Search Algorithm (BHSA) based on three discrete operators of Harmony Search Algorithm ( HAS) was proposed. Then, BHSA was used to solve the famous fc-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.%为了能够应用和声搜索算法(HSA)求解组合优化问题,基于HAS的三种操作的离散化实现提出了一种二进制和声搜索算法(BHSA),并将BHSA用于求解著名的k-可满足性(k-SAT)问题和0-1背包问题,通过与粒子群优化( BPSO)和遗传算法(GA)的实例计算对比验证了新算法的可行性与有效性.