z-logo
open-access-imgOpen Access
A method of the people-serving police station location problem
Author(s) -
Peng Lü,
Jijin Wang,
Weixun Ning,
Xiaoqiang Xiao
Publication year - 2019
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/569/5/052106
Subject(s) - integer programming , mathematical optimization , linear programming , computer science , facility location problem , integer (computer science) , binary number , operations research , mathematics , programming language , arithmetic
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here