Probabilistic stochastic diffusion search

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Omran, M. G. H., & Salman, A. (2012). Probabilistic stochastic diffusion search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7461 LNCS, pp. 300–307). https://doi.org/10.1007/978-3-642-32650-9_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free