A new approach for unit commitment problem via binary gravitational search algorithm

• Binary gravitational search algorithm (BGSA) is proposed to solve unit commitment.
• BGSA based on priority list is adopted to optimize on/off status of units.
• Decommitment of excess units is devised to improve the properties of BGSA.
• Heuristic search strategy is applied to repair minimum up/down time constraints.
• BGSA is expanded to solve mixed integer nonlinear optimization problem.

This paper proposes a new gravitational search algorithm to solve the unit commitment (UC) problem, which is integrated binary gravitational search algorithm (BGSA) with the Lambda-iteration method. The proposed method is enhanced by priority list based on the unit characteristics and heuristic search strategies to repair the spinning reserve and minimum up/down time constraints. Furthermore, local mutation strategies are applied to improve the performance of BGSA. The implementation of the proposed method for UC problem consists of three stages. Firstly, the BGSA based on priority list is applied for solution unit scheduling when neglecting minimum up/down time constraints. Secondly, heuristic search strategies are used to handle minimum up/down time constraints and decommit excess spinning reserve units. Thirdly, local mutation strategies are raised to avoid premature convergence of the algorithm and prevent it from trapping into local optima. Finally, Lambda-iteration method is adopted to solve economic load dispatch based on the obtained unit schedule. The feasibility and effectiveness of the proposed method is verified by the systems with the number of units in the range of 10–100 and the results are compared with those of other methods reported in literatures. The results clearly show that the proposed method gives better quality solutions than other methods.

Gravitational search algorithm for solving UCP.Figure optionsDownload as PowerPoint slide