User:P.ranjansingh68/SPIDER MONKEY OPTIMIZATION

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

This is not a Wikipedia article: It is an individual user's work-in-progress page, and may be incomplete and/or unreliable. For guidance on developing this draft, see Wikipedia:So you made a userspace draft.

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL
Easy tools: Citation bot (help) | Advanced: Fix bare URLs
This page was last edited by 103.243.237.5 (talk | contribs) 10 years ago. (Update timer)

Finished writing a draft article? Are you ready to request an experienced editor review it for possible inclusion in Wikipedia? Submit your draft for review!

Spider Monkey Optimization (SMO) is a recent addition in the field of nature inspired optimization algorithms developed by Bansal et al. [1] SMO is based on the intelligent foraging behaviour of spider monkeys. SMO can be broadly classified as a computational intelligence technique for global optimization.

Background

Before, designing a new swarm intelligence based algorithm, it must understand that whether a behaviour is swarm intelligence or not. Two approaches Division of Labour and Self-Organization are the necessary and sufficient conditions for obtaining intelligent swarming behaviours mentioned by Karaboga et.al.

Development of SMO

This page is under progress.

Algorithm

Main steps of Spider Monkey Optimization algorithm(SMO) Similar to the other population-based algorithms, SMO is a trial and error based collaborative iterative process.
There are two important parameter of this algorithm:
1) GlobalLeaderLimit.
2) LocalLeaderLimit.

References

www.example.com