A Seeded Memetic Algorithm for Large Unit Commitment Problems
Journal of Heuristics
A comprehensive analysis of hyper-heuristics
Intelligent Data Analysis
A hyper-heuristic approach for the unit commitment problem
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
Hi-index | 0.00 |
This paper presents an experimental comparison of a selection hyperheuristic approach with several heuristic selection and move acceptance strategy combinations for the Short-Term Electrical Power Generation Scheduling problem. Tests are performed to analyze the efficiency of the combinations using problem instances taken from literature. Results show that the hyper-heuristic using the random permutation descent heuristic selection method and the only improving move acceptance scheme achieves the best results on the chosen problem instances. Because of the promising results, research will continue for further enhancements.