Home Optimization of Pumping Schedules Using the Genealogical Decision Tree Approach
Article
Licensed
Unlicensed Requires Authentication

Optimization of Pumping Schedules Using the Genealogical Decision Tree Approach

  • Enso Ikonen , István Selek and József Bene
Published/Copyright: February 17, 2012
Become an author with De Gruyter Brill

This paper examines the application of a particle filtering-based optimization technique, the genealogical decision trees (GDT), to a finite horizon pump scheduling problem in a water distribution network. The GDT approach for trajectory tracking is first introduced, and a modified algorithm for minimization of costs during pump sequence optimization is then presented. Several variants of the algorithm are suggested, using the extended end constraint and neutrality. The performance of the optimization in various algorithm and parameter settings is examined in extensive simulations. It was observed that both the extended end constraint and neutrality improved the performance, however the deviation between solutions within a population and between different runs remained uncomfortably large. Finally, a comparison with a number of alternative up-to-date optimization techniques is provided. It was observed that the performance of GDT was adequate, compared with the best available approaches.

Published Online: 2012-2-17

©2012 Walter de Gruyter GmbH & Co. KG, Berlin/Boston

Downloaded on 30.11.2025 from https://www.degruyterbrill.com/document/doi/10.1515/1934-2659.1629/pdf
Scroll to top button