Library Subscription: Guest
Home Begell Digital Library eBooks Journals References & Proceedings Research Collections
Journal of Automation and Information Sciences

Impact factor: 0.040

ISSN Print: 1064-2315
ISSN Online: 2163-9337

You have access to:
Volume 46, 2014 Volume 45, 2013 Volume 44, 2012 Volume 43, 2011 Volume 42, 2010 Volume 41, 2009 Volume 40, 2008 Volume 39, 2007 Volume 38, 2006 Volume 37, 2005 Volume 36, 2004 Volume 35, 2003 Volume 34, 2002 Volume 33, 2001 Volume 32, 2000 Volume 31, 1999 Volume 30, 1998 Volume 29, 1997 Volume 28, 1996

Journal of Automation and Information Sciences

DOI: 10.1615/JAutomatInfScien.v42.i7.20
pages 30-42

ACO-H Metaheuristic Combinatorial Optimization Method

Leonid F. Hulyanytskyi
V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine, Kiev, Ukraine
Sergey I. Sirenko
V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine, Kiev, Ukraine

ABSTRACT

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.