论文部分内容阅读
针对竞争选址问题,提出一种新的混合和声搜索算法.混合和声搜索算法初始化和声记忆库时结合了贪婪算法,降低了初始解的不可行性概率.在寻优过程中,引入了鱼群算法的觅食行为,提高了算法跳出局部最优解的能力和收敛速度.即兴产生一个新的和声时,充分考虑了当前最优解的指导作用,提出了新的基因调整方法,增强了算法的探索能力.在竞争选址问题上对所提出的算法进行了测试,仿真结果验证了所提出算法的有效性.
Aiming at the problem of competitive location, a new hybrid harmony search algorithm is proposed.However, the hybrid harmony search algorithm combines the greedy algorithm to initialize the harmony memory and reduces the probability of infeasibility of the initial solution.In the optimization process, The foraging behavior of fish swarm algorithm is improved and the ability and convergence rate of the algorithm to jump out of the local optimal solution are improved.When a new harmony is improvised, the guidance of the current optimal solution is fully considered and a new gene adjustment method , Which enhances the exploration ability of the algorithm.The proposed algorithm is tested on the competition location problem, and the simulation results verify the effectiveness of the proposed algorithm.