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
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.
KEY WORDS: combinatorial optimization, the algorithm of ant colony optimization, population approach, hybrid metaheuristics
CITED BY
-
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
620 Article views
6 Article downloads
Metrics
Articles with similar content:
Latest Issue
Modeling of Configurations Formed when Using Microneedle Systems
Properties of Large Deviations of Empirical Estimates in a Stochastic Optimization Problem for a Homogeneous Random Field
The Dynamics of One Arms Race Mathematical Model with a Delay
Some Ways to Modeling Input Data for Information Search in the Library of Standards when Solving Semantics Problems
Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
Complete Asymptotics of Approximations by Certain Singular Integrals in Mathematical Modeling
Index, Volume 52, 2020