Genetic Programming in Hydrology

Using genetic programming in conceptual modelling

Student Report (2017)
Author(s)

J.G.V. van Ramshorst (TU Delft - Civil Engineering & Geosciences)

Contributor(s)

Huub Savenije – Mentor

GHW Schoups – Mentor

V Babovic – Mentor

Faculty
Civil Engineering & Geosciences
Copyright
© 2017 Justus van Ramshorst
More Info
expand_more
Publication Year
2017
Language
English
Copyright
© 2017 Justus van Ramshorst
Graduation Date
01-09-2017
Awarding Institution
Delft University of Technology, National University of Singapore
Project
['Additional thesis']
Programme
['Water Management']
Faculty
Civil Engineering & Geosciences
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

This report introduces the use of Genetic Programming (GP) into hydrology by describing the results of GP using conceptual hydrological models as physical representation. First the possibilities of GP are tested on synthetic data, which results in a shortlist of good working objective functions and insight in the most important GP settings. The test on real data in the Belgium Ardennes showed that GP using the objective functions KG10, MM and Shafii performed better. Nevertheless all three models performed not well on simulating the low flows and high peaks. Furthermore GP using KG10 and MM both results in simple serial models which perform well overall, but bad on quick response runoff. Shafii resulted in parallel models which show quick response flow, however GP it is not able to capture the fast responses correctly (yet). GP has the potential to improve the understanding in the behaviour of catchments, however it still needs the human mind to observe, compare and analyse the modelling results. The main consideration with GP is to look for a balance between: model search space, objective function, randomness and (computational) time. The challenge is how to lead GP in an efficient way without removing the possibility of finding unknown patterns.

Files

License info not available