Distribution Network Characteristics in Rough Set Approach

摘要

Distribution network optimizing includes a set of issues, such as shortest path DA, PDM, minimal spanning tree MST, the maximum flow MF, cheapest BG flow most numerous association of CMP, the traveling salesman problem TSP, etc.[l, 3, 5, 7-9]. In most of practical implementations of these problems distribution network play a crucial role that is, individual connections (segments between nodes) and their characteristics. These connections should be kept in proper readiness, especially those that are most exploited, that means probably those, the use of which brings the greatest benefits or for other reasons, their exploitation is reasonable. The aim of study is the categorization of the validity of connections in distribution networks.