带机会约束的警务调度模型及其解法  

Chance Constrained Police Force Dispatch Model and Its Algorithm

作　　者：黄沙日娜[1] 赵国亮[1] 刘莹[1] 任秋萍[1] 

机构地区：[1]黑龙江科技大学理学院,黑龙江哈尔滨150022

出　　处：《数学的实践与认识》2014年第3期31-36,共6页Mathematics in Practice and Theory

基　　金：黑龙江省教育厅科学技术研项目

摘　　要：研究在紧急情况发生时,城市中不同交巡警服务平台的警务人员封锁指定区域的最优调度问题.把交巡警服务平台到达指定要道的时间视为满足正态分布的随机变量,从而建立了满足机会约束的警务调度模型并将该模型等价地转化为极小极大模型.给出了模型的求解算法及其计算复杂度.最后,通过一个数值例子来说明算法的有效性.This paper considers the optimal police force dispatch model which aims to block the specified region in the shortest time when emergency occurred.In the newly proposed model,we assume that arrival time to specified place is a Gaussian distributed variable.Further,the police force dispatch model with chance constraint is transformed into a minmax model equivalently,the algorithm is given and it＇s complexity is studied.Finally,a numerical example is presented to illustrate the effectiveness of the proposed algorithm.

关 键 词：机会约束 广义指派问题 正态分布 极小极大模型 

分 类 号：D035.37[政治法律—政治学]