Abstract
Abstract A new efficient algorithm to solve the long-term hydro-scheduling problem (LTHSP) is presented in this paper. The algorithm is based on using the short-term memory of the Tabu search (TS) approach to solve the nonlinear optimization problem in continuous variables of the LTHSP. The paper introduces new rules for generating feasible solutions with an adaptive step vector adjustment. Moreover, a Tabu list for the continuous variables has been designed. The proposed implementation contributes to the enhancement of speed and convergence of the original Tabu search algorithm (TSA). A significant reduction in the objective function over previous classical optimization methods and a simulated annealing algorithm has been achieved. Moreover, the proposed TS requires less iterations to converge than simulated annealing. The proposed algorithm has been applied successfully to solve a system with four series cascaded reservoirs. Numerical results show an improvement in the solution compared with 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.
