Design and Simulation of Simulated Annealing Algorithm with Harmony Search

被引:0
作者
Jiang, Hua [1 ]
Liu, Yanxiu [1 ]
Zheng, Liping [1 ]
机构
[1] Liaocheng Univ, Coll Comp Sci Shandong, Liaocheng 252059, Peoples R China
来源
ADVANCES IN SWARM INTELLIGENCE, PT 2, PROCEEDINGS | 2010年 / 6146卷
关键词
Harmony search; Simulated annealing algorithm; Convergence speed;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Harmony search is a new heuristic optimization algorithm. Comparing with other algorithms, this algorithm has very strong robustness and can be easily operated. Combining with the features of harmony search, an improved simulated annealing algorithm is proposed in this paper. It can improve the speed of annealing. The initial state of simulated annealing and new solutions are generated by harmony search. So it has the advantage of high quality and efficiency. The simulation results show that this new algorithm has faster convergence speed and better optimization quality than the traditional simulated annealing algorithm and other algorithms.
引用
收藏
页码:454 / 460
页数:7
相关论文
共 9 条
[1]   A new heuristic optimization algorithm: Harmony search [J].
Geem, ZW ;
Kim, JH ;
Loganathan, GV .
SIMULATION, 2001, 76 (02) :60-68
[2]  
GUOHUA S, 2008, COMPUTER KNOWLEDGE T, V2, P1103
[3]  
JIAN F, 2008, FOREST ENG, V24, P94
[4]  
JIANGANG J, 2007, SCI TECHNOLOGY CONSU, V28, P148
[5]  
Ling Wang, 2001, INTELLIGENT OPTIMIZA
[6]   Global-best harmony search [J].
Omran, Mahamed G. H. ;
Mahdavi, Mehrdad .
APPLIED MATHEMATICS AND COMPUTATION, 2008, 198 (02) :643-656
[7]  
PIN L, 2009, J SYSTEM SIMULATION, V21, P4328
[8]  
SHILIAN Z, 2008, COMPUTER SIMULATION, V25, P192
[9]  
ZHIYI Q, 2007, COMPUTER APPL SOFTWA, V24, P182