计算机工程 ›› 2007, Vol. 33 ›› Issue (21): 192-193,.doi: 10.3969/j.issn.1000-3428.2007.21.068

• 人工智能及识别技术 • 上一篇    下一篇

混沌优化算法及其在组合优化问题中的应用

王丽侠   

  1. (浙江师范大学行知学院,金华 321004)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-11-05 发布日期:2007-11-05

Chaos Optimization Algorithm and Its Application on Combinational Problem

WANG Li-xia   

  1. (Xingzhi College, Zhejiang Normal University, Jihua 321004)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-11-05 Published:2007-11-05

摘要: 混沌优化方法(COA)是针对数值优化问题提出的,在解决数值优化问题上具有一定的普遍性,能够很快地搜索到全局最优解,而利用COA解决组合优化问题存在一定的难度,该文提出了混沌优化算法解决组合优化问题的方法,该方法先产生组合优化问题的初始解,再利用混沌变量产生新解或对原解进行混沌扰动,产生新解,然后在解空间中进行最优搜索。将该方法应用到2个典型的组合优化问题(TSP问题,0/1背包问题)的求解中,仿真实验表明了该方法的有效性。

关键词: 混沌, 优化, 0/1背包问题, TSP

Abstract: Chaos optimization algorithm(COA) is put forward to solve value optimization problems, which can find the best solution efficiently. However, it is difficult for COA to solve combinational optimization problems. To solve the problem, this paper presents a method to solve combinational optimization problem based on COA. An initial solution is produced, and a new solution is produced by chaos variables or by disturbing initial solution based on chaos variables. Based on the method, the paper solves two typical combinational optimization problems(0/1 knapsack problem and TSP problem). And the result of simulation shows the validity of the algorithm.

Key words: chaos, optimization, 0/1 knapsack problem, TSP

中图分类号: