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(万方平台首次上网日期,不代表论文的发表时间)