z-logo
open-access-imgOpen Access
A Modified Ant Colony Optimization Algorithm for Power Scheduling
Author(s) -
Vijo M. Joy*,
Sukumarapillai Krishnakumar
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.j1175.0981119
Subject(s) - backpropagation , ant colony optimization algorithms , maxima and minima , computer science , mathematical optimization , artificial neural network , ant colony , scheduling (production processes) , algorithm , electric power system , power (physics) , artificial intelligence , mathematics , mathematical analysis , physics , quantum mechanics
The purpose of this work is to solve the problems related to the power system in an efficient manner by assigning the optimal values. To meet the demand loads with good quality and quantity is a challenging problem in the field of the power system. Artificial Neural Network is realized in the field of energy management and load scheduling. The Backpropagation algorithm is used for the training purpose. It has the aspects of the quick meeting on the local bests but it gets stuck in local minima. To overcome this drawback an Ant Colony Optimization algorithm is presented to allocate optimal output values for the power system. This has the capacity for searching the global optimal solution. Present work modifies the ant colony optimization algorithm with backpropagation. This hybrid algorithm accelerates the network and improves its accuracy. The ant colony optimization algorithms provide an accurate optimal combination of weights and then use backpropagation technique to obtain the accurate optimal solution rapidly. The result shows that the present system is more efficient and effective. These algorithms significantly reduce the peak load and minimize the energy consumption cost

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here