Group mosquito host-seeking algorithm

The host-seeking behavior of mosquitoes is very interesting. This paper is motivated by the following general observation on mosquito groups and their host-seeking behavior in nature: (1) Mosquitoes’ behavior has possession of the parallelism, openness, local interactivity and self-organization. (2) Mosquito groups seek host very fast. (3) The host-seeking behavior is similar to the producer-scrounger process, which assumes that group members search either for “finding” (producer) or for “joining” (scrounger) opportunities. It stimulates us to extend a mosquito system model in nature to group mosquito host-seeking model (GMHSM) and algorithm (GMHSA) for intelligent computing. In this paper, we propose GMHS approach and show how to use it. By GMHSM, the TSP is transformed into the kinematics and dynamics of mosquito groups host-seeking process. The properties of GMHSM and GMHSA, including the correctness, convergence and stability, have been discussed in this paper. The GMHS approach has many advantages in terms of multiple objective optimization, large-scale distributed parallel optimization, effectiveness of problem-solving and suitability for complex environment. Via simulations, we test the GMHS approach and compare it with other state-of-art algorithms.

[1]  Franz J. Weissing,et al.  Animal behaviour: Born leaders , 2011, Nature.

[2]  F. Nori,et al.  Natural and artificial atoms for quantum computation , 2010, 1002.1871.

[3]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

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

[5]  Peter J. Denning,et al.  Computing is a natural science , 2007, CACM.

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

[7]  Q. Henry Wu,et al.  Group Search Optimizer: An Optimization Algorithm Inspired by Animal Searching Behavior , 2009, IEEE Transactions on Evolutionary Computation.

[8]  Martin Zachariasen,et al.  Tabu Search on the Geometric Traveling Salesman Problem , 1996 .

[9]  J Machta,et al.  Natural complexity, computational complexity and depth. , 2011, Chaos.

[10]  Nigel Shadbolt.  From the Editor in Chief: Nature-Inspired Computing , 2004, IEEE Intell. Syst..

[11]  Qian Kun-mina.  A parallel ant colony optimization algorithm based on fine-grained model with GPU-accelerated , 2009 .

[12]  D. Corneil,et al.  Efficient cluster compensation for lin-kernighan heuristics , 1999 .

[13]  ATSPDavid S. JohnsonAT.  Experimental Analysis of Heuristics for the Stsp , 2001 .

[14]  Wan Dan-ling.  Parallel genetic algorithm based on fine-grained model with GPU-accelerated , 2008 .

[15]  Linlin Liu,et al.  A Parallel Immune Algorithm Based on Fine-Grained Model with GPU-Acceleration , 2009, 2009 Fourth International Conference on Innovative Computing, Information and Control (ICICIC).

[16]  Panos M. Pardalos,et al.  Expanding Neighborhood GRASP for the Traveling Salesman Problem , 2005, Comput. Optim. Appl..

[17]  Z. Bar-Joseph,et al.  Algorithms in nature: the convergence of systems biology and computational thinking , 2011, Molecular systems biology.

[18]  Hong Liu,et al.  A novel approach to task assignment in a cooperative multi-agent design system , 2015, Applied Intelligence.

[19]  Adnan Acan,et al.  GAACO: A GA + ACO Hybrid for Faster and Better Search Capability , 2002, Ant Algorithms.

[20]  David S. Johnson,et al.  Experimental Analysis of Heuristics for the STSP , 2007 .

[21]  R. Johnstone,et al.  Social Feedback and the Emergence of Leaders and Followers , 2009, Current Biology.

[22]  Moritoshi Yasunaga,et al.  Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[23]  Wei Wang,et al.  A parallel immune algorithm for traveling salesman problem and its application on cold rolling scheduling , 2011, Inf. Sci..

[24]  William J. Cook,et al.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.

[25]  Georgios Dounias,et al.  Honey bees mating optimization algorithm for the Euclidean traveling salesman problem , 2011, Inf. Sci..

[26]  David Forbes.  Born leaders. , 1997, Nursing standard (Royal College of Nursing (Great Britain) : 1987).