Improved Lower Limits for Pheromone Trails in Ant Colony Optimization
نویسنده
چکیده
Ant Colony Optimization algorithms were inspired by the foraging behavior of ants that accumulate pheromone trails on the shortest paths to food. Some ACO algorithms employ pheromone trail limits to improve exploration and avoid stagnation by ensuring a non-zero probability of selection for all trails. The MAX-MIN Ant System (MMAS) sets explicit pheromone trail limits while the Ant Colony System (ACS) has implicit pheromone trail limits. Stagnation still occurs in both algorithms with the recommended pheromone trail limits as the relative importance of the pheromone trails increases (α > 1). Improved estimates of the lower pheromone trail limit (τmin) for both algorithms help avoid stagnation and improve performance for α > 1. The improved estimates suggest a general rule to avoid stagnation for stochastic algorithms with explicit or implicit limits on exponential values used in proportional selection.
منابع مشابه
A Pheromone Trails Model for MAX-MIN Ant System
Pheromone trails are the main media for gathering collective knowledge about a problem, and have a central role in all ant colony optimization algorithms. Setting appropriate trail limits for the MAX-MIN ant system (MMAS) is important for good performance of the algorithm. We used rigorous analysis to develop expressions that model the influence of trail limits on MMAS behavior. Besides the gen...
متن کاملA reactive framework for Ant Colony Optimization
We introduce two reactive frameworks for dynamic adapating some parameters of an Ant Colony Optimization (ACO) algorithm. Both reactive frameworks use ACO to adapt parameters: pheromone trails are associated with parameter values; these pheromone trails represent the learnt desirability of using parameter values and are used to dynamically set parameters in a probabilistic way. The two framewor...
متن کاملSuperior/Inferior Segment-Discriminated Ant System for combinatorial optimization problems
The Ant Colony Optimization method is a heuristic algorithm for solving various optimization problems, particularly the combinatorial optimization problems. Traditional ant-optimization methods might encounter search stagnation owing to a biased pheromone map that is dominated by local optimal trails. To overcome this drawback and lower the number of solution constructions for finding the optim...
متن کاملResearch on an Improved Ant Colony Optimization Algorithm for Solving Traveling Salesmen Problem
In order to improve the search result and low evolution speed, and avoid the tendency towards stagnation and falling into the local optimum of ant colony optimization(ACO) in solving the complex function, the traditional ant colony optimization algorithm is analyzed in detail, an improved ant colony optimization(IWSMACO) algorithm based on information weight factor and supervisory mechanism is ...
متن کاملSensitive Ant Systems in Combinatorial Optimization
A new model based on the robust Ant Colony System (ACS) is introduced. The proposed Sensitive ACS (SACS) model extends ACS using the sensitive reaction of ants to pheromone trails. Each ant is endowed with a pheromone sensitivity level allowing different types of responses to pheromone trails. The SACS model facilitates a good balance between search exploitation and search exploration. Both ACS...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008