A hyper-heuristic approach for the unit commitment problem

Authors:
Argun Berberoğlu;A. Şima Uyar
Affiliations:
Informatics Institute, Istanbul Technical University;Department of Computer Engineering, Istanbul Technical University, Maslak, Turkey
Venue:
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
Year:
2010

Citing 3
Cited 1

A Seeded Memetic Algorithm for Large Unit Commitment Problems

Journal of Heuristics
A comprehensive analysis of hyper-heuristics

Intelligent Data Analysis
An experimental study on hyper-heuristics and exam timetabling

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI

Experimental comparison of selection hyper-heuristics for the short-term electrical power generation scheduling problem

EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a hyper-heuristic approach for the Unit Commitment Problem (UCP). Tests are performed using benchmark data from literature and real-world data from the Turkish interconnected power network. The proposed hyper-heuristic and several methods applied previously to the UCP, are compared. Results show that the hyper-heuristic method achieves good results in all test sets. Furthermore, it is also a robust method for increased problem sizes without the need for parameter tuning. Based on the promising results, research will continue for further improvements.