Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

TÜBİTAK

Turkish Journal of Electrical Engineering and Computer Sciences

Journal

2010

Particle swarm optimization

Articles 1 - 2 of 2

Full-Text Articles in Physical Sciences and Mathematics

Stpso: Strengthened Particle Swarm Optimization, Ai̇şe Zülal Şevkli̇, Fati̇h Erdoğan Sevi̇lgen Jan 2010

Stpso: Strengthened Particle Swarm Optimization, Ai̇şe Zülal Şevkli̇, Fati̇h Erdoğan Sevi̇lgen

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper, we present a novel approach to strengthen Particle Swarm Optimization (PSO). PSO is a population-based metaheuristic that takes advantage of individual memory and social cooperation in a swarm. It has been applied to a variety of optimization problems because of its simplicity and fast convergence. However, straightforward application of PSO suffers from premature convergence and lack of intensification around the local best locations. To rectify these problems, we modify update procedure for the best particle in the swarm and propose a simple and random moving strategy. We perform a Reduced Variable Neighborhood Search (RVNS) based local search …


Performance Analysis Of Swarm Optimization Approaches For The Generalized Assignment Problem In Multi-Target Tracking Applications, Ali̇ Önder Bozdoğan, Asim Egemen Yilmaz, Murat Efe Jan 2010

Performance Analysis Of Swarm Optimization Approaches For The Generalized Assignment Problem In Multi-Target Tracking Applications, Ali̇ Önder Bozdoğan, Asim Egemen Yilmaz, Murat Efe

Turkish Journal of Electrical Engineering and Computer Sciences

The aim of this study is to investigate the suitability of selected swarm optimization algorithms to the generalized assignment problem as encountered in multi-target tracking applications. For this purpose, we have tested variants of particle swarm optimization and ant colony optimization algorithms to solve the 2D generalized assignment problem with simulated dense and sparse measurement/track matrices and compared their performance to that of the auction algorithm. We observed that, although with some modification swarm optimization algorithms provide improvement in terms of speed, they still fall behind the auction algorithm in finding the optimum solution to the problem. Among the investigated …