摘要

Positioning of valves is a real-life issue in Water Distribution System (WDS) design and, currently, it is usually addressed by hydraulic engineers either by hand or by means of genetic algorithms, that give no assurance of optimality. Since a given valves placement identifies a sectorization of the WDS in several isolable portions, the valves positioning problem can be seen as a variant of the well known graph partitioning problem, which is a hard combinatorial problem. Cattafi et al. (2011, TPLP, 11, 731-747) showed recently that Computational Logic can provide technologies and techniques that can be exploited to model and achieve the optimal partition of the water network (i.e. the optimal positioning of valves). In particular, the authors tackled the optimization of the valves positioning through a two player game model, giving a Constraint Logic Programming formalization to solve it effectively. The aim of this article, instead, is to investigate the potential of Answer Set Programming in this practical application; evaluation is in terms both of language expressivity and solving efficiency. Results are discussed for different ASP models and a comparison with the CLP(FD) technique shown by Cattafi et al. (2011, TPLP, 11, 731-747) will be given.

  • 出版日期2015-12