Particle swarm optimization performance on special linear programming problems
Yükleniyor...
Dosyalar
Tarih
2010
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Academic Journals
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Linear programming (LP) is one of the best known optimization problems solved generally with Simplex Method. Most of the real life problems have been modeled as LP. The solutions of some special LP problems exhibiting cycling have not been studied except for the classical methods. This study, aimed to solve some special LP problems, exhibit cycling with Particle Swarm Optimization (PSO) and to show PSO performance for these problems. So, some special problems taken from literature have been solved with PSO. Results taken from Genetic Algorithm (GA) and PSO have been compared with the reference. The results have shown that PSO performance is generally better than GA in view of optimality and solution time. And it is also proposed that cycling problems are used for testing the performance of new developed algorithms like Numerical Benchmark Functions.
Açıklama
WOS: 000279559900013
Anahtar Kelimeler
LP, cycling, PSO
Kaynak
Scientific Research And Essays
WoS Q Değeri
Q3
Scopus Q Değeri
N/A
Cilt
5
Sayı
12
