检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中山供电局,中山528400 [2]华北电力大学工商管理学院,北京100080 [3]郑州供电公司,郑州450007
出 处:《高电压技术》2008年第6期1161-1167,共7页High Voltage Engineering
基 金:国家自然科学基金(70771039)~~
摘 要:针对配电网规划综合决策中普遍存在的信息不完整和一致性难以满足的问题,改进了基于模糊区间层次分析法的配电网规划辅助决策方法,提出了计及残缺判断的模糊区间层次分析法(FAHP)。在提出的配电网规划整体框架的基础上,结合某个实例介绍了采用该方法进行方案确定的具体实现步骤:先通过FAHP得到主观权值,再对该值进行修正形成可变的综合权重,最后给出方案排序,并设计了相应的计算机递归算法,提高了排序的计算效率。实例计算表明,该方法更符合配电网规划的柔性要求,是一种实用和可行的配电网规划综合决策方法。In distribution network planning decisions the information is always not integrated, and it is also not coherence. In order to resolve this widespread problems of the imperfect and incoherent information in distribution network planning decisions, this paper improve a new method for aiding decision making based on the fuzzy analytic hierarchy process (FAHP) . The method takes the deformity into account and is used in distribution network plan ning. The paper puts forward the overall framework of distribution network planning, and accordingly gives the definite procedure of the project determine on the subject of a concrete case so that the method is used by the program to determine the achieved specific steps. First of all, subjective weights are obtained by using the fuzzy Analytic Hierarchy Process. Second, by means of amending the right of the subjective values, the integral variable weights is gotten. Finally, the paper gives the arrayed results of all projects. Meanwhile, the corresponding computer recursive algorithm is designed, thus, the efficiency of matrix array is improved. The method is used in a region to make distribution network planning decisions. The example shows that the method of distribution planning is more flexible, practical and feasible.
关 键 词:层次分析法(AHP) 模糊区间层次分析法(FAHP) 综合评价 配电网规划 残缺判断 一致性校验 辅助决策
分 类 号:TM715[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30