对生成可行路线运用Floyd算法求得物资调运的最短路径
通过闭合回路法与位势法对初始可行解进行检验
①主要采取最小元素法及伏格尔法求初始基可行解
表上作业法
对运输问题运用表上作业法
本文通过将公路交通网转化为加权无向图
[2008-11-04]
http://www
paper
edu
cn/releasepaper/content/200811-43
发表期刊: 暂无
) Abstract: With a vast territory and varied climate, natural disasters occur frequently, especially in the Yangtze River each year, the Huaihe River, Nen River Basin, such as the outbreak of the often varying degrees of flooding
Well ahead of a flood of flood control materials, we reserve is one of the issues to be studied
This article by road transport network into a weighted undirected graph, and generate a viable route to generate a viable use of the road transport of goods Floyd algorithm to achieve the shortest path
Transport on the issue of the use of the operating table on the law, ① to take the smallest of the main elements of law and the Vogel law for the initial basic feasible solution; ② be in the initial basic feasible solution, through closed-loop method and potential method for initial feasible solution Inspection and use by the number of tests carried out on the program to determine strengths and weaknesses
Keywords: Floyd algorithm;Law on the operating table;The shortest path model 下载PDF阅读器 PDF全文下载: 初稿 ( 265 ) 作者简介: 通信联系人: 【收录情况】 中国科技论文在线: 周柳阳
Floyd算法的应用研究[EB/OL]
北京:中国科技论文在线
最短路径模型 antony * ( Computer Science and Technology,China University of Mining and Technology