首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于GIS的连锁企业商品配送服务
引用本文:王远飞,朱海燕,叶雷.基于GIS的连锁企业商品配送服务[J].测绘科学,2005,30(5):62-64.
作者姓名:王远飞  朱海燕  叶雷
作者单位:华东师范大学教育部地理信息科学重点实验室,上海,200062;上海商学院,上海,200235
摘    要:主要研究了基于GIS的连锁商业企业的商品配送服务信息系统中的一个基本问题———如何根据居民点的服务请求确定配送商品的连锁商店。首先根据引力模型对连锁商店的服务域进行了讨论,在忽略了连锁商店的规模影响的基础上,导出了Voronoi多边形的商店服务域,并确定了由最邻近居民点的连锁商店提供商品配送服务的原则。于是问题转化为如何快速计算最邻近居民点的连锁商店的技术问题。我们提出了Voronoi多边形空间查询的新方法,通过与点对欧氏距离、缓冲区结合欧氏距离两种方法的比较,证明了Voronoi多边形空间查询的高效率,新方法的应用显著地提升了应用系统的效率。

关 键 词:GIS  Voronoi多边形  连锁商店  商品配送  算法
文章编号:1009-2307(2005)05-0062-03
收稿时间:2004-11-28
修稿时间:2004年11月28日

Application of GIS in merchandise delivery information system of chain stores
WANG Yuan-fei,ZHU hai-yan,YE Lei.Application of GIS in merchandise delivery information system of chain stores[J].Science of Surveying and Mapping,2005,30(5):62-64.
Authors:WANG Yuan-fei  ZHU hai-yan  YE Lei
Abstract: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.
Keywords:GIS  Voronoi polygon  Market area  Chain stores  Merchandise delivery  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号