ST (Shafiabady-Teshnehlab) optimization algorithm

ST (Shafiabady-Teshnehlab) optimization algorithm

For access to this article, please select a purchase option:

Buy chapter PDF
(plus tax if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Swarm Intelligence -Volume 2: Innovation, new algorithms and methods — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Shafiabady-Teshnehlab (ST) optimization algorithm is a local swarm intelligence algorithm that has been inspired from the motion of the molecules in the air. Similar to all the other swarm optimization algorithms, the mentioned algorithm uses iterative approach by updating the values of the cells in each particle. This method is superior to conventional optimization algorithms because of its capability in finding the local minimum in very few and incomparably less numbers of iterations relative to other local optimization methods; hence, ST optimization algorithm leads to faster decisionmaking speed. The other specification of this algorithm is the precision and accuracy of the results in comparison with the algorithms in its own group. In addition, this algorithm has the ability to perform the optimization task accurately when dealing with several unknown values simultaneously; hence, increasing the dimensions of the search space does not deteriorate the optimization results like the other conventional algorithms. The only shortcoming of ST optimization algorithm is its local nature that makes it sensitive to the initial values that represent the particles in the search space. The various advantages of ST optimization method make it an appropriate local optimization algorithm.

Chapter Contents:

  • Abstract
  • 4.1 Introduction
  • 4.2 Computational swarm intelligence and ST optimization algorithm
  • 4.3 ST optimization algorithm
  • 4.3.1 The procedure of ST optimization algorithm
  • 4.3.2 Evaluation of performance of ST optimization algorithm
  • 4.4 Applications of ST optimization algorithm
  • 4.5 Summary
  • References

Inspec keywords: swarm intelligence; iterative methods; particle swarm optimisation

Other keywords: ST optimization algorithm; ST optimization method; appropriate local optimization algorithm; swarm optimization algorithms; conventional optimization algorithms; optimization task; Shafiabady-Teshnehlab optimization algorithm; local swarm intelligence algorithm

Subjects: Interpolation and function approximation (numerical analysis); Optimisation techniques; Numerical analysis; Interpolation and function approximation (numerical analysis); Optimisation techniques; Optimisation

Preview this chapter:
Zoom in

ST (Shafiabady-Teshnehlab) optimization algorithm, Page 1 of 2

| /docserver/preview/fulltext/books/ce/pbce119g/PBCE119G_ch4-1.gif /docserver/preview/fulltext/books/ce/pbce119g/PBCE119G_ch4-2.gif

Related content

This is a required field
Please enter a valid email address