ACO-H Metaheuristic Combinatorial Optimization Method
J. of Automation and Information Science. – 2010. – 42, N 7. – P. 30–42.
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.
Ключові слова: combinatorial optimization, the algorithm of ant colony optimization, population approach, hybrid metaheuristics.