Wyniki wyszukiwania - BazTech

1

Real power-system economic dispatch using a variable weights linear programming method

Rahli M., Benasla L., Belmadani A., Abdelhakem-Koridak L

Journal of Power Technologies

|

2015

|

Vol. 95, nr 1

34--39

EN

This paper presents an ecient method to solve an economic load dispatch problem with load flow type network security constraints: the active generation limits and line active power flows limits. A new form of linear programming method is proposed: a variable weights linear programming. The nonlinear dispatch problem is transformed into a linear one through variable weights linear programming. To achieve good linear, representation the nonlinear cost functions between the active generation limits are approximated by the sum of products of cost values multiplied by the variable weights. The nonlinear equality network constraint containing the losses expressed by the specially formulated and calculated function of generated powers is transformed into a linear one, the same manner as above. The set of nonlinear inequality constraints on line active power flows is linearly expressed in terms of active bus generation powers with upper limits on the active power flow to each violating lines. The dispatch problem transformed this manner with or without solving the load flow problem is demonstrated that the proposed method has practical application for real-time control/dispatch.

2

Harmony Search Algorithm to solve Dynamic Economic Environmental Dispatch (DEED)

Belmadani A., Benasla L., Rahli M.

Przegląd Elektrotechniczny

|

2011

|

R. 87, nr 9a

338-342

EN

This paper presents an application of Harmony Search algorithm (HSA) to solve the Dynamic Economic-Environmental Dispatch (DEED) problem under some equality and inequality constraints. The equality constraints reflect a real power balance, and the inequality constraint reflects the limits of real generation. The voltage levels and security are assumed to be constant. Dynamic Economic-Environmental Dispatch problem is obtained by considering both the economy and emission objectives. This bi-objective problem is converted into a single objective function using a price penalty factor. Harmony Search algorithm is tested on six generators system and its results are compared with the solutions obtained in paper of Keerati. The results are quite encouraging and useful in the economic emission environment.

PL

Zbadano zastosowanie algorytmu HSA do rozwiązania problemów dynamicznego rozsyłu energii. Uwzględniono realny balans mocy jak i realne ograniczenia. Algorytm przetestowano na sześciu systemach.

3

A Fast Harmony Search Algorithm for solving Economic Dispatch problem

Belmadani A., Benasal L., Rachli M.

Przegląd Elektrotechniczny

|

2010

|

R. 86, nr 3

274-278

EN

The Harmony Search Algorithm (HSA) is a newly developed meta-heuristic that uses a stochastic random search. The HSA is simple in concept, few in parameters and easy in implementation. Moreover, it does not require any derivative information. These features increase the applicability of the HSA, particularly in power system applications, where the problems have a large amount of variables and constraints. In this paper, a Fast method based on Harmony Search Algorithm (FHSA) for solving Economic Dispatch (ED) problem is proposed. The performance of FHSA is investigated and compared with HSA, Improved HSA (IHSA), Global HSA (GHSA) and Matpower method. Numerical results reveal that FHSA can find optimum solutions with reduced number of “improvisations” when compared to the other methods.

PL

Harmony Search Algorithm jest metodą meta-heurystyczną wykorzystującą poszukiwanie stochastyczne. Jest prosty w użyciu i nie wymaga informacji cząstkowej. Dlatego jest obecnie stosowany w optymalizacji systemów zasilania, gdzie problem składa się z wielu danych. A artykule przestawiono możliwość wykorzystania algorytmu do rozwiązania problemu ekonomicznego rozsyłu energii. Porównano różne metody. Wyniki wskazują, że szybki algorytm HSA pozwala znaleźć optymalne rozwiązanie z ograniczoną liczbą "improwizacji".