An effectively adaptive selective cuckoo search algorithm for solving three complicated short-term hydrothermal scheduling problems

Highlights: • A new ASCSA method is proposed by applying two new techniques on conventional CSA. • Complicated constraints are properly handled in hydrothermal scheduling problems. • The ASCSA reaches a high success rate and fast convergence to the optimal solution. • The proposed ASCSA is more effective and robust than CSA and many other methods. This paper proposes an effectively adaptive selective cuckoo search algorithm (ASCSA) for solving short-term hydrothermal scheduling problems with available water constraint, reservoir volume constraints, and transmission network constraints. The proposed ASCSA is a newly improved version of the conventional cuckoo search algorithm to enhance the solution quality and reduce the maximum number of iterations based on two new techniques including the new ratio of the difference between the fitness function values and the integration of solutions into one group. The effectiveness of ASCSA has been validated via eight hydrothermal systems, in which the last two systems consisting of the IEEE 30-bus and IEEE 118-bus systems are considered with a set of constraints in the transmission network. To investigate the performance of ASCSA, several algorithms are also implemented in the paper such as conventional cuckoo search algorithm, modified cuckoo search algorithm, particle swarm optimization, global vision of particle swarm optimization with inertia weight, differential evolution, and improved differential evolution. From result comparisons of the test systems, the proposed ASCSA method has obtained lower total costs than other methods implemented for solving the problems. Therefore, the proposed ASCSA is a very efficient and favorable method for solving the considered hydrothermal scheduling problems.