Multiple-reservoir scheduling using β-hill climbing algorithm

21Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

Abstract

The multi-reservoir systems optimization problem requires defining a set of rules to recognize the water amount stored and released in accordance with the system constraints. Traditional methods are not suitable for complex multi-reservoir systems with high dimensionality. Recently, metaheuristic-based algorithms such as evolutionary algorithms and local search-based algorithms are successfully used to solve the multi-reservoir systems. β-hill climbing is a recent metaheuristic local search-based algorithm. In this paper, the multi-reservoir systems optimization problem is tackled using β-hill climbing. In order to validate the proposed method, four-reservoir systems used in the literature to evaluate the algorithm are utilized. A comparative evaluation is conducted to evaluate the proposed method against other methods found in the literature. The obtained results show the competitiveness of the proposed algorithm.

Cite

CITATION STYLE

APA

Alsukni, E., Arabeyyat, O. S., Awadallah, M. A., Alsamarraie, L., Abu-Doush, I., & Al-Betar, M. A. (2021). Multiple-reservoir scheduling using β-hill climbing algorithm. Journal of Intelligent Systems, 28(4), 559–570. https://doi.org/10.1515/jisys-2017-0159

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free