摘要
研究在紧急情况发生时,城市中不同交巡警服务平台的警务人员封锁指定区域的最优调度问题.把交巡警服务平台到达指定要道的时间视为满足正态分布的随机变量,从而建立了满足机会约束的警务调度模型并将该模型等价地转化为极小极大模型.给出了模型的求解算法及其计算复杂度.最后,通过一个数值例子来说明算法的有效性.
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.
出处
《数学的实践与认识》
CSCD
北大核心
2014年第3期31-36,共6页
Mathematics in Practice and Theory
基金
黑龙江省教育厅科学技术研项目
关键词
机会约束
广义指派问题
正态分布
极小极大模型
chance constrained
generalized assignment problem
normal distribution
min-max model
