Cooperative group optimization with ants (CGO-AS): Leverage optimization with mixed individual and social learning

Graphical abstractDisplay Omitted HighlightsWe presented CGO-AS, a generalized ant system implemented in the framework of cooperative group optimization.In CGO-AS, a novel search strategy is designed to use both individual and social cues in a controlled proportion.With CGO-AS, we expose how to leverage optimization using mixed individual and social learning.The optimization performance is tested with instances of the traveling salesman problem.CGO-AS shows a better performance than the systems which solely use either individual or social learning. We present CGO-AS, a generalized ant system (AS) implemented in the framework of cooperative group optimization (CGO), to show the leveraged optimization with a mixed individual and social learning. Ant colony is a simple yet efficient natural system for understanding the effects of primary intelligence on optimization. However, existing AS algorithms are mostly focusing on their capability of using social heuristic cues while ignoring their individual learning. CGO can integrate the advantages of a cooperative group and a low-level algorithm portfolio design, and the agents of CGO can explore both individual and social search. In CGO-AS, each ant (agent) is added with an individual memory, and is implemented with a novel search strategy to use individual and social cues in a controlled proportion. The presented CGO-AS is therefore especially useful in exposing the power of the mixed individual and social learning for improving optimization. The optimization performance is tested with instances of the traveling salesman problem (TSP). The results prove that a cooperative ant group using both individual and social learning obtains a better performance than the systems solely using either individual or social learning. The best performance is achieved under the condition when agents use individual memory as their primary information source, and simultaneously use social memory as their searching guidance. In comparison with existing AS systems, CGO-AS retains a faster learning speed toward those higher-quality solutions, especially in the later learning cycles. The leverage in optimization by CGO-AS is highly possible due to its inherent feature of adaptively maintaining the population diversity in the individual memory of agents, and of accelerating the learning process with accumulated knowledge in the social memory.

[1]  H. Wolf Desert ants adjust their approach to a foraging site according to experience , 2007, Behavioral Ecology and Sociobiology.

[2]  Xin-She Yang,et al.  Discrete cuckoo search algorithm for the travelling salesman problem , 2014, Neural Computing and Applications.

[3]  G. Beugnon,et al.  Ant navigation en route to the goal: signature routes facilitate way-finding of Gigantiops destructor , 2006, Journal of Comparative Physiology A.

[4]  Jack A. Goncalo,et al.  Individualism-collectivism and group creativity. , 2006 .

[5]  J. Deneubourg,et al.  The self-organizing exploratory pattern of the argentine ant , 1990, Journal of Insect Behavior.

[6]  Halife Kodaz,et al.  A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem , 2015, Appl. Soft Comput..

[7]  J. Henrich,et al.  The cultural niche: Why social learning is essential for human adaptation , 2011, Proceedings of the National Academy of Sciences.

[8]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[9]  C. Nemeth Differential contributions of majority and minority influence , 1986 .

[10]  Suphakant Phimoltares,et al.  Combining new Fast Opposite Gradient Search with Ant Colony Optimization for solving travelling salesman problem , 2014, Eng. Appl. Artif. Intell..

[11]  E. Morgan Trail pheromones of ants. , 2009 .

[12]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[13]  Svenja C. Sommer,et al.  The Effects of Problem Structure and Team Diversity on Brainstorming Effectiveness , 2009, Manag. Sci..

[14]  Forschungsinstitut für Diskrete Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003 .

[15]  F. Ratnieks,et al.  Communication in ants , 2006, Current Biology.

[16]  R. Wehner,et al.  Ant Navigation: One-Way Routes Rather Than Maps , 2006, Current Biology.

[17]  M. Collett How Navigational Guidance Systems Are Combined in a Desert Ant , 2012, Current Biology.

[18]  Thomas Stützle,et al.  Ant Colony Optimization for Mixed-Variable Optimization Problems , 2014, IEEE Transactions on Evolutionary Computation.

[19]  Jiming Liu,et al.  A cooperative group optimization system , 2013, Soft Computing.

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

[21]  F. Ratnieks,et al.  Trail pheromones: an integrative view of their role in social insect colony organization. , 2015, Annual review of entomology.

[22]  Harald Wolf,et al.  Food searches and guiding structures in North African desert ants, Cataglyphis , 2015, Journal of Comparative Physiology A.

[23]  J. Bruner,et al.  Cultural learning. Author's reply , 1993 .

[24]  Stanley B Klein,et al.  What memory is. , 2015, Wiley interdisciplinary reviews. Cognitive science.

[25]  K. A. Ericsson,et al.  Long-term working memory. , 1995, Psychological review.

[26]  Paul Graham,et al.  Ant navigation: Priming of visual route memories , 2005, Nature.

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

[28]  Thomas S. Collett,et al.  Memory use in insect visual navigation , 2002, Nature Reviews Neuroscience.

[29]  R. Matthews,et al.  Ants. , 1898, Science.

[30]  G. Theraulaz,et al.  Inspiration for optimization from social insect behaviour , 2000, Nature.

[31]  R. Wehner,et al.  Multiroute memories in desert ants , 2008, Proceedings of the National Academy of Sciences.

[32]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[33]  M. Giurfa,et al.  Vectors, routes and maps: new discoveries about navigation in insects , 1999, Trends in Neurosciences.

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

[35]  J. Deneubourg,et al.  Self-organized shortcuts in the Argentine ant , 1989, Naturwissenschaften.

[36]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[37]  F. Ratnieks,et al.  Ant foraging on complex trails: route learning and the role of trail pheromones in Lasius niger , 2013, Journal of Experimental Biology.

[38]  Markus Wagner,et al.  Analyzing the Effects of Instance Features and Algorithm Parameters for Max–Min Ant System and the Traveling Salesperson Problem , 2015, Front. Robot. AI.

[39]  P. Paulus Groups, Teams, and Creativity: The Creative Potential of Idea-generating Groups , 2000 .

[40]  F. Ratnieks,et al.  Decision making in ant foragers (Lasius niger) facing conflicting private and social information , 2011, Behavioral Ecology and Sociobiology.

[41]  T. Collett,et al.  Local and global vectors in desert ant navigation , 1998, Nature.

[42]  Bernd Freisleben,et al.  Memetic Algorithms for the Traveling Salesman Problem , 2002, Complex Syst..

[43]  S. Kauffman,et al.  Towards a general theory of adaptive walks on rugged landscapes. , 1987, Journal of theoretical biology.

[44]  R. Wehner Desert ant navigation: how miniature brains solve complex tasks , 2003, Journal of Comparative Physiology A.

[45]  J. Valacich,et al.  Computer brainstorms: More heads are better than one. , 1993 .

[46]  BENNETT G. GALEF Jr,et al.  Why behaviour patterns that animals learn socially are locally adaptive , 1995, Animal Behaviour.

[47]  Paul Graham,et al.  Route learning by insects , 2003, Current Opinion in Neurobiology.

[48]  Jinzhao Wu,et al.  A discrete invasive weed optimization algorithm for solving traveling salesman problem , 2015, Neurocomputing.

[49]  Eren Özceylan,et al.  A hierarchic approach based on swarm intelligence to solve the traveling salesman problem , 2015 .

[50]  Andrew Philippides,et al.  Snapshots in ants? New interpretations of paradigmatic experiments , 2013, Journal of Experimental Biology.

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

[52]  Matthew Collett,et al.  A desert ant's memory of recent visual experience and the control of route guidance , 2014, Proceedings of the Royal Society B: Biological Sciences.

[53]  T. Valone,et al.  Public Information: From Nosy Neighbors to Cultural Evolution , 2004, Science.

[54]  R. Wehner,et al.  Beginnings of a synthetic approach to desert ant navigation , 2014, Behavioural Processes.

[55]  John R. Anderson,et al.  Human Symbol Manipulation Within an Integrated Cognitive Architecture , 2005, Cogn. Sci..