Taking the supplying regions as rows of the bigraph, the optimum scheme for looped grids feeder arrangement with minimum cost is obtained by a minimum weight match algorithm of bigraph.
以联络线的建设费用最小为目标函数,将
分区作为偶图的2列,采用最小权匹配算法
到"手拉手"环状网的最优配对结果。
Taking the supplying regions as rows of the bigraph, the optimum scheme for looped grids feeder arrangement with minimum cost is obtained by a minimum weight match algorithm of bigraph.
以联络线的建设费用最小为目标函数,将分区作为偶图的2列,采用最小权匹配算法到"手拉手"环状网的最优配对结果。
声明：以
、词性分类均由互联网资源自动生成，部分未经过人工审核，其表达内容亦不代表本软件的观点；若发现问题，欢迎向我们指正。
