中文摘要：

探讨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.