An Improved Ants Colony Algorithm for NP-hard Problem of Travelling Salesman.
Yabo LuoShikun ZhangFeng ZhangPublished in: ICPCA/SWS (2013)
Keyphrases
- np hard
- optimal solution
- cost function
- ant colony
- search space
- dynamic programming
- worst case
- ant colony optimization
- computational complexity
- swarm intelligence
- ant colonies
- linear programming
- simulated annealing
- approximation algorithms
- mathematical model
- artificial ants
- special case
- objective function
- foraging behavior
- travelling salesman
- bayesian networks
- heuristic solution
- exhaustive search
- integer programming
- convex hull
- metaheuristic
- particle swarm optimization
- lower bound