随机网络的α最短路径问题  

Study on the α-shortest Path Problem of Stochastic Network

作　　者：陈亮 梁后军[2] Chen Liang;Liang Hou-jun(Transportation Service Department,Bengbu Automobile NCO Academy,Bengbu Anhui 233011,China;Management Science and Engineering Institute,Anhui University of Finance and Economics,Bengbu Anhui 233000,China)

机构地区：[1]蚌埠汽车士官学校运输勤务系,安徽蚌埠233011 [2]安徽财经大学管理科学与工程学院,安徽蚌埠233000

出　　处：《后勤工程学院学报》2016年第4期92-96,共5页Journal of Logistical Engineering University

基　　金：国家社会科学基金项目(13GJ003-069)

摘　　要：为了求解随机网络中满足置信度为α的最短路径问题,提出了一种BP神经网络遗传算法。首先给出了随机网络的定义,建立了α最短路径模型;然后采用BP神经网络拟合非线性函数,遗传算法优化BP神经网络输出的方法求解该问题。实验结果表明,提出的模型和算法能有效求解随机网络的α最短路径问题。In order to solve the shortest path problem of stochastic network to meet the confidence level of α, a genetic algo-rithm of BP neural network was proposed to address the α-shortest path problem of a stochastic network. In this paper, the definitionof stochastic network was given and the α-shortest path model was established. The nonlinear function fit BP neural network for theproblem and then the output of BP neural network was optimized by genetic algorithm. The simulation experiment shows that the pro-posed model and algorithm can effectively solve the α?shortest path problem of the stochastic network.

关 键 词：α最短路径 随机网络 BP神经网络 遗传算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]