{"id":144,"date":"2017-03-12T05:52:46","date_gmt":"2017-03-12T05:52:46","guid":{"rendered":"https:\/\/fbln.me\/fss\/?page_id=144"},"modified":"2017-07-26T17:05:28","modified_gmt":"2017-07-26T17:05:28","slug":"versions","status":"publish","type":"page","link":"https:\/\/fbln.me\/fss\/versions\/","title":{"rendered":"Versions"},"content":{"rendered":"

List of Versions Produced at CIRG @ POLI\/UPE<\/a><\/span><\/h4>\n
<\/div>\n
<\/div>\n
\n

FSS-SAR (Stagnation Avoidance Routine)\u00a0\u00a0\u00a0\u00a0 <\/span> STATUS: Delivered and Published in 2016<\/span><\/span><\/b>
\n This version uses a stagnation avoidance routine devised for the FSS with the goal of improve the convergence capability of the algorithm when solving very smooth or plateau containing search spaces.\u00a0 <\/span><\/span>[Available on-line here]<\/span><\/span><\/span><\/a><\/p>\n

\n

MOFSS (Multi-Objective FSS) <\/span> STATUS: Delivered and Published in 2015<\/span><\/span><\/b>
\n This version allows the optimization of problems with two or more conflicting objectives, Incorporating the dominance concept within the traditional FSS operators and adapting the barycenter concept deployed in the original FSS. <\/span><\/span>[Available on-line here]<\/span><\/span><\/span><\/a><\/p>\n

\n

wFSS (Weight based FSS) <\/span> STATUS: Delivered and Published in 2014<\/span><\/span><\/b>
\n The chief modification to standard FSS, in order to produce the wFSS, was the introduction of a relationship among fish solely relying on factual already existing indications of individual success. The implementation resulted in a lighter algorithm (when compared to other FSS attempts to solve multimodal problems) and a method that produces more suitable solution candidates for optimization problems. <\/span><\/span>[Available on-line here]<\/span><\/span><\/span><\/a><\/p>\n

\n

MTFSS (Multithreaded FSS) <\/span> STATUS: Delivered and Published in 2014<\/span><\/span><\/b>
\n In this approach, each fish has its behavior executed within an individual thread, of which creation, execution and death are managed by the runtime environment and the operating system. <\/span><\/span>[Available on-line here]<\/span><\/span><\/span><\/a><\/p>\n

\n

BFSS (Binary FSS) <\/span> STATUS: Delivered and Published in 2014<\/span><\/span><\/b>
\nThis version is intended to cope with premature convergence using binary encoding scheme for the internal mechanisms of the fish school search. <\/span><\/span>[Available on-line here]<\/span><\/span><\/span><\/a><\/p>\n

\n

FSS-II <\/span> STATUS: Delivered and Published in 2013<\/span><\/span><\/b>
\nThis version features three advantages over the original FSS: high exploitation capability, just one fitness evaluation per fish per iteration and easy implementation. <\/span><\/span>[Available on-line here]<\/span><\/span><\/span><\/a><\/p>\n

\n

pFSS (Parallel FSS)<\/span> STATUS: Delivered and Published in 2012<\/span><\/span><\/b>
\nThis version uses graphics hardware acceleration platforms. The computation time was significantly reduced and better optimization results were obtained more quickly with GPU parallel computing.<\/span><\/span> [Available on-line here]<\/span><\/span><\/a><\/span><\/p>\n

\n
\n

dFSS (Density Based FSS)<\/span> STATUS: Delivered and Published in 2011<\/span> <\/span><\/b>
\nThis version excels for multimodal hyper-dimensional functions. It includes modifications in the previous operators: Feeding and Swimming, as well as new<\/span><\/span>: Memory and Partition operators. The latter two were introduced to acount for the partition of the main school into subgroups. Some changes were also included in the stop conditions that now also have to consider subswarms. [Available on-line here]<\/span><\/a><\/span><\/p>\n

\n
\n

FSS (Vanilla Version)<\/span> STATUS: Delivered and Published in 2008<\/span><\/b>
\nThis version excels for unimodal hyper-dimensional functions. It includes two operators: Feeding and Swimming (considering individual, collective-instinctive and collective-volitive movements). S<\/span><\/span>top conditions conceived for FSS are as follows: limit of cycles, time limit, minimum school radius, maximum school weight or optimization error). [Available on-line here]<\/span><\/span><\/a><\/span><\/p>\n

\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

List of Versions Produced at CIRG @ POLI\/UPE FSS-SAR (Stagnation Avoidance Routine)\u00a0\u00a0\u00a0\u00a0 STATUS: Delivered and Published in 2016 This version uses a stagnation avoidance routine devised for the FSS with the goal of improve the convergence capability of the algorithm when solving very smooth or plateau containing search spaces.\u00a0 [Available on-line here] MOFSS (Multi-Objective FSS) … Continue reading Versions<\/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\/144"}],"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=144"}],"version-history":[{"count":22,"href":"https:\/\/fbln.me\/fss\/wp-json\/wp\/v2\/pages\/144\/revisions"}],"predecessor-version":[{"id":543,"href":"https:\/\/fbln.me\/fss\/wp-json\/wp\/v2\/pages\/144\/revisions\/543"}],"wp:attachment":[{"href":"https:\/\/fbln.me\/fss\/wp-json\/wp\/v2\/media?parent=144"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}