In this work, we introduce a new parallel ant colony optimization algorithm based on an ant metaphor and the crossover operator from genetic algorithms. The performance of the proposed model is evaluated using well-known numerical test problems and then it is applied to train recurrent neural networks to identify linear and nonlinear dynamic plants. The simulation results are compared with results using other algorithms
Despite the numerous applications of ACO (ant colony optimization) algorithm in optimization computa...
Abstract. Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization ...
In some cases, solving of an optimization problem isa challenge for any researcher. Often, getting a...
There are several heuristic optimisation techniques used for numeric optimisation problems such as g...
This paper presents an ant colony optimization based algorithm to solve real parameter optimization ...
. Ant Colonies (AC) optimization take inspiration from the behavior of real ant colonies to solve op...
Ant colony algorithms as a category of evolutionary computational intelligence can deal with complex...
Abstract –Ant colony optimization algorithm is a good way to solve complex multi-stage decision prob...
Ant colony optimization (ACO) algorithms are computational problem-solving methods that are inspired...
The ant colony optimization (ACO) algorithm is a new heuristic algorithm that offers good robustness...
In this work, we present a way to extend Ant Colony Optimization (ACO), so that it can be applied to...
Ant colony optimization (ACO) algorithms are a recently developed, population-based approach which h...
Abstract. The Ant System is a new meta-heuristic method particularly appropriate to solve hard combi...
Ant algorithms are optimisation algorithms inspired by the foraging behaviour of real ants in the wi...
Ant colony algorithms are a class of metaheuristics which are inspired from the behaviour of real an...
Despite the numerous applications of ACO (ant colony optimization) algorithm in optimization computa...
Abstract. Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization ...
In some cases, solving of an optimization problem isa challenge for any researcher. Often, getting a...
There are several heuristic optimisation techniques used for numeric optimisation problems such as g...
This paper presents an ant colony optimization based algorithm to solve real parameter optimization ...
. Ant Colonies (AC) optimization take inspiration from the behavior of real ant colonies to solve op...
Ant colony algorithms as a category of evolutionary computational intelligence can deal with complex...
Abstract –Ant colony optimization algorithm is a good way to solve complex multi-stage decision prob...
Ant colony optimization (ACO) algorithms are computational problem-solving methods that are inspired...
The ant colony optimization (ACO) algorithm is a new heuristic algorithm that offers good robustness...
In this work, we present a way to extend Ant Colony Optimization (ACO), so that it can be applied to...
Ant colony optimization (ACO) algorithms are a recently developed, population-based approach which h...
Abstract. The Ant System is a new meta-heuristic method particularly appropriate to solve hard combi...
Ant algorithms are optimisation algorithms inspired by the foraging behaviour of real ants in the wi...
Ant colony algorithms are a class of metaheuristics which are inspired from the behaviour of real an...
Despite the numerous applications of ACO (ant colony optimization) algorithm in optimization computa...
Abstract. Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization ...
In some cases, solving of an optimization problem isa challenge for any researcher. Often, getting a...