黔南民族师范学院学报
黔南民族師範學院學報
검남민족사범학원학보
THE LEARNED JOURNAL OF THE QIANNAN NORMAL COLLEGE OF NATIONALITIES
2012年
3期
118-124
,共7页
数学建模%图与网络规划%距离矩阵%CUMCM%交巡警
數學建模%圖與網絡規劃%距離矩陣%CUMCM%交巡警
수학건모%도여망락규화%거리구진%CUMCM%교순경
mathematical modeling%graph and network programming%distance matrix%CUMCM%traffic and patrol police
对2011年全国大学生数学建模竞赛B题的问题建模和解决进行研究。依据赛题提供的“附件2”建立描述市区交通网络图的权矩阵，采用求最短路的Dijstra算法求出市区任意两节点的最短路径及路长，构作最佳路径阵和距离矩阵，并以此为基点分别建立描述各问题的数学模型，给出模型求解的方案、算法和计算的结果。
對2011年全國大學生數學建模競賽B題的問題建模和解決進行研究。依據賽題提供的“附件2”建立描述市區交通網絡圖的權矩陣，採用求最短路的Dijstra算法求齣市區任意兩節點的最短路徑及路長，構作最佳路徑陣和距離矩陣，併以此為基點分彆建立描述各問題的數學模型，給齣模型求解的方案、算法和計算的結果。
대2011년전국대학생수학건모경새B제적문제건모화해결진행연구。의거새제제공적“부건2”건립묘술시구교통망락도적권구진，채용구최단로적Dijstra산법구출시구임의량절점적최단로경급로장，구작최가로경진화거리구진，병이차위기점분별건립묘술각문제적수학모형，급출모형구해적방안、산법화계산적결과。
The paper is studying about modeling and solving for the problem B in 2011 mathematical contest. According to ＂Appendix 2＂ pro- vided in the contest, weight matrix of the traffic network diagram of the urban district is established. The shortest path and path lengths between any two points in urban district are obtained by using Dijkstrag algorithm for the shortest path, constructing the best path matrix and distance matrix. Mathematical models of describing each problem are established as the basic point respectively. And model solution schemes and algorithms and calculated results are given.
