Multiple-Reservoir Scheduling Using β-Hill Climbing Algorithm

Journal of Intelligent Systems 28 (4):559-570 (2019)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Structure optimization of reservoir networks.Benjamin Roeschies & Christian Igel - 2010 - Logic Journal of the IGPL 18 (5):635-669.
A polynomial time algorithm for Zero-Clairvoyant scheduling.K. Subramani - 2007 - Journal of Applied Logic 5 (4):667-680.
Development of direct-search strategies in hill-climbing problems.Kent L. Norman - 1983 - Bulletin of the Psychonomic Society 21 (6):469-472.

Analytics

Added to PP
2017-12-14

Downloads
111 (#158,925)

6 months
110 (#38,719)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references