韦伯型设施区位的可计算模型及其应用
收稿日期: 2006-05-08
修回日期: 2006-07-04
网络出版日期: 2006-10-25
基金资助
国家自然科学基金项目 (40371007)
Research and Application of Weber Facility Location
Received date: 2006-05-08
Revised date: 2006-07-04
Online published: 2006-10-25
Supported by
National Natural Science Foundation of China, No.40371007
设施布局是城市规划中的热点问题,其中具有代表性的韦伯型设施区位应用广泛,能够于离散的空间点区位中配置设施的最佳位置,可解决诸多类型设施的选址问题。以多设施重心模型、最大福利模型和p-中心模型为例,从地计算的角度出发研究其模型及可计算方法。运用可视化开发工具Delphi 7.0作为开发平台,使用建立在OCX技术基础上的专业GIS控件MapObjects进行集成二次开发,建立设施区位分析系统,实现模型的计算及地理分析功能,并以上海市松江区新桥镇社会事业发展规划为例,运用该系统解决其社会事业发展对应设施选址问题。结果表明具有合理性,能够作为设施规划布局的辅助决策依据。
张颖,王铮,周嵬,刘筱,闫丹 . 韦伯型设施区位的可计算模型及其应用[J]. 地理学报, 2006 , 61(10) : 1057 -1064 . DOI: 10.11821/xb200610005
The facility distribution is a hot issue in the urban layout, in which the representative Weber facility location is widely applied. Weber facility location can collocate the facility the best position in a discrete space and may solve location problem of various facilities. From the point of view of geocomputation, it can be divided into free facility location issue and restrained facility location issue depending on whether the facility orientation scope is restricted, namely whether the space network architecture is considered. It can also be divided into spatial damping and spatial no damping depending on whether it will have mutual effects among spatial geographical entities because of the distance. Based on different classifications, the Multiple Centers-of-gravity model, the Benefit Maximizing model and the p-center model are selected as the examples and computational methods in this study. In view of Integration and Development, the visual development kit Delphi 7.0 is generated as the development platform using specialized GIS widget MapObjects based on the OCX technology and the analysis system of the facility location is established to realize the computation and geographic analysis function of each model. And taking the social enterprise development of Xinqiao county and Songjiang district of Shanghai as an example, utilizing this system, the location problem of facility corresponding to the social enterprises development is solved. The analysis and computation of various distributions of the commune hospitals, the senior-citizen universities and the police workstations fully manifest that the research conclusion can provide a quantitative policy-making basis for reasonable distribution of infrastructural construction.
Key words： Weber facility location; geocomputation; social enterprises; Shanghai
[1] Drezner Z, Wesolowsky G O. The Weber problem on the plane with some negative weights. Infor. Journal, 1991, 29: 87-99.
[2] Owen S H, Daskin M S. Strategic facility location: a review. European Journal of Operational Research, 1998, 111: 423-447.
[3] Wang Zheng, Deng Yue et al. Theoretical Economic Geography. Beijing: Science Press, 2002. 55-59.
[王铮, 邓悦 等. 理论经济地理学. 北京: 科学出版社, 2002. 55-59.]
[4] Ree P, Turton I. Geocomputation: solving geographical problems with computing power. Environment and Planning A, 1998, 30: 1835-1838.
[5] Wang Zheng. Research on Geocalculation of Analysis for City & Region Management. Beijing: Science Press, 2004. 269-333.
[王铮. 城市与区域管理分析的地计算研究. 北京: 科学出版社, 2004. 269-333.]
[6] Dobson J. A regional screening procedure for land use suitability analysis. The Geographical Review, 1979, 69: 224-234.
[7] Marks A P, Thrall G I, Arno M. Siting hospital to provide cost-effective health care. Geo. Info. Systems, 1992, 2: 58-66.
[8] Ribeiro A, Antunes P A. A GIS-based decision-support tool for public facility planning. Environment and Planning B: Planning and Design, 2002, 29: 553-569.
[9] Noon C E, Hankins C. Spatial data visualization in healthcare: supporting a facility location decision via GIS-based market analysis. 34th Annual Hawaii International Conference on System Sciences. 2001.
[10] Kuo R J, Chi S C, Kao S S. A decision support system for selecting convenience store location through integration of fuzzy AHP and artificial neural network. Computers in Industry, 2002, 47: 199-214.
[11] Cui Lili, Huang Tao, Wang Zheng. Research on the DSS models in "digital city": taking multisource Weber problem as an example. Remote Sensing Technology and Application, 2001, 16(4): 228-232.
[崔丽丽, 黄涛, 王铮. 数字城市中的决策支持模型的研究: 以多元韦伯区位模型为例. 遥感技术与应用, 2001, 16(4): 228-232.]
[12] Deng Yue, Wang Zheng, Liu Yang et al. Several geocomputation problems on tourism distribution center planning. Acta Geographica Sinica, 2003, 58(5): 781-788.
[邓悦, 王铮, 刘扬 等. 旅游集散地规划的地计算模型及案例. 地理学报, 2003, 58(5): 781-788.]
[13] Zhou Tianying, Jian Furen. Study on establishing the supporting system for location of the urgent refuge. Research of Soil and Water Conservation, 2001, 8(1): 17-24.
[周天颖, 简甫任. 紧急避难场所区位决策支持系统建立之研究. 水土保持研究, 2001, 8(1): 17-24.]
[14] Teitz M B, Bart P. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 1968, 16: 955-961.
[15] Ronald H B. Business logistics management: a supply chain perspective. Ohio: South-western College Pub., 2002.
[16] Wilson A G. A statistical theory of spatial distribution models. Transportation Research, 1967, 1: 253-267.
[17] Krumke S O. On a generalization of the p-Center problem. Information Processing Letters, 1995, 56: 67-71.
[18] Atsuo Suzuki, Zvi Drezner. The p-Center location problem in an area. Location Science, 1996, 4(1/2): 69-82.
[19] Daskin M. Network and Discrete Location. New York: Wiley, 1995.
[20] Kolesar P, Walker W E. An algorithm for the dynamic relocation of fire companies. Operations Research, 1974, 23: 249-274.
[21] Hu Zongtan. Conscientiously strengthen the infrastructure construction of city social enterprise. Development Research, 2005, (2): 555-560.
[胡宗潭. 切实加强城市社会事业基础设施建设. 发展研究, 2005, (2): 555-560.]
[22] Giannikos I. A multi-objective programming model for locating treatment sites and routing hazardous wastes. European Journal of Operational Research, 1998, 104: 333-342.
[23] Zhang F G, Melachrinoudis E. The maximin-maximum network location problem. Computational Optimization and Applications, 2001, 19: 209-234.
[24] Colebrook M, Gutierrez J. A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks. Computers & Operations Research, 2005, 32: 309-325.
/
| 〈 |
|
〉 |