Solve the Continuous Optimization Models with Ant Colony Optimization Algorithms

摘要：

Ant colony optimization algorithm is a heuristic approach for the solution of combinatorial optimization problems. In order to solve continuous optimization models, a new ant colony optimization algorithm is designed. Some Benchmark problems are employed to illustrate the effectiveness of the algorithm.

关键词： Ant Colony Optimization Algorithm Continuous Optimization Model Benchmark Problem

作者: Yuanguo Zhu

作者单位: Department of Applied Mathematics, Nanjing University of Science and Technology, Nanjing, Jiangsu 210094, China

会议类型: 国际会议

会议名称: 第一届中国智能计算大会

会议地点: 江西庐山

会议语种:英文

页码: 14-16

在线出版日期: 2007-10-10（万方平台首次上网日期，不代表论文的发表时间）