摘要
主要研究了基于GIS的连锁商业企业的商品配送服务信息系统中的一个基本问题———如何根据居民点的服务请求确定配送商品的连锁商店。首先根据引力模型对连锁商店的服务域进行了讨论,在忽略了连锁商店的规模影响的基础上,导出了Voronoi多边形的商店服务域,并确定了由最邻近居民点的连锁商店提供商品配送服务的原则。于是问题转化为如何快速计算最邻近居民点的连锁商店的技术问题。我们提出了Voronoi多边形空间查询的新方法,通过与点对欧氏距离、缓冲区结合欧氏距离两种方法的比较,证明了Voronoi多边形空间查询的高效率,新方法的应用显著地提升了应用系统的效率。
In this article,the authors discuss a major problem in GIS -based merchandise delivery information systems for a chain Store business company in Shanghai that is to determine the chain store to deliver the merchandise to the customer in any location of the city.According to the Retail Gravity Model,the authors propose a new approach,which is GIS-based chain store market analysis.From Retail Gravity model,the market areas of chain stores are the structure of Voronoi polygon while the size of chain store is ignored.The principle is that the nearest chain store should deliver the merchandise to inhabitant site.The problem is to quickly compute the distance between the nearest chain store and inhabitant site.A Voronoi polygon based new spatial query is suggested,which is the most efficiency arithmetic comparing with some traditional approaches such as Euclid distance,and the GIS buffer area operation.The new spatial query based on voronoi polygon method can avoid the burden of online computing and improve the performance of GIS-based application.
出处
《测绘科学》
CAS
CSCD
北大核心
2005年第5期62-64,共3页
Science of Surveying and Mapping
作者简介
王远飞（1963-），男，博士，副教授，主要从事GIS应用，地理数学建模等方面的研究工作。E-mail：yfwang@geo．ecnu．edu．cn
