A method of the people-serving police station location problem

2019 2nd International Conference on Advanced Materials, Intelligent Manufacturing and Automation

Lu, Peng^1 ; Wang, Jijin^1 ; Ning, Weixun^1 ; Xiao, Xiaoqiang^1

Department of Computer Science, National University of Defence and Technology, Changsha, Hunan

410000, China^1

关键词: Binary integer programming;    Police station;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/569/5/052106/pdf
DOI  :  10.1088/1757-899X/569/5/052106

来源: IOP

【 摘 要 】

The people-serving police station location problem targets to optimize the location of the police stations and minimize total costs. However, it is very difficult to directly give the solution to the problem. To solve the problem, a method of extending demand points is proposed, which can convert the original problem into a binary integer programming problem. By randomly generating maps, the GNU linear programming kit (GLPK) package is used to solve and verify the converted method.