A hybrid ACO algorithm for the Capacitated Minimum Spanning Tree Problem.
Marc ReimannMarco LaumannsPublished in: Hybrid Metaheuristics (2004)
Keyphrases
- aco algorithm
- ant colony optimization
- ant colony optimization algorithm
- metaheuristic
- parameter settings
- aco algorithms
- quadratic assignment problem
- minimum spanning tree
- combinatorial optimization problems
- ant colony
- swarm intelligence
- ant colonies
- traveling salesman problem
- search space
- particle swarm optimization
- simulated annealing
- solution quality
- neural network
- data points
- neighborhood structure
- ant colony optimisation
- computational complexity