Particle Swarm Optimization with Voronoi Neighborhood

سال انتشار: 1388
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 2,163

فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

CSICC14_074

تاریخ نمایه سازی: 24 خرداد 1388

چکیده مقاله:

Particle Swarm Optimization (PSO) is an optimization method that is inspired by nature and is used frequently nowadays. In this paper we proposed a new dynamic geometric neighborhood based on Voronoi diagram in PSO. Voronoi diagram is a geometric naturalistic method to determine neighbors in a set of particles. It seems that in realistic swarm, particles take Voronoi neighbors into account. Also a comparison is made between the performance of some traditional methods for choosing neighbors and new dynamic geometric methods like Voronoi and dynamic Euclidean. In this comparison it is found that PSO with geometric neighborhood can achieve better accuracy overall especially when the optimum value is out of the initial range.

نویسندگان

Ehsan Safavieh

of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran

Amin Gheibi

Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran Laboratory of Algorithms and Computational Geometry

Mohammadreza Abolghasemi

of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran

Ali Mohades

Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran Laboratory of Algorithms and Computational Geometry