【摘要】 本文采用最小生成树法,代替文献中常用的0,1规划法,解决了热源选址与热网布线问题。该方法的要点是,将热源的费用与热网的费用一起引入到树枝的权中;对于每一当前树,只计算那些与其相关联的边连网的权。随着树的不断扩大,权的计算范围也不断向外扩展。另外,该方法还具有计算原理简单、计算量少的特点。更多还原

【Abstract】 In the present paper a minimal spanning forest algorithm is employed for the location of heat source and design of distribution network instead of the widely-used 0,1 mixed programming. "Its main points aret 1. The weight of branch is composed of the cost of heat source and the cost of network; 2. For a current forest, only weight of the edge which are directly connected with the current forest is evaluted.As the forest expands,the range,in which the weight of edge is evaluated, also extends. In addition, the programming is simple in principle and short in operating time.更多还原