Sensitive Ants: Inducing Diversity in the Colony

A metaheuristic called Sensitive Ant Model (SAM) for solving combinatorial optimization problems is developed. The proposed model is based on the Ant Colony System (ACS) algorithm in which agents cooperate indirectly using pheromone trails. SAM improves and extends the ACS approach by endowing each agent of the model with properties that induce heterogeneity. Different pheromone sensitivity levels are used for agents in the population. Highly-sensitive agents are essentially influenced in the decision making process by stigmergic information and thus likely to select strong pheromone-marked moves. Search intensification can be therefore sustained. Agents with low sensitivity are biased towards random search inducing diversity for exploration of the environment. A balanced sensitivity distribution is facilitated by the co-existence of several subpopulations with pheromone sensitivity level generated in a specified range. A heterogeneous agent model has the potential to cope with complex search spaces. Sensitive agents (or ants) allow many types of reactions to a changing environment facilitating an efficient balance between exploration and exploitation.

[1]  P.-P. Grasse La reconstruction du nid et les coordinations interindividuelles chezBellicositermes natalensis etCubitermes sp. la théorie de la stigmergie: Essai d'interprétation du comportement des termites constructeurs , 1959, Insectes Sociaux.

[2]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[3]  Camelia-Mihaela Pintea,et al.  Heterogeneous sensitive ant model for combinatorial optimization , 2008, GECCO '08.

[4]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[5]  Takaya Arita,et al.  Diversity control in ant colony optimization , 2006, Artificial Life and Robotics.

[6]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[7]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .

[8]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[9]  Ali Kaveh,et al.  A hybrid ant strategy and genetic algorithm to tune the population size for efficient structural optimization , 2007 .

[10]  Camelia-Mihaela Pintea,et al.  Sensitive ant model for combinatorial optimization , 2008 .

[11]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[12]  Zhenyu Yang,et al.  Genetic and Evolutionary Computation Conference (GECCO-2008) , 2008, GECCO 2008.