摘要
基于CUMCM-2011 B题中关于嫌疑犯的封堵问题的研究.通过建立描述市区交通网络图的权矩阵,采用求最短路的Dijstra算法求出市区任意两节点的最短路径及路长,构作最佳路径阵和距离矩阵,以此为基点建立封堵路口的最优调度方案模型,再在此基础上建立封堵住嫌疑犯的最优模型,并设计了模型求解的算法.将算法应用于CUMCM-2011 B题中关于嫌疑犯的封堵问题,获得最优封堵方案.
Based on the problem of blocking and intercepting the suspects in CUMCM- 2011 problem B is studied. Through establishing weight matrix of describing traffic network diagram the shortest path and path lengths are obtained by using Dijkstra＇s algorithm for the shortest path, to construct the best path matrix and distance matrix. A model of optimal scheme of blocking and intercepting intersections is established as the basic point. And on the basis, the optimal model of blocking and intercepting the suspects is established. An algorithm for the model solution was designed. The application of the algorithm to the problem of blocking and intercepting the suspects in CUMCM-2011 problem B, the optimal blocking and intercepting scheme was obtained.
出处
《数学的实践与认识》
CSCD
北大核心
2013年第1期129-134,共6页
Mathematics in Practice and Theory
基金
黔南民族师范学院2010年教学改革项目(项目编号:jg-10-03)
2011年贵州省高等学校教学内容和课程体系改革重点项目"数学类专业的课程实验教学研究与实践"
关键词
数学建模
CUMCM
图与网络规划
距离矩阵
交巡警
mathematical modeling
graph and network programming
distance matrix
CUMCM
traffic and patrol police
