Ant algorithms for discrete optimization
Artificial Life
Future Generation Computer Systems
On how pachycondyla apicalis ants suggest a new search algorithm
Future Generation Computer Systems
Swarm intelligence
Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Using Genetic Algorithms to Optimize ACS-TSP
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
The Ant Colony Metaphor for Searching Continuous Design Spaces
Selected Papers from AISB Workshop on Evolutionary Computing
Ant Colony Optimization
Continuous interacting ant colony algorithm based on dense heterarchy
Future Generation Computer Systems - Special issue: Computational chemistry and molecular dynamics
Multivariate ant colony optimization in continuous search spaces
Proceedings of the 10th annual conference on Genetic and evolutionary computation
The Differential Ant-Stigmergy Algorithm for Large Scale Real-Parameter Optimization
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
An enhanced aggregation pheromone system for real-parameter optimization in the ACO metaphor
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
On MAX - MIN ant system's parameters
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
ACO for continuous optimization based on discrete encoding
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Evolutionary programming made faster
IEEE Transactions on Evolutionary Computation
The particle swarm - explosion, stability, and convergence in amultidimensional complex space
IEEE Transactions on Evolutionary Computation
Ant colony optimization for resource-constrained project scheduling
IEEE Transactions on Evolutionary Computation
Parametric study for an ant algorithm applied to water distribution system optimization
IEEE Transactions on Evolutionary Computation
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Ant colony optimization for routing and load-balancing: survey and new directions
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Ant Colony Optimizations for Resource- and Timing-Constrained Operation Scheduling
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Learning fuzzy cognitive maps from data by ant colony optimization
Proceedings of the 14th annual conference on Genetic and evolutionary computation
SDE: a stochastic coding differential evolution for global optimization
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Information Sciences: an International Journal
Function optimisation by learning automata
Information Sciences: an International Journal
Hi-index | 0.01 |
An ant colony optimization (ACO) algorithm offers algorithmic techniques for optimization by simulating the foraging behavior of a group of ants to perform incremental solution constructions and to realize a pheromone laying-and-following mechanism. Although ACO is first designed for solving discrete (combinatorial) optimization problems, the ACO procedure is also applicable to continuous optimization. This paper presents a new way of extending ACO to solving continuous optimization problems by focusing on continuous variable sampling as a key to transforming ACO from discrete optimization to continuous optimization. The proposed SamACO algorithm consists of three major steps, i.e., the generation of candidate variable values for selection, the ants' solution construction, and the pheromone update process. The distinct characteristics of SamACO are the cooperation of a novel sampling method for discretizing the continuous search space and an efficient incremental solution construction method based on the sampled values. The performance of SamACO is tested using continuous numerical functions with unimodal and multimodal features. Compared with some state-of-the-art algorithms, including traditional ant-based algorithms and representative computational intelligence algorithms for continuous optimization, the performance of SamACO is seen competitive and promising.