Library Subscription: Guest
Journal of Automation and Information Sciences

Published 12 issues per year

ISSN Print: 1064-2315

ISSN Online: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

ACO-H Metaheuristic Combinatorial Optimization Method

Volume 42, Issue 7, 2010, pp. 30-42
DOI: 10.1615/JAutomatInfScien.v42.i7.20
Get accessGet access

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.

CITED BY
  1. Iemets O. O., Barbolina T. M., Lexicographic Equivalence in Mixed Combinatorial Optimization of Linear-Fractional Functions on Arrangements, Cybernetics and Systems Analysis, 53, 2, 2017. Crossref

Begell Digital Portal Begell Digital Library eBooks Journals References & Proceedings Research Collections Prices and Subscription Policies Begell House Contact Us Language English 中文 Русский Português German French Spain