交巡警服务平台的评价及重大刑事案件的围堵方案  

Evaluation of Traffic and Patrol Police Service Platform and Design of Best Containment Plan for Great Criminal Cases

作　　者：郭德龙[1] 杨正清[1] 阳顺才 陈忠霞[1] 

机构地区：[1]黔南民族师范学院数学系,贵州都匀558000

出　　处：《广西科学院学报》2013年第1期66-68,共3页Journal of Guangxi Academy of Sciences

基　　金：国家民委科研基金项目(08GX01);广西自然科学基金项目(0832082);贵州省教育厅科研项目(黔教科2010093)资助

摘　　要：探讨2011年高教社杯全国大学生数学建模竞赛B题中某市现有的交巡警服务平台设置方案的合理性和该市在P处(第32个节点)发生了重大刑事案件的围堵方案。分析后认为,该市现有的交巡警服务平台设置方案不合理,建议采用增加服务台数和就近原则来加以改进。设计围堵方案是,先确定出3min后犯罪嫌疑人有可能到达的路口,再按就近原则进行围堵。由该围堵方案计算得到最短的围堵时间为176.94s。We investigated the rationality of the design scheme of current city traffic and patrol police service platform and the containment plan when the city in the P area （the 32nd node） faced great criminal cases, which came from B problem of 2011 higher education press cup national college mathematical modeling contest. The results indicated that the current design scheme of traffic and patrol police service platform was not reasonable, and suggested to improve the service by increasing platform numbers and the service principle nearby. The design scheme of containment was firstly to determine the intersection that the criminal sus pect could reach after 3 min of the committing, and then to conduct actions according to the principle of nearby containment. The shortest containment time was 176.94 s calculated by this plan.

关 键 词：交巡警服务平台 DIJKSTRA算法 评价 围堵方案 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] O24[自动化与计算机技术—控制科学与工程]