| 一种解决非线性优化问题的新方法 |
| |
| 引用本文： | 刘瑶,孙济洲.一种解决非线性优化问题的新方法[J].微处理机,2004,25(3):26-28. |
| |
| 作者姓名： | 刘瑶 孙济洲 |
| |
| 作者单位： | 天津大学计算机系,天津,300072 |
| |
| 摘 要： | 本文对组合优化领域中出现的新型随机搜索方法——蚂蚁算法进行了引伸和扩展，得出一种可以快速有效地解决无约束和有约束非线性优化问题的新途径。利用一系列的典型函数进行测试，证实其全局收敛性好，运算速度较快，具有良好的实用性能。
|
| 关 键 词： | 蚂蚁算法 约束 非线性优化 |
| 文章编号： | 1002-2279(2004)03-0026-03 |
| 修稿时间： | 2003年4月5日 |
A New Method For Nonlinear Optimization |
| |
| LIU Yao,SUN Ji-zhou.A New Method For Nonlinear Optimization[J].Microprocessors,2004,25(3):26-28. |
| |
| Authors: | LIU Yao SUN Ji-zhou |
| |
| Abstract: | The ant algorithm is a new stochastic research method in combinational optimization area. In this paper, this algorithm's usage is extended and a new method is presented, which can solve both unconstrained and constrained nonlinear optimization problems quickly and effectively. Serials of typical functions are tested experimentally, showed that good global convergence,high computation speed and fine practical performance have achieved. |
| |
| Keywords: | Ant algorithm Constrained Nonlinear optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
