| CUMCM-2011 B题的问题建模与求解 |
| |
| 引用本文： | 谢治州.CUMCM-2011 B题的问题建模与求解[J].黔南民族师范学院学报,2012,32(3):118-124. |
| |
| 作者姓名： | 谢治州 |
| |
| 作者单位： | 黔南民族师范学院数学系,贵州都匀,558000 |
| |
| 基金项目： | 黔南民族师范学院2010年教学改革项目，2011年贵州省高等学校教学内容和课程体系改革重点项目“数学类专业的课程实验教学研究与实践” |
| |
| 摘 要： | 对2011年全国大学生数学建模竞赛B题的问题建模和解决进行研究。依据赛题提供的"附件2"建立描述市区交通网络图的权矩阵,采用求最短路的Dijstra算法求出市区任意两节点的最短路径及路长,构作最佳路径阵和距离矩阵,并以此为基点分别建立描述各问题的数学模型,给出模型求解的方案、算法和计算的结果。
|
| 关 键 词： | 数学建模 图与网络规划 距离矩阵 CUMCM 交巡警 |
Modeling and Solving for the Problem B in CUMCM -2011 |
| |
| XIE Zhizhou.Modeling and Solving for the Problem B in CUMCM -2011[J].Journal of Qiannan Normal College of Nationalities,2012,32(3):118-124. |
| |
| Authors: | XIE Zhizhou |
| |
| Institution: | XIE Zhizhou (Dept.of Mathematics,Qiannan Normal College for Nationalities,Duyun 558000,China) |
| |
| Abstract: | The paper is studying about modeling and solving for the problem B in 2011 mathematical contest.According to " Appendix 2" provided 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 Dijkstra’s 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. |
| |
| Keywords: | mathematical modeling graph and network programming distance matrix CUMCM traffic and patrol police |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
