Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
The dynamics of collective sorting robot-like ants and ant-like robots
Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
Vector quantization and signal compression
Vector quantization and signal compression
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Diversity and adaptation in populations of clustering ants
SAB94 Proceedings of the third international conference on Simulation of adaptive behavior : from animals to animats 3: from animals to animats 3
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Swarm intelligence
Parallelization Strategies for Ant Colony Optimization
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
SBRN '02 Proceedings of the VII Brazilian Symposium on Neural Networks (SBRN'02)
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Ant Colony Optimization
K-means clustering via principal component analysis
ICML '04 Proceedings of the twenty-first international conference on Machine learning
ACODF: a novel data clustering approach for data mining in large databases
Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
An efficient law-of-cosine-based search for vector quantization
Pattern Recognition Letters
A new hybrid heuristic approach for solving large traveling salesman problem
Information Sciences—Informatics and Computer Science: An International Journal
Ant colony system with communication strategies
Information Sciences—Informatics and Computer Science: An International Journal
Fundamentals of Computational Swarm Intelligence
Fundamentals of Computational Swarm Intelligence
Computers and Operations Research
A new arrhythmia clustering technique based on Ant Colony Optimization
Journal of Biomedical Informatics
Clustering
A fast VQ codebook generation algorithm via pattern reduction
Pattern Recognition Letters
A new hybrid ant colony optimization algorithm for the vehicle routing problem
Pattern Recognition Letters
A Fast VQ Codebook Generation Algorithm Based on Otsu Histogram Threshold
Fundamenta Informaticae
An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis
Applied Soft Computing
Application of ant K-means on clustering analysis
Computers & Mathematics with Applications
A time-efficient pattern reduction algorithm for k-means clustering
Information Sciences: an International Journal
A survey on parallel ant colony optimization
Applied Soft Computing
An ACO-based clustering algorithm
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Image compression method using improved PSO vector quantization
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
IEEE Transactions on Signal Processing
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
The complexity of the generalized Lloyd - Max problem (Corresp.)
IEEE Transactions on Information Theory
Variable-branch tree-structured vector quantization
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
Fast full search equivalent encoding algorithms for image compression using vector quantization
IEEE Transactions on Image Processing
Hi-index | 0.00 |
This paper presents an effective and efficient method for speeding up ant colony optimization (ACO) in solving the codebook generation problem. The proposed method is inspired by the fact that many computations during the convergence process of ant-based algorithms are essentially redundant and thus can be eliminated to boost their convergence speed, especially for large and complex problems. To evaluate the performance of the proposed method, we compare it with several state-of-the-art metaheuristic algorithms. Our simulation results indicate that the proposed method can significantly reduce the computation time of ACO-based algorithms evaluated in this paper while at the same time providing results that match or outperform those ACO by itself can provide.