Abstract
和声搜索算法是新近问世的一种启发式全局搜索算法，在许多组合优化问题中得到了成功应用。在有关问题上展示了较遗传算法、模拟退火算法和禁忌搜索更好的性能。但是，和声搜索算法在迭代时容易陷入局部搜索的状态，本文针对这一问题，对生成初始解向量进行了改进，对更新和声记忆库进行了改进。从而提高了算法的执行效率，避免算法陷入局部最优。 Harmony search algorithm is a new heuristic global search algorithm, which has been successfully applied in many combinatorial optimization problems. The better performance of genetic algorithm, simulated annealing algorithm and tabu search is demonstrated on the problem. However, the harmony search algorithm is easy to fall into local search. This paper makes an improvement on the generation of the initial solution vector and the harmony bank so as to improve the efficiency of the algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
