科研之友
微信
新浪微博
Facebook
分享链接
摘要
ACO-H hybrid metaheuristic method for combinatorial optimization based on two population approaches - the algorithms of ant colony optimization and H-method is proposed. The conditions are obtained that define a convergence in value to the optimal problem solution. The efficiency of the method algorithms is illustrated by the results of computation experiment concerning the solution of a number of the known problems of combinatorial optimization.
- 出版日期2010
