Extended Trail Reinforcement Strategies for Ant Colony Optimization
| Autor: | Marin Golub, Mirko Maleković, Nikola Ivković |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2011 |
| Předmět: |
Mathematical optimization
Optimization problem Computer science business.industry Ant colony optimization algorithms MathematicsofComputing_NUMERICALANALYSIS Swarm intelligence ComputingMethodologies_ARTIFICIALINTELLIGENCE reinforcement strategy pheromone trail MAX-MIN ant system Ant colony optimization combinatorial optimization parameter settings Kruskal's algorithm Combinatorial optimization Artificial intelligence Reinforcement business Metaheuristic Statistical hypothesis testing |
| Zdroj: | Swarm, Evolutionary, and Memetic Computing ISBN: 9783642271717 SEMCCO (1) |
| Popis: | Ant colony optimization (ACO) is a metaheuristic inspired by the foraging behavior of biological ants that was successfully applied for solving computationally hard problems. The fundamental idea that drives the ACO is the usage of pheromone trails for accumulating experience about the problem that is been solved. The best performing ACO algorithms typically use one, in some sense "the best", solution to reinforce trail components. Two main trail reinforcement strategies are used in ACO algorithms: iteration best and global best strategy. This paper extends the reinforcement strategies by using the information from an arbitrary number of previous iterations of the algorithm. The influence of proposed strategies on algorithmic behavior is analyzed on different classes of optimization problems. The conducted experiments showed that using the proposed strategies can improve the algorithm's performance. To compare the strategies we use the Mann---Whitney and Kruskal --- Wallis statistical tests. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|