A binary-real-coded differential evolution for unit commitment problem: a preliminary study

Authors:
Saptarshi Dutta;Dilip Datta
Affiliations:
Department of Mechanical Engineering, Royal School of Engineering and Technology, Royal Group of Institutions, Guwahati, India;Department of Mechanical Engineering, National Institute of Technology, Silchar, India
Venue:
MIWAI'11 Proceedings of the 5th international conference on Multi-Disciplinary Trends in Artificial Intelligence
Year:
2011

Citing 8
Cited 1

A Seeded Memetic Algorithm for Large Unit Commitment Problems

Journal of Heuristics
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization

Journal of Heuristics
Binary differential evolution for the unit commitment problem

Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems

Informatica
Unit commitment problem using enhanced particle swarm optimization algorithm

Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special issue on Bio-inspired Learning and Intelligent Systems
A deterministic annular crossover genetic algorithm optimisation for the unit commitment problem

Expert Systems with Applications: An International Journal
A real-integer-discrete-coded differential evolution algorithm: a preliminary study

EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization

A real-integer-discrete-coded differential evolution

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to its economical importance, the unit commitment problem has become a matter of concern in power systems, and consequently an important area of research. It is a nonlinear mixed-integer optimization problem, in which a given number of power generating units are to be scheduled in such a way that the forecasted demand is met at minimum production cost over a time horizon. In this paper a binary-real-coded differential evolution along with some repairing mechanisms is investigated as the solution technique of the problem. In the computational experiment carried out with a hypothetical 10-unit power system over 24-hour time horizon, available in the literature, the proposed technique is found outperforming all the existing methods.