摘要
提出了一种用于求解组合优化问题的混沌优化策略.在寻优过程中,利用混沌搜索的方法确定解矩阵的变化位置,使得解矩阵在合法解空间内不断遍历寻优.为提高混沌搜索的充分性和遍历性,混沌载波采用幂函数载波的方式,并结合模拟退火的思想来确保算法具有跳出局部极小到达全局最优的遍历寻优能力.该算法可用于多种实际工程问题的求解中.仿真结果验证了该算法的有效性.
Chaos searching strategy for combination optimization problem is proposed. In the process of optimization, the operation position of the solution matrix can be determined by chaos search, which makes the algorithm search the optimization result in the legal solution space. The power function carrier is adopted to improve the ergodicity and the sufficiency of the chaos optimization, and the simulated annealing is implemented to improve the optimization effect, therefore, the algorithm can get rid of the local minimum and reach the global minimum. The algorithm can be applied to solve many actual engineering oroblems. The simulation results Drove the validitv.
出处
《控制理论与应用》
EI
CAS
CSCD
北大核心
2007年第6期1021-1024,共4页
Control Theory & Applications
基金
国家自然科学基金资助项目(10402003)
天津市高等学校科技发展基金资助项目(20060613).
关键词
混沌搜索
模拟退火
幂函数载波
组合优化
chaos searching
simulated annealing
power function carrier
combination optimization
