| 一种基于极坐标的快速邻域搜索算法 |
| |
| 引用本文： | 罗亚波,郑莉,凌鹤.一种基于极坐标的快速邻域搜索算法[J].武汉理工大学学报(交通科学与工程版),2006,30(4):660-663. |
| |
| 作者姓名： | 罗亚波 郑莉 凌鹤 |
| |
| 作者单位： | 1. 武汉理工大学机电工程学院,武汉,430070
2. 长沙理工大学,长沙,410076 |
| |
| 基金项目： | 湖北省自然科学基金;湖北省武汉市青年科技晨光计划 |
| |
| 摘 要： | 一般邻域搜索方法面临着邻域定义的难点：定义的邻域较小，搜索就可能很快陷入局部最优，相反，则搜索效率会显著下降．针对这一问题，提出了一种基于极坐标的快速邻域搜索算法．试验证明，该算法能有效地解决邻域定义问题，并能在一定程度上解决常用的优化方法还较难解决的非凸集问题，对于一般复杂度问题，有较小的时间和空间复杂度。
|
| 关 键 词： | 极坐标 邻域搜索 快速算法 |
| 收稿时间： | 2006-02-14 |
| 修稿时间： | 2006年2月14日 |
A Polar Coordinates-based Agile Arithmetic for Adjacent Domain Search |
| |
| Luo Yabo,Zheng Li,Ling He.A Polar Coordinates-based Agile Arithmetic for Adjacent Domain Search[J].journal of wuhan university of technology(transportation science&engineering),2006,30(4):660-663. |
| |
| Authors: | Luo Yabo Zheng Li Ling He |
| |
| Institution: | 1. School of Mechanical and Electrical Engineering, WUT, Wuhan 430070 ; 2. Department of Biology and Light Industry,Changsha University of Science and Technology, Changsha 410076 |
| |
| Abstract: | Definition of adjacent domain is a difficulty that the arithmetic for adjacent domain search is facing. The small adjacent domain leads to local optimization, while the contrast leads to low efficiency. A polar coordinates-based agile arithmetic is proposed in this paper for adjacent domain search to solve the above difficulty. The tests demonstrate that the novel arithmetic can define the adjacent domain well,and solve the concavity problem in a certain extent, which is still difficult for normal optimization methods. The novel arithmetic has a lower complexity of time and space for a general problem. |
| |
| Keywords: | polar coordinates adjacent domain search agile arithmetic |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
