Path: Top -> Journal -> Telkomnika -> 2014 -> Vol 12, No 4: December

Complex Optimization problems Using Highly Efficient Particle Swarm Optimizer

Complex Optimization problems Using Highly Efficient Particle Swarm Optimizer

Journal from gdlhub / 2016-11-15 03:31:01
Oleh : Kaiyou Lei, Changjiu Pu, Telkomnika
Dibuat : 2014-12-01, dengan 1 file

Keyword : particle swarm optimizer, complex optim ization problem, premature convergence
Url : http://journal.uad.ac.id/index.php/TELKOMNIKA/article/view/535

Many engineering problems are the complex optimization problems with the large numbers of global and local optima, due to its complexity, general particle swarm optimization methods are slow speed on convergence and easy to be trapped in local optima. In this paper, a highly efficient particle swarm optimizer is proposed, which employ the dynamic transition strategy of inertia factor, search space and velocity in each cycle to plan large-scale space global search and refined local search as a whole according to the fitness change of swarm in optimization process of the engineering problems, and to quicken convergence speed, avoid premature problem, economize computational expenses, and obtain global optimum. Several complex benchmark functions are used to testify the new algorithm and the results showed clearly the revised algorithm can rapidly converge at high quality solutions.

Deskripsi Alternatif :

Many engineering problems are the complex optimization problems with the large numbers of global and local optima, due to its complexity, general particle swarm optimization methods are slow speed on convergence and easy to be trapped in local optima. In this paper, a highly efficient particle swarm optimizer is proposed, which employ the dynamic transition strategy of inertia factor, search space and velocity in each cycle to plan large-scale space global search and refined local search as a whole according to the fitness change of swarm in optimization process of the engineering problems, and to quicken convergence speed, avoid premature problem, economize computational expenses, and obtain global optimum. Several complex benchmark functions are used to testify the new algorithm and the results showed clearly the revised algorithm can rapidly converge at high quality solutions.

Beri Komentar ?#(0) | Bookmark

PropertiNilai Properti
ID Publishergdlhub
OrganisasiTelkomnika
Nama KontakHerti Yani, S.Kom
AlamatJln. Jenderal Sudirman
KotaJambi
DaerahJambi
NegaraIndonesia
Telepon0741-35095
Fax0741-35093
E-mail Administratorelibrarystikom@gmail.com
E-mail CKOelibrarystikom@gmail.com

Print ...

Kontributor...

  • , Editor: sukadi

Download...

  • Download hanya untuk member.

    535-2459-1-PB
    Download Image
    File : 535-2459-1-PB.pdf

    (147654 bytes)