Numerical Recipes in C++: the art of scientific computing
Numerical Recipes in C++: the art of scientific computing
Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization
Journal of Heuristics
Optimization and Knowledge-Based Technologies
Informatica
A binary-real-coded differential evolution for unit commitment problem: a preliminary study
MIWAI'11 Proceedings of the 5th international conference on Multi-Disciplinary Trends in Artificial Intelligence
A real-integer-discrete-coded differential evolution
Applied Soft Computing
| Hi-index | 0.00 |
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determine the generation schedule which minimizes the total operating cost over a given time horizon subject to a variety of constraints. Through its use of enhanced acceleration and migration processes, the IDE method limits the population size required in the search procedure and is therefore an ideal candidate for the solution of large-scale combinatorial optimization problems. The effectiveness of the proposed approach is verified by performing a series of simulations based upon the practical Tai-Power System (TPS) and various other power systems presented in the literature. In general, the results show that the IDE scheme outperforms existing deterministic and stochastic optimization methods both in terms of the quality of the solutions obtained and the computational cost. Furthermore, it is found that the magnitude of the cost savings achieved by the IDE scheme compared to that obtained by the other optimization techniques increases as the number of generating units within the power system increases. Therefore, the proposed scheme represents a particularly effective technique for the solution of large-scale UC problems.