Abstract
Stochastic Diffusion Search (SDS) is a population-based, naturally inspired search and optimization algorithm. It belongs to a family of swarm intelligence (SI) methods. SDS is based on direct (one-to-one) communication between agents. SDS has been successfully applied to a wide range of optimization problems. In this paper we consider the SDS method in the context of unconstrained continuous optimization. The proposed approach uses concepts from probabilistic algorithms to enhance the performance of SDS. Hence, it is named the Probabilistic SDS (PSDS). PSDS is tested on 16 benchmark functions and is compared with two methods (a probabilistic method and a SI method). The results show that PSDS is a promising optimization method that deserves further investigation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Al-Rifaie, M., Bishop, M., Blackwell, M., An, T.: An investigation into the merger of stochastic diffusion search and particle swarm optimization. In: Proc. of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO 2011 (2011)
Bishop, J.M.: Stochastic Searching Networks. In: Proc. 1st IEE Conf. on Artificial Neural Networks, London, pp. 329–331 (1989)
Bishop, J.M., Torr, P.: The Stochastic Search Network. In: Linggard, R., Myers, D.J., Nightingale, C. (eds.) Neural Networks for Images, Speech and Natural Language, pp. 370–387. Chapman & Hall (1992)
SDS: Stochastic Diffusion Search (2011), http://www.doc.gold.ac.uk/~mas02mb/sdp/index.html (access date: August 9, 2011)
Kroese, D., Porotsky, S., Rubinstein, R.: The Cross-Entropy Method for Continuous Multi-extremal Optimization. Methodology and Computing in Applied Probability 8, 383–407 (2006)
Larranaga, P., Lozano, J.: Estimation of Distribution Algorithms: a new tool for evolutionary computation. Kluwer Academic editors (2002)
Nasuto, S.J., Bishop, J.M., Lauria, L.: Time Complexity of Stochastic Diffusion Search. In: Neural Computation, Vienna, Austria (1998)
Nasuto, S.J., Bishop, J.M.: Convergence Analysis of Stochastic Diffusion Search. Journal of Parallel Algorithms and Applications 14(2), 89–107 (1999)
Omran, M., Engelbrecht, A.: Free Search Differential Evolution. In: The Proc. of the IEEE Congress on Evolutionary Computation (CEC 2009), Norway, pp. 110–117 (2009)
Omran, M., Moukadem, I., Al-Sharhan, S., Kinawi, M.: Stochastic Diffusion Search for Continuous Global Optimization. In: The Proc. of the International Conference on Swarm Intelligence (ICSI 2011), Cergy, France (June 2011)
Pelikan, M., Sastry, K., Cantu-Paz, E.: Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications. Springer (2006)
Robinstein, R., Kroese, D.: The cross-entropy method: a unified approach to combinatorial optimization. Monte-Carlo simulations and machine learning. Springer-Verlag (2004)
Suganthan, P., Hansen, N., Liang, J., Deb, K., Chen, Y., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the CEC2005 special session on real-parameter optimization. Technical report, Nanyang Technology University, Singapore (2005)
Whitaker, R.M., Hurley, S.: An agent based approach to site selection for wireless networks. In: Proc. ACM Symposium on Applied Computing, Madrid, pp. 574–577 (2002)
Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics 1, 80–83 (1945)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Omran, M.G.H., Salman, A. (2012). Probabilistic Stochastic Diffusion Search. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2012. Lecture Notes in Computer Science, vol 7461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32650-9_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-32650-9_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32649-3
Online ISBN: 978-3-642-32650-9
eBook Packages: Computer ScienceComputer Science (R0)