Search Results

Now showing 1 - 6 of 6

Some of the metrics are blocked by your
consent settings
Optimal power flow problem solved by using Distributed Sobol particle swarm optimization
(2010-07-30)
Wannakarn, P.
;
Khamsawang, S.
;
Pothiya, S.
;
Jiriwibhakorn, S.
The Distributed Sobol particle swarm optimization (DSPSO) algorithm was studies for solving optimal power flow problem (OPF), in this paper. In the proposed method, swarm size of the particles is separated in multi-groups and searching procedure is divided according with the swarm group. Reducing search space and high cost elimination are concluded in the DSPSO. The DSPSO was tested for solving two sizes of the OPF problem, six bus test system and IEEE-30 bus test system respectively. The numerical results obtain from the DSPSO were compare with many optimization methods, namely bee colony algorithm (BA), differential evolution algorithm (DE), genetic algorithm (GA), particle swarm optimization (PSO) and tabu search algorithm (TSA). The results show that the proposed method had faster convergence and better solution than the rest methods.
Some of the metrics are blocked by your
consent settings
Hybrid PSO-DE for solving the economic dispatch problem with generator constraints
(2010-05-28)
Khamsawang, S.
;
Wannakarn, P.
;
Jiriwibhakorn, S.
This paper proposes an improved approach based on conventional particle swarm optimization (PSO) for solving an economic dispatch(ED) problem with considering the generator constraints. The mutation operators of the differential evolution (DE) are used for improving diversity exploration of PSO, which called hybrid particle swarm optimization - differential evolution (PSO-DE). The mutation operators are activated if velocity values of PSO nearly to zero or violated from the boundaries. Four scenarios of mutation operators are implemented for PSO-DE. The simulation results of all scenarios of the PSO-DE outperform over the PSO and other existing approaches which appeared in literatures. ©2010 IEEE.
Some of the metrics are blocked by your
consent settings
DSPSO-TSA for economic dispatch problem with nonsmooth and noncontinuous cost functions
(2010-02-01)
Khamsawang, S.
;
Jiriwibhakorn, S.
This paper proposes a new approach based on particle swarm optimization (PSO) and tabu search algorithm (TSA). This proposed approach is called distributed Sobol PSO and TSA (DSPSO-TSA). In order to improve the convergence characteristic and solution quality of searching process, three mechanisms had been presented. Firstly, the Sobol sequence is applied to generate an inertia factor instead of the existing process. Secondly, a distributed process is used so as to reach the global solution rapidly. The search process is divided to multi-stages and used a short-term memory for recognition the best search history. Finally, to guarantee the global solution, TSA had been activated to adjust the obtained solution of DSPSO algorithm. To show its effectiveness, the proposed DSPSO-TSA is applied to test four case studies of economic dispatch (ED) problem considering nonsmooth and noncontinuous fuel cost functions of generating units. The simulation results obtained from DSPSO-TSA are compared with conventional approaches such as genetic algorithm (GA), TSA, PSO, and others in literatures. The comparison results show that the efficiency of proposed approach can reach higher quality solution and faster computational time than the conventional methods. © 2009 Elsevier Ltd. All rights reserved.
Some of the metrics are blocked by your
consent settings
Solving the economic dispatch problem by using differential evolution
(2009-10-22)
Khamsawang, S.
;
Wannakarn, P.
;
Pothiya, S.
;
Jiriwibhakorn, S.
This paper proposes an application of the differential evolution (DE) algorithm for solving the economic dispatch problem (ED). Furthermore, the regenerating population procedure added to the conventional DE in order to improve escaping the local minimum solution. To test performance of DE algorithm, three thermal generating units with valve-point loading effects is used for testing. Moreover, investigating the DE parameters is presented. The simulation results show that the DE algorithm, which had been adjusted parameters, is better convergent time than other optimization methods. ©2009 IEEE.
Some of the metrics are blocked by your
consent settings
Distributed tabu search algorithm for solving the economic dispatch problem
(2004-12-01)
Khamsawang, S.
;
Pothiya, S.
;
Boonseng, C.
In this paper proposed a novel method based on simple Tabu Search Algorithm (TSA) to solves Economic Dispatch (ED) problem for thermal plants, which we call Distributed Tabu Search Algorithm (DTSA). This proposed method to improved TSA by addition distributed computation, local updating and global updating solutions to simple tabu search algorithm. The proposed method guarantees the near optimal solution and remarkably reduces the computation time. This proposed method is implemented with MATLAB program to solve economic dispatch problem with various case study. The results show that DTSA can converges to optimum solution faster than TSA and obtains the solution with high accuracy and less than Genetic Algorithm, Hopfield Neural Network and TSA. ©2004IEEE.
Some of the metrics are blocked by your
consent settings
Solving the economic dispatch problem with tabu search algorithm
(2002-01-01)
Khamsawang, S.
;
Boonseng, C.
;
Pothiya, S.
The application of Tabu Search Algorithm (TSA) technique to solve Economic Dispatch problem (ED) with non-smooth fuel cost function is reported in this paper. Results from MATLAB on Pentium III-500 MHz system for three case studies are presented. Effectiveness of method was compared with many conventional methods. Result shows that the proposed method can provide accurate solution with rapid convergence time and has the potential to be applied to other power engineering problem.

KMITL

Browse

Filters

Settings

Sort By

Results per page

Search Results