The algorithmic structure of a decision support system for a design of a district heating network

This paper is devoted to describe the algorithms implemented in a decision support system for the design of a district heating network. The design problem is formulated on a graph as the search for the minimum cost tree rooted at the source and spanning all the sinks. This search consists of two procedures: the first one finds, using greedy-like algorithms, an approximate solution which is subsequently improved in the second procedure, using local searches.