[图书][B] Ant colony optimization: overview and recent advances
Abstract Ant Colony Optimization (ACO) is a metaheuristic that is inspired by the pheromone
trail laying and following behavior of some ant species. Artificial ants in ACO are stochastic …
trail laying and following behavior of some ant species. Artificial ants in ACO are stochastic …
Ant colony optimization
Swarm intelligence is a relatively new approach to problem solving that takes inspiration
from the social behaviors of insects and of other animals. In particular, ants have inspired a …
from the social behaviors of insects and of other animals. In particular, ants have inspired a …
[PDF][PDF] A concise overview of applications of ant colony optimization
Ant Colony Optimization (ACO)[1, 2, 3] is a metaheuristic for solving hard combinatorial
optimization problems inspired by the indirect communication of real ants. In ACO …
optimization problems inspired by the indirect communication of real ants. In ACO …
An improved excitation matching method based on an ant colony optimization for suboptimal-free clustering in sum-difference compromise synthesis
Dealing with an excitation matching method, this paper presents a global optimization
strategy for the optimal clustering in sum-difference compromise linear arrays. Starting from …
strategy for the optimal clustering in sum-difference compromise linear arrays. Starting from …
An ant colony optimization approach for the multidimensional knapsack problem
L Ke, Z Feng, Z Ren, X Wei - Journal of Heuristics, 2010 - Springer
Ant colony optimization is a metaheuristic that has been applied to a variety of combinatorial
optimization problems. In this paper, an ant colony optimization approach is proposed to …
optimization problems. In this paper, an ant colony optimization approach is proposed to …
antaRNA: ant colony-based RNA sequence design
R Kleinkauf, M Mann, R Backofen - Bioinformatics, 2015 - academic.oup.com
Motivation: RNA sequence design is studied at least as long as the classical folding
problem. Although for the latter the functional fold of an RNA molecule is to be found, inverse …
problem. Although for the latter the functional fold of an RNA molecule is to be found, inverse …
[HTML][HTML] An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
M Bruglieri, M Ehrgott, HW Hamacher… - Discrete Applied …, 2006 - Elsevier
In this paper, we consider combinatorial optimization problems with additional cardinality
constraints. In k-cardinality combinatorial optimization problems, a cardinality constraint …
constraints. In k-cardinality combinatorial optimization problems, a cardinality constraint …
A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems
H Katagiri, T Hayashida, I Nishizaki, Q Guo - Expert Systems with …, 2012 - Elsevier
This paper considers an efficient approximate algorithm for solving k-minimum spanning
tree problems which is one of the combinatorial optimization in networks. A new hybrid …
tree problems which is one of the combinatorial optimization in networks. A new hybrid …
On the finite-time dynamics of ant colony optimization
WJ Gutjahr - Methodology and Computing in Applied Probability, 2006 - Springer
An analytical framework for investigating the finite-time dynamics of ant colony optimization
(ACO) under a fitness-proportional pheromone update rule on arbitrary construction graphs …
(ACO) under a fitness-proportional pheromone update rule on arbitrary construction graphs …
Delineating trees in noisy 2D images and 3D image-stacks
We present a novel approach to fully automated delineation of tree structures in noisy 2D
images and 3D image stacks. Unlike earlier methods that rely mostly on local evidence, our …
images and 3D image stacks. Unlike earlier methods that rely mostly on local evidence, our …