Water network operational optimization: Utilizing symmetries in combinatorial problems by dynamic programming

Abstract

This paper introduces a dynamic programming (DP) approach for solving deterministic combinatorial operational optimization problem of water distribution networks. The implementation of dynamic programming over control domain using permutational symmetries is suggested to replace the state space based DP procedures. To enhance the understanding an application on a ub-network of the water supply and distribution network of the city of Sopron (Hungary) is presented which is sufficiently small to track the (pseudo) state space and approach related quantities.