Paper Title
Ant Lion Optimizer for Solving Unit Commitment Problem

This paper presents a new technique to solve unit commitment problem using Ant Lion Optimizer (ALO). ALO is inspired by the hunting mechanism of ant lions in nature. It has fast convergence speed due to the use of roulette wheel selection technique. A 10-unit system with the constraints, such as power balance, spinning reserve, generation limit, minimum up and down time constraints are considered to illustrate the effectiveness of the proposed method. The performance of the proposed algorithm are compared with the performance of Dynamic Programming (DP). Test results showed that the proposed ALO technique can obtain a higher quality solution with better performance in terms of convergence time and improvement of the cost solution quality. Index Terms- Ant Lion Optimizer, Dynamic Programming, Unit Commitment.