作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (12): 149-151. doi: 10.3969/j.issn.1000-3428.2012.12.044

• 人工智能及识别技术 • 上一篇    下一篇

混合编码和声搜索算法在动态优化中的应用

李 宁1,贺毅朝1,田海燕2   

  1. (1. 石家庄经济学院信息工程系,石家庄 050031;2. 河北师范大学数学与信息科学学院,石家庄 050016)
  • 收稿日期:2011-11-11 出版日期:2012-06-20 发布日期:2012-06-20
  • 作者简介:李 宁(1977-),女,讲师、硕士,主研方向:人工智能;贺毅朝,教授、CCF会员;田海燕,讲师、硕士
  • 基金资助:
    河北省高等学校科学技术研究青年基金资助项目(2010 260)

Application of Hybrid Coding Harmony Search Algorithm in Dynamic Optimization

LI Ning 1, HE Yi-chao 1, TIAN Hai-yan 2   

  1. (1. School of Information Engineering, Shijiazhuang University of Economics, Shijiazhuang 050031, China; 2. College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang 050016, China)
  • Received:2011-11-11 Online:2012-06-20 Published:2012-06-20

摘要: 采用混合双重编码方法,提出一种混合编码二进制和声搜索算法HBHSA,用以求解动态位匹配问题和时变背包问题。仿真结果表明,与DS_BPSO、HBDE和PDGA算法相比,HBHSA具有更好的鲁棒性和通用性,在动态环境中的搜索能力和对最优解的跟踪能力更优。

关键词: 进化算法, 和声搜索算法, 双重编码方法, 动态优化, 动态位匹配问题, 时变背包问题

Abstract: For using harmony search algorithm to solve dynamic optimization problems, this paper proposes a Hybrid-coding Binary Harmony Search algorithm(HBHSA) based on hybrid double-coding method. Following, for comparing the performance of HBHSA, DS_BPSO, HBDE and PDGA, it uses them to solve Dynamic Bit-matching Problem(DBMP) and Time-varying Knapsack Problem(TVKP) respectively. The numerical results show that the dynamic search capability and ability of traced optimal solution nearly as same as DS_BPSO and HBDE, and robustness and universality are more superior.

Key words: evolutionary algorithm, Harmony Search Algorithm(HAS), double-coding method, dynamic optimization, Dynamic Bit Matching Problem(DBMP), time-varying knapsack problem

中图分类号: