z-logo
Premium
Using a hybrid genetic algorithm–simulated annealing algorithm for fuzzy programming of reservoir operation
Author(s) -
Chiu YuChen,
Chang LiChiu,
Chang FiJohn
Publication year - 2007
Publication title -
hydrological processes
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.222
H-Index - 161
eISSN - 1099-1085
pISSN - 0885-6087
DOI - 10.1002/hyp.6539
Subject(s) - simulated annealing , fuzzy logic , algorithm , computer science , hybrid algorithm (constraint satisfaction) , genetic algorithm , mathematical optimization , computation , scheme (mathematics) , stochastic programming , mathematics , artificial intelligence , machine learning , constraint programming , constraint logic programming , mathematical analysis
We present a novel approach for optimizing reservoir operation through fuzzy programming and a hybrid evolution algorithm, i.e. genetic algorithm (GA) with simulated annealing (SA). In the analysis, objectives and constraints of reservoir operation are transformed by fuzzy programming for searching the optimal degree of satisfaction. In the hybrid search procedure, the GA provides a global search and the SA algorithm provides local search. This approach was investigated to search the optimizing operation scheme of Shihmen Reservoir in Taiwan. Monthly inflow data for three years reflecting different hydrological conditions and a consecutive 10‐year period were used. Comparisons were made with the existing M‐5 reservoir operation rules. The results demonstrate that: (1) fuzzy programming could effectively formulate the reservoir operation scheme into degree of satisfaction α among the users and constraints; (2) the hybrid GA‐SA performed much better than the current M‐5 operating rules. Analysis also found the hybrid GA‐SA conducts parallel analyses that increase the probability of finding an optimal solution while reducing computation time for reservoir operation. Copyright © 2007 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here