Beam-ACO for the Repetition-Free Longest Common Subsequence Problem.
Christian BlumMaria J. BlesaBorja CalvoPublished in: Artificial Evolution (2013)
Keyphrases
- beam search
- ant colony optimization
- aco algorithms
- branch and bound
- aco algorithm
- search algorithm
- metaheuristic
- genetic algorithm ga
- traveling salesman problem
- ant colony optimisation
- ant colony optimization algorithm
- search problems
- ant colony
- genetic algorithm
- orders of magnitude
- ant colony optimization metaheuristic
- reinforced concrete
- swarm intelligence
- cross section
- particle swarm optimization
- learning algorithm