| 一种新型的变领域搜索算法 |
| |
| 引用本文： | 于继江.一种新型的变领域搜索算法[J].通信技术,2011(9):129-131,134. |
| |
| 作者姓名： | 于继江 |
| |
| 作者单位： | 菏泽学院计算机与信息工程系; |
| |
| 摘 要： | 一般变邻域搜索算法在连续优化问题的可行解空间上难以找到局部最优解。提出了一种结合SQP算法的变邻域搜索算法,该算法将SQP算法引入到变邻域搜索算法的局部搜索过程中,以SQP算法寻找局部最优解,以变邻域搜索算法跳出局部最优解的低谷,进而寻找到全局最优解。另外还对变邻域搜索算法的初始解和扰动过程进行了改进。数值实验表明,该算法具有良好的收敛性和搜索精度,求解效果优于文献算法。
|
| 关 键 词： | 变邻域搜索算法 SQP算法 无约束连续优化问题 |
A Novel Variable Neighborhood Search Algorithm |
| |
| YU Ji-jiang.A Novel Variable Neighborhood Search Algorithm[J].Communications Technology,2011(9):129-131,134. |
| |
| Authors: | YU Ji-jiang |
| |
| Affiliation: | YU Ji-jiang(Computer and Information Engineering Department,Heze University,Heze Shandong,274015,China) |
| |
| Abstract: | General variable neighborhood search algorithm could hardly find local optimal solution for continuous optimization problems in the feasible solution space.A novel variable neighborhood search algorithm based on sequential quadratic programming(SQP) is proposed.In this algorithm,SQP is introduced to the local search of variable neighborhood search algorithm for finding local optimal solution,and then the global optimum can be found by variable neighborhood search algorithm.In addition,the initial solution a... |
| |
| Keywords: | variable neighborhood search algorithm SQP algorithm unconstrained continuous optimization problem |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
