1.Division of System Simulation and Computer Application, Taiyuan University of Science and Technology, Taiyuan 0300242. College of Electrical and Information Engineering, Lanzhou University of Technology, Lanzhou 730050
Abstract As one of swarm intelligence optimization algorithms, the stochastic diffusion search is characterized by partial function evaluation and one-to-one recruitment mechanism. These characteristics make the algorithm high computation efficiency and robustness of the stochastic diffusion search.Based on the survey of basic principles and the research actuality of stochastic diffusion search, the existing problem and features are analyzed, and some future research directions about the stochastic diffusion search are delineated.
[1] Colorni A, Dorigo M, Maniezzo V. Distributed Optimization by Ant Colonies // Proc of the 1st European Conference on Artificial Life. Paris, France, 1991: 134-142 [2] Kennedy J, Eberhart R C. Particle Swarm Optimization // Proc of the IEEE International Conference on Neural Networks. Piscataway, USA, 1995: 1942-1948 [3] de Meyer K, Nasuto S J, Bishop J M. Stochastic Diffusion Search: Partial Function Evaluation in Swarm Intelligence Dynamic Optimisation // Abraham A, Grosam C, Ramos V, eds. Stigmergic Optimization, Studies in Computational Intelligence Series. Cambridge, USA: Springer-Verlag, 2006, 31: 185-207 [4] Bishop J M. Anarchic Techniques for Pattern Classification. Ph.D Dissertation. Berkshire, UK: University of Reading. Department of Cybernetics, 1989 [5] Nasuto S J, Bishop J M, Lauria S. Time Complexity Analysis of the Stochastic Diffusion Search // Proc of the International ICSC/IFAC Symposium on Neural Computation. Vienna, Austria, 1998: 260-266 [6] Bishop J M, Torr P. The Stochastic Search Network // Linggard R, Myers D J, Nightingale C, eds. Neural Networks for Images, Speech and Natural Language. New York, USA: Chapman & Hall, 1992: 370-387 [7] de Meyer K. Foundation of Stochastic Diffusion Search. Ph.D Dissertation. Berkshire, UK: University of Reading. Department of Cybernetics, 2004 [8] Nasuto S J, Bishop J M. Convergence Analysis of Stochastic Diffusion Search. Journal of Parallel Algorithms and Applications,1999, 14(2): 89-107 [9] Myatt D R, Bishop J M, Nasuto S J. Minimum Stable Convergence Criteria for Stochastic Diffusion Search. Electronic Letters, 2004, 40(2): 112-113 [10] Jones D. Constrained Stochastic Diffusion Search [EB/OL]. [2007-01-01]. http://www.cyber.reading.ac.uk/CIRG/SDP/Download/djonesscarp2002.ps [11] Nasuto S J. Resource Allocation Analysis of the Stochastic Diffusion Search. Ph.D Dissertation. Berkshire, UK: University of Reading. Department of Cybernetics, 1999 [12] Bonabeau E, Dorigo M, Theraulaz G. Inspiration for Optimization from Social Insect Behaviour. Nature, 2000, 406(6): 39-42 [13] de Meyer K, Bishop J M, Nasuto S J. Stochastic Diffusion: Using Recruitment for Search [EB/OL]. [2007-01-01]. http://www.cirg.reading.ac.uk/SDP/Download/Cica03.pdf [14] de Meyer K, Bishop J M, Nasuto S J. Small-World Effects in Lattice Stochastic Diffusion Search // Proc of the International Conference on Artificial Neural Networks. Madrid, Spain, 2002: 147-152 [15] Grech-Cini E. Locating Facial Features. Ph.D Dissertation. Berkshire, UK: University of Reading. Department of Cybernetics, 1995 [16] Beattie P. The Design and Implementation of a Focused Stochastic Diffusion Networks to Solve the Self-Location Problem on an Autonomous Wheelchair. Ph.D Dissertation. Berkshire, UK: University of Reading. Department of Cybernetics, 2000 [17] Bishop J M. A Hybrid Network for Feature Extraction [EB/OL]. [2007-01-01]. http://www.cirg.reading.ac.uk/SDP/Download/INNC90.pdf [18] Beattie P D, Bishop J M. Self-Localisation in the Senario Autonomous Wheelchair. Journal of Intelligent and Robotic Systems, 1998, 22(3/4): 255-267 [19] Hurley S, Whitaker R M. An Agent Based Approach to Site Selection for Wireless Networks // Proc of the ACM Symposium on Applied Computing. Madrid, Spain, 2002: 574-577 [20] Nasuto S J, Bishop J M. Neural Stochastic Diffusion Search Network-A Theoretical Solution to the Binding Problem // Proc of the 2nd Conference of the Association for the Scientific Study of Consciousness. Bremen, Germany, 1998: 19-20 [21] Nasuto S J, Dautenhahn K, Bishop J M. Communication as an Emergent Metaphor for Neuronal Operation // Nehariv C L, ed. Lecture Notes in Artificial Intelligence. Cambridge, USA: Springer-Verlag, 1999, 1562: 365-380 [22] de Meyer K, Bishop J M, Nasuto S J. Attention through Self-Synchronisation in the Spiking Neuron Stochastic Diffusion Network. Consciousness and Cognition, 2000, 9(2): 97-98
2008, Vol. 21 
