>
Fa   |   Ar   |   En
   Comparison of different heuristic algorithms for location and value determination of STATCOM providing minimum losses in power systems  
   
نویسنده alcan yalçın ,öztürk ali ,dirik hasan ,demir memnun
منبع pamukkale university journal of engineering sciences - 2017 - دوره : 23 - شماره : 5 - صفحه:550 -558
چکیده    One of the most important issues of studies that have been done on the power systems is loss reduction. flexible a. c. transmission systems (facts) give significant opportunities to realize this aim. static synchronous compensators (statcoms) are the most flexible and sophisticated structure as compared to the other facts devices in terms of operation. total losses of a power system change according to the location and reactive power output of statcom. in this work, it is aimed to find optimum location and output value of a statcom that provide minimum losses of power system by using four different heuristic algorithms and to compare these algorithms. heuristic algorithms that are used in this paper are gravitational search algorithm (gsa), particle swarm optimization (pso), artificial bee colony (abc) and ant colony algorithm (aca) respectively. these methods were applied to ieee-14 bus test system, and optimum locations and output values of statcoms that provide minimum losses have been found. also, results of all methods are compared and discussed in terms of finding proper value and convergence speed.
کلیدواژه Optimal location ,STATCOM ,Gravitational search algorithm ,Particle swarm optimization ,Artificial bee colony ,Ant colony algorithm
آدرس sinop üniversitesi, meslek yüksekokulu, elektrik-enerji bölümü, Türkiye, düzce üniversitesi, mühendislik fakültesi, elektrik-elektronik mühendisliği bölümü, Türkiye, sinop üniversitesi, meslek yüksekokulu, elektrik-enerji bölümü, Türkiye, sinop üniversitesi, gerze meslek yüksekokulu, bilgi teknolojileri bölümü, Türkiye
پست الکترونیکی mdemir@sinop.edu.tr
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved