吉首大学学报（自然科学版）2016，Vol.37Issue(4)：19-24,28,7.DOI:10.3969/j.cnki.jdxb.2016.04.005
可靠性约束函数未知的网路费用最小化快速求解
Fast Algorithm for Solving Cost Minimization Problem of Complex System with Unknown Constrained Reliability Function
摘要
Abstract
Aiming at the cost minimization problems of modern networks with unknown constrained relia‐bility function ,a fast solving algorithm is proposed based on the Monte Carlo Simulation (MCS) tech‐nique and the Support Vector Machine (SVM ) technique .The proposed algorithm uses MCS technique to obtain the reliability values of complex network ,and then uses Quantum Particle Swarm Optimization (DPSO ) algorithm to search for the global optimal minimal value .With the reliability information previ‐ously obtained by MCS ,the online SVM evaluation model of network reliability is constructed to deter‐mine the feasibility of the subsequent solutions ,reducing the MCS simulating frequencies and solving time .Experiment results verify that ,compared with Yeh's method and with 0 .01 reliability simulation precision ,the MCS frequencies and the solving time decrease by almost one order of magnitude .关键词
复杂网络/费用最小化/Monte Carlo仿真/支持向量机/DPSO算法/最优化Key words
complex network/cost minimization/Monte Carlo simulation/support vector machine/QPSO algorithm分类
信息技术与安全科学引用本文复制引用
陈丽,王景芹..可靠性约束函数未知的网路费用最小化快速求解[J].吉首大学学报（自然科学版）,2016,37(4):19-24,28,7.基金项目
国家自然科学基金资助项目 （）
