带有模糊流量限制的最大流问题  

Maximum flow problem with fuzzy flowrestrictions

作　　者：邓珍美 陈岩[1] 白晓莉 DENG Zhenmei;CHEN Yan;BAI Xiaoli(School of Science,Shenyang University of Technology,Shenyang 110870,China)

机构地区：[1]沈阳工业大学理学院,辽宁沈阳110870

出　　处：《商丘师范学院学报》2024年第6期29-34,共6页Journal of Shangqiu Normal University

基　　金：辽宁省科学技术厅科学技术计划项目(2019-ZD-0209)。

摘　　要：定义构造区间中智数的基本运算,提出中智逻辑并给出数学定义,通过概率论期望的概念提出中智数学期望的定义.结合图论,提出用区间中智数表示网络流中每条弧上的模糊信息,通过改进区间中智数运算并运用增广链算法调整流网络流量,给出中智最大流问题的中智线性规划模型.最后通过算例给出算法具体实现步骤,得到中智环境下的最大流以及流量的波动率,结果说明运算可行,算法合理有效.In this paper,the basic operation of neutroosphic number in the construction interval is defined,the neutrosophic logic is proposed and the mathematical definition is given,and the mathematical expectation is defined by the concept of probability expectation.Based on graph theory,this paper proposes that the fuzzy information on every arc in the network flow is represented by the neutrosophic number,and the network flow is adjusted by the improved neutrosophic number operation and the augmenting chain algorithm,the neutrosophic linear programming model for neutrosophic maximum flow problem is presented.Finally,an example is given to show the steps of the algorithm.The maximum flow and the fluctuation rate of the flow are obtained.The results show that the algorithm is reasonable and effective.

关 键 词：区间中智数 增广链算法 数学期望 中智最大流 

分 类 号：N37[自然科学总论]