Abstract
This paper presents a new simulated annealing algorithm (SAA) to solve the long-term hydro scheduling problem (LTHSP). A new algorithm for randomly generating feasible trial solutions is introduced. The problem is a hard nonlinear optimization problem in continuous variables. An adaptive cooling schedule and a new method for variables discretization are implemented to enhance the speed and convergence of the original SAA. A significant reduction in the number of the objective function evaluations, and consequently less iterations are required to reach the optimal solution. The proposed algorithm has been applied successfully to solve a system with four series cascaded reservoirs. Numerical results show an improvement in the solutions compared to previously obtained results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
