Post Reply 
New Scout Optimization Algorithm
01-14-2019, 10:13 PM
Post: #1
New Scout Optimization Algorithm
Hi All,

I just posted my new Scout Optimization Algorithm (SOA) on my web site. Click here to see my new articles page. The new algorithm is the bottom-most entry. There are two links. One to download the PDF file and one to download the various files. I coded the algorithm in MATLAB. The article present various versions of SOA. It is a labor of love that has taken me two moths to work through several generations of the set of SOA functions.

Enjoy!

Namir
Find all posts by this user
Quote this message in a reply
01-15-2019, 09:26 AM (This post was last modified: 01-15-2019 09:28 AM by pier4r.)
Post: #2
RE: New Scout Optimization Algorithm
request: it wouldn't be bad if you put a little abstract here, for reference, understanding, searches and indexing by search engines, archival and other reasons .

The same on you page listing the work. Not everyone is willing to peruse articles with only the title as description. Time is short and the internet is full.

Wikis are great, Contribute :)
Find all posts by this user
Quote this message in a reply
01-15-2019, 09:56 AM
Post: #3
RE: New Scout Optimization Algorithm
This, superficially at least, resembles a pattern search which is a more systematic version of a direct search. I've not read all 155 pages and couldn't find a references section, so I could easly be wrong.

How does it compare to historic implementations of these?


Pauli
Find all posts by this user
Quote this message in a reply
01-15-2019, 12:47 PM
Post: #4
RE: New Scout Optimization Algorithm
I do state in the first paragraph that it is inspired by the Fireworks Algorithm (Y. Tan, Y. Zhu (2010) ). One of teh authors write a whole book about that algorithm. I will add a reference to Fireworks Algorithm in the next update.

Namir
Find all posts by this user
Quote this message in a reply
01-15-2019, 01:58 PM
Post: #5
RE: New Scout Optimization Algorithm
The first generation model for the Scout Optimization Algorithm (SOA) has pods that land randomly in the trust region. Each pod launches a group of scouts that search in the viscinity. The location of the pds remain fixed.

In the second generation of SOA, the pods also explore finding better locations. The scout's location are also influenced by the new pod location and are attracted by better pod location. Introducing the concept of modible pods resulted in signficiant improvement in the results for all the vaersions of SOA function. The study I posted only deals with the second gneration of the SOA functions.

Namir
Find all posts by this user
Quote this message in a reply
01-20-2019, 08:10 PM
Post: #6
RE: New Scout Optimization Algorithm
I updated my Scout Algorithm document (and listing). As requested, I added many references and tweaked the study's text a bit. Click here to visit my web page and download the pdf file and other files by locating the bottom most item in that page.

Enjoy!

Namir
Find all posts by this user
Quote this message in a reply
Post Reply 




User(s) browsing this thread: 1 Guest(s)