Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP.
Michael GuntschMartin MiddendorfPublished in: EvoWorkshops (2001)
Keyphrases
- ant colony optimization
- learning algorithm
- times faster
- theoretical analysis
- data structure
- orders of magnitude
- computational complexity
- computationally efficient
- significant improvement
- computational efficiency
- computationally expensive
- ant colony
- worst case
- optimization problems
- computational cost
- benchmark datasets
- search space
- combinatorial optimization
- recently developed
- hybrid algorithm
- aco algorithm
- selection strategies