城市交通网络中商业街的选址分析与计算  

The Location of Business-Street in a City Traffic Network

作　　者：肖鹏[1] 徐寅峰[1] 代文强[2] 

机构地区：[1]西安交通大学管理学院 [2]电子科技大学管理学院,四川成都610054

出　　处：《系统工程》2007年第8期49-53,共5页Systems Engineering

基　　金：国家自然科学基金资助项目(70525004;70121001;70471035);博士点基金资助项目(20050698048)

摘　　要：商业街在城市交通网络体系中的选址是商业街布局的重要方面。本文提出交通网络商业街选址问题并建立数学模型,给出了两种选址原则:(1)城市中所有节点至商业街(只需要达到商业街的其中一个节点)之间的最短路径之和最小。(2)城市中所有点对之间过商业街的最短路径之和最小。针对以上两个方面,分别给出其计算方法,并进行了算法的时间和空间复杂性分析。The location of Business-Streets in transportation network is important. In this paper, we formulate the problem of Business-Street location, and give two principles, one objective function is to minimize the sum of the distances which are from all nodes to the Business-Street, and the other objective function is to minimize the sum of the distances of all-pairs paths which have to pass through the Business-Street. For two Business-Street locating problems, we show two algorithms and an analysis of the time complexities and space complexities, respectively.

关 键 词：商业街 选址问题 双子树 双子合并树 

分 类 号：O221[理学—运筹学与控制论] TB114[理学—数学]