| 基于离散和声搜索与模拟退火的混合算法 |
| |
| 引用本文： | 王玉亭,孙剑,李俊青.基于离散和声搜索与模拟退火的混合算法[J].计算机工程,2009,35(18):173-175. |
| |
| 作者姓名： | 王玉亭 孙剑 李俊青 |
| |
| 作者单位： | 聊城大学计算机学院,聊城,252059 |
| |
| 摘 要： | 和声搜索是一种启发式优化算法，对和声搜索算法进行离散化，使其能够适用于组合优化问题，就离散和声搜索算法进行两点改进，针对离散和声搜索算法容易陷入局部最优的缺陷，提出一种离散和声搜索与模拟退火算法的混合策略。实验结果表明，基于改进离散和声搜索与模拟退火的混合算法具有较高的求解质量。
|
| 关 键 词： | 旅行商问题 和声搜索 模拟退火 混合算法 |
| 修稿时间： | |
Hybrid Algorithm Based on Discrete Harmony Search and Simulated Annealing |
| |
| WANG Yu-ting,SUN Jian,LI Jun-qing.Hybrid Algorithm Based on Discrete Harmony Search and Simulated Annealing[J].Computer Engineering,2009,35(18):173-175. |
| |
| Authors: | WANG Yu-ting SUN Jian LI Jun-qing |
| |
| Affiliation: | School of Computer Science;Liaocheng University;Liaocheng 252059 |
| |
| Abstract: | Harmony Search(HS) is a heuristic optimization method.To make HS algorithm be able to apply to the combinatorial optimization problem, a Discrete Harmony Search(DHS) algorithm is proposed.Two improvements of the DHS algorithm are described.The pure DHS algorithm may produce premature and poor results.In order to avoid premature convergence and poor results in DHS, based on the complementary strengths of DHS and Simulated Annealing(SA) algorithm, a hybrid strategy of HS and SA is put forward.Experimental res... |
| |
| Keywords: | Traveling Salesman Problem(TSP) Harmony Search(HS) Simulated Annealing(SA) hybrid algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
