Tabu search-enhanced artificial bee colony algorithm to solve profit-based unit commitment problem with emission limitations in deregulated electricity market Online publication date: Mon, 20-Mar-2017
by C. Shanmuga Sundaram; M. Sudhakaran; P. Ajay-D-Vimal Raj
International Journal of Metaheuristics (IJMHEUR), Vol. 6, No. 1/2, 2017
Abstract: This paper proposes a new foraging ABC algorithm that integrates the features of ABC and Tabu search (TS) to solve the profit-based unit commitment (PBUC) problem in deregulated electricity market with emission limitations. The multiobjective optimisation problem is formulated to maximise the profit and minimise the pollutants into the atmosphere by satisfying all the system constraints. ABC algorithm is applied to solve the 1-0 part of the PBUC problem and lambda iterative method optimises the economic load dispatch problem. The ideas of Tabu array (TA) and logical aspiration factor are applied to adjust the search process in the solution space. The proposed TS-enhanced ABC algorithm is verified on IEEE 39 bus test system having 10 generating units for 24-h load pattern. The solutions of traditional UC and PBUC with and without emission limitations are compared with improved ABC shuffled frog leaping algorithm, Muller's and ACO method.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook