Application of neutrosophic minimum spanning tree in electrical power distribution network  

作　　者：Xiao Qun Liao Tong Su Li Ma 

机构地区：[1]Information&Network Center,Xi’an University of Science and Technology,Xi’an,Shaanxi 710054,People’s Republic of China

出　　处：《CAAI Transactions on Intelligence Technology》2020年第2期99-105,共7页智能技术学报（英文）

基　　金：This project was supported by the National Natural Science Foundation of China Research on the Precision Evaluation Model of Goaf Pressure Relief Gas Drainage Based on LSTM Regression no.(51804248);Science and Technology Project of State Grid Zizang Electric Power Co.,Ltd(SGXZJY00JHJS2000008);Research Technology Service of Multi Energy Complimentary Demonstration Application。

摘　　要：The problem of finding the minimum spanning tree(MST)is one of the most studied and important combinatorial optimisation problems in graph theory.Several types of uncertainties exist in real-life problems,which make it very hard to find the exact length of the arc.The neutrosophic set is an efficient tool to model and deal with the uncertainties in information due to inconsistent and indeterminate.In this study,the authors use triangular neutrosophic numbers to represent the edge weights of a neutrosophic graph for the MST problem in the neutrosophic environment.They call this problem a neutrosophic MST(NMST)problem.They formulate the NMST problem in terms of the linear programming model.Here,they introduce an algorithmic method based on a genetic algorithm for solving the NMST problem.They present the utility of triangular neutrosophic numbers as edge weights and their application in the electrical distribution network.

关 键 词：theory. SPANNING WEIGHTS 

分 类 号：O15[理学—数学]