摘要
考虑到警务资源的有限性,以2011年全国大学生数学建模竞赛B题中的数据和假设为基础,根据图论中的Floyd算法和运筹学中的指派模型,研究了如何在突发情况下对指定地区进行快速全面封锁,建立了以时间优先为原则的指派模型。并利用MATLAB与LINGO编程求解,得到了完成调度的最短时间和最优调度方案。
Considering the limit of police resources,base on the data and assumption of Problem B in china undergraduate mathematical contest in modeling in 2011,how to blockade the designated area quickly and completely is researched by Floyd algorithm in graph theory and assignment model in operational research.The assignment model is created base on the principal of time priority.The shortest time and optimal decision of dispatching scheme are got by and LINGO.
出处
《科学技术与工程》
北大核心
2012年第1期126-128,共3页
Science Technology and Engineering
关键词
指派模型
FLOYD算法
合理调度
警务资源
assignment model Floyd algorithm reasonable dispatch police resources
