| 3种遍历粗搜索方法对比 |
| |
| 引用本文： | 邢锦江,李静,冯允成.3种遍历粗搜索方法对比[J].计算机工程,2006,32(6):28-30,33. |
| |
| 作者姓名： | 邢锦江 李静 冯允成 |
| |
| 作者单位： | 北京航空航天大学经济管理学院,北京 100083 |
| |
| 基金项目： | 中国科学院资助项目;高等学校博士学科点专项科研项目 |
| |
| 摘 要： | 将目前常用的粗搜索方法随机搜索和混沌搜索同传统的等间隔搜索进行比较。分析了3种方法的计算开销水平并通过等步数实验进行验证。分析了相同步数下等间隔搜索的实验最佳值更优秀的原因，并以定理的形式给出。等时实验的结果进一步突出了等间隔算法的优越性。结论是等间隔搜索是更佳的遍历粗搜索方法。
|
| 关 键 词： | 优化 遍历搜索 粗搜索 混沌 等间隔搜索 |
| 文章编号： | 1000-3428（2006）06-0028-03 |
| 收稿时间： | 2005-03-28 |
| 修稿时间： | 2005-03-28 |
Comparisons of Three Ergodic Global Search Methods |
| |
| XING Jinjiang,LI Jing,FENG Yuncheng.Comparisons of Three Ergodic Global Search Methods[J].Computer Engineering,2006,32(6):28-30,33. |
| |
| Authors: | XING Jinjiang LI Jing FENG Yuncheng |
| |
| Abstract: | Random global search and chaos global search, which are popular nowadays, and the traditional equidistant search are compared. Spending level of three methods are analyzed and proved by experiments with the same steps. It is analyzed and given by a theorem that equidistant search obtains better values in the same steps. And the superiority of equidistant search is stressed in experiments with the same timeline, Conclusion is drawed that equidistant search is the better ergodic global search method. |
| |
| Keywords: | Optimizing Ergodic search Global search Chaos Equidistant search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
