{"id":72,"date":"2017-03-11T06:16:02","date_gmt":"2017-03-11T06:16:02","guid":{"rendered":"https:\/\/fbln.me\/fss\/?page_id=72"},"modified":"2017-06-16T22:46:49","modified_gmt":"2017-06-16T22:46:49","slug":"about-fss","status":"publish","type":"page","link":"https:\/\/fbln.me\/fss\/about-fss\/","title":{"rendered":"About FSS"},"content":{"rendered":"<h5><b>What is FSS?<\/b><\/h5>\n<p><span style=\"font-size: small;\"><a href=\"https:\/\/en.wikipedia.org\/wiki\/Fish_School_Search\">FSS<\/a> is a family of algorithms suited for optimization in high-dimensional search spaces. All fish perform local search and the school aggregates social information.<\/span><\/p>\n<h5><b>Why using FSS?<\/b><b><br \/>\n<\/b><\/h5>\n<p><span style=\"font-size: small;\"><a href=\"https:\/\/en.wikipedia.org\/wiki\/Fish_School_Search\">FSS<\/a> is fast, it outperforms most other Swarm Intelligent algorithms and is computationally inexpensive. New investigations also show that <a href=\"https:\/\/en.wikipedia.org\/wiki\/Fish_School_Search\">FSS <\/a>is easy to go-GPU.<\/span><\/p>\n<h5><b>Principles of FSS?<\/b><\/h5>\n<p><span style=\"font-size: small;\">(i) Simple computations in all individuals (i.e. fish)<br \/>\n(ii) Various means of storing information (i.e. weights of fish and school barycenter)<br \/>\n(iii) Local computations (i.e. swimming is composed of distinct components)<br \/>\n(iv) Low communications between neighboring individuals (i.e. fish are to think local but also be socially aware)<br \/>\n(v) Minimum centralized control (mainly for self-controlling of the school radius)<br \/>\n(vi) Some distinct diversity mechanisms (this to avoid undesirable flocking behavior)<br \/>\n(vii) Scalability (in terms of complexity of the optimization\/search tasks)<br \/>\n(viii) Autonomy (i.e. ability to self control functioning)<\/span><\/p>\n<h5><b>Rationale?<\/b><\/h5>\n<p>1. <span style=\"font-size: small;\">&#8216;Swimming&#8217; actually is a means of: <\/span><\/p>\n<ul>\n<li><span style=\"font-size: small;\">Performing a local search<\/span><\/li>\n<li><span style=\"font-size: small;\">Storing information of success<\/span><\/li>\n<li><span style=\"font-size: small;\">Indirectly conveying social information<\/span><\/li>\n<\/ul>\n<p>2. <span style=\"font-size: small;\">Success of the search is given by: <\/span><\/p>\n<ul>\n<li><span style=\"font-size: small;\">Fish weights (large is better)<\/span><\/li>\n<li><span style=\"font-size: small;\">School radius (small is better &#8211; meaning more heavy fishes)<\/span><\/li>\n<li><span style=\"font-size: small;\">School barycenter (closer to optima is better)<\/span><\/li>\n<\/ul>\n<p>3. <span style=\"font-size: small;\">Non-monotonicity is achieved, e.g.: <\/span><\/p>\n<ul>\n<li><span style=\"font-size: small;\">By random hesitation before swim<\/span><\/li>\n<li><span style=\"font-size: small;\">By expansion\/shrinking the school radius<\/span><\/li>\n<li><span style=\"font-size: small;\">By variations on swimming components<\/span><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>What is FSS? FSS is a family of algorithms suited for optimization in high-dimensional search spaces. All fish perform local search and the school aggregates social information. Why using FSS? FSS is fast, it outperforms most other Swarm Intelligent algorithms and is computationally inexpensive. New investigations also show that FSS is easy to go-GPU. Principles &hellip; <a href=\"https:\/\/fbln.me\/fss\/about-fss\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">About FSS<\/span><\/a><\/p>\n","protected":false},"author":3,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/fbln.me\/fss\/wp-json\/wp\/v2\/pages\/72"}],"collection":[{"href":"https:\/\/fbln.me\/fss\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/fbln.me\/fss\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/fbln.me\/fss\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/fbln.me\/fss\/wp-json\/wp\/v2\/comments?post=72"}],"version-history":[{"count":9,"href":"https:\/\/fbln.me\/fss\/wp-json\/wp\/v2\/pages\/72\/revisions"}],"predecessor-version":[{"id":449,"href":"https:\/\/fbln.me\/fss\/wp-json\/wp\/v2\/pages\/72\/revisions\/449"}],"wp:attachment":[{"href":"https:\/\/fbln.me\/fss\/wp-json\/wp\/v2\/media?parent=72"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}