High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Solving Unit Commitment Problem Using Ant Colony Optimization (ACO) Technique

Author(s):

RAVI B. BALDANIYA , L.D.College of Engineering; H. D. MEHTA, L.D.College of Engineering

Keywords:

Unit Commitment, Ant Colony Optimization, Dynamic programming

Abstract

In this paper, Unit Commitment (UC) problem for generation scheduling using Ant Colony Optimization (ACO) technique has been carried out. UC is the process of determining which generators should be operated each day to meet the daily demand of the system at minimum cost.ACO technique is inspired by nature of search for food by real ants from its source to the destination by building the unique trail formation. This approach has been applied to a system comprised of 3 generating units. A MATLAB code has been generated for solving ant colony based unit commitment problem. Comparative analysis of results using dynamic programming and Ant Colony Optimization technique are presented which clearly indicate that execution time required by ACO technique is much less as compared to dynamic programming

Other Details

Paper ID: IJSRDV2I3156
Published in: Volume : 2, Issue : 3
Publication Date: 01/06/2014
Page(s): 333-336

Article Preview

Download Article