A Discrete Harmony Search Algorithm

摘要：

Harmony search (HS). inspired by the music improvisation process, is a new meta-heuristic optimization method and has been used to tackle various optimization problems in discrete and continuous space successfully. However, the standard HS algorithm is not suitable for settling discrete binary problems. To extend HS to solve the binarycoded problems effectively, a novel discrete binary harmony search (DBHS) algorithm is proposed in this paper. A new pitch adjustment rule is developed to enhance the optimization ability of DBHS. Then parameter studies are performed to investigate the properties of DBHS, and the recommended parameter values are given. The results of numerical experiments demonstrate that the proposed DBHS is valid and outperforms the discrete binary particle swarm optimization algorithm and the standard HS.

关键词： harmony search binary code meta-heuristic

作者: Ling Wang Yin Xu Yunfei Mao Minrui Fei

作者单位: Shanghai Key Laboratory of Power Station Automation Technology,School of Mechatronics and Automation, Shanghai University,Shanghai, 200072

会议类型: 国际会议

会议名称: International Conference on Life System Modeling and Simulation,and International Conference on Intelligent Computing for Sustainable Energy and Environment(2010生命系统建模与仿真国际会议暨m2010可持续能源与环境智能计算国际会议)

会议地点: 无锡

会议语种:英文

页码: 37-43

在线出版日期: 2010-09-17（万方平台首次上网日期，不代表论文的发表时间）