基于混合和声搜索算法求解竞争选址问题  

Hybrid harmony search algorithm for competitive location problem

作　　者：于宏涛[1,2] 高立群[1] 吕勇军[2] 

机构地区：[1]东北大学信息科学与工程学院,沈阳110819 [2]沈阳工程学院自动控制工程系,沈阳110136

出　　处：《控制与决策》2013年第7期1083-1086,1093,共5页Control and Decision

基　　金：国家自然科学基金项目(60674021)

摘　　要：针对竞争选址问题,提出一种新的混合和声搜索算法.混合和声搜索算法初始化和声记忆库时结合了贪婪算法,降低了初始解的不可行性概率.在寻优过程中,引入了鱼群算法的觅食行为,提高了算法跳出局部最优解的能力和收敛速度.即兴产生一个新的和声时,充分考虑了当前最优解的指导作用,提出了新的基因调整方法,增强了算法的探索能力.在竞争选址问题上对所提出的算法进行了测试,仿真结果验证了所提出算法的有效性.A novel hybrid harmony search（HHS） algorithm is proposed for the competitive location problem.The greedy algorithm is used for initializing the harmony memory of harmony search（HS） algorithm,which can reduce the probability of the initial infeasible solution.During the search,the artificial fish-warm prey behavior is introduced into the HS algorithm so as to enhance the ability of escaping from local optimal solution and accelerate the converge speed of the algorithm.Moreover,the current optimal solution is considered when the new harmony is improvised,and a new pitch-adjusted method is presented in order to enhance the exploration ability.Experiments are carried out on typical competitive location problems.Simulation shows the effectiveness of the proposed algorithm.

关 键 词：竞争选址 和声搜索算法 贪婪算法 人工鱼群算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]