Research Article of Journal of eSciences
Optimizing the Site Selection of Payment Stations Based on P-median Mathematical Model
Jiaying Yan1 *, Gaozhen Ni1
1College of Electrical Engineering & New Energy, China Three Gorges University, Yichang, 443002, China.
Site selection is one of the classic problems in operations research. In this research, starting from a mathematical modeling example, a model was established to solve the site selection problem of 6 toll points in 52 cells. Taking the shortest distance between the residential area and the toll station as the objective function, this paper introduced 0-1 variables, established the P-median site selection model, and transformed the residents’ payment query problem into a linear programming problem. The Lingo software was used to solve the problem of positioning the 6 points as 1, 6, 14, 26, 28 and 36. This paper successfully applies the site selection model to the site selection of toll station, which has certain reference value to the site selection in real life
Keywords: P-median Site Selection Model; Linear programming; Dijkstra algorithm
How to cite this article:
Jiaying Yan, Gaozhen Ni. Optimizing the Site Selection of Payment Stations Based on P-median Mathematical Model. Journal of eSciences, 2020; 3:10. DOI: 10.28933/esciences-2020-01-1605
References:
1. lian Wu. Research on the location selection of charging stations for electric vehicles based on the largest coverage in the broad sense [D]. Huazhong university of science and technology,2016.
2. Dongmei Yan. Research on location of urban logistics center [D]. Tianjin university,2004.
3. Fengmei Yang, Guowei Hua, Meng Deng, Jianqiang Li. Research progress on site selection [J]. Operations and management, 2005(06) :1-7.
Terms of Use/Privacy Policy/ Disclaimer/ Other Policies:
You agree that by using our site/services, you have read, understood, and agreed to be bound by all of our terms of use/privacy policy/ disclaimer/ other policies (click here for details).
CC BY 4.0
This work and its PDF file(s) are licensed under a Creative Commons Attribution 4.0 International License.