期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

网络环境下城市步行街选址研究

Study on the Location of Urban Pedestrian Street within Network Environment
下载PDF
导出
摘要 研究了网络环境下城市步行街选址,属于路径型或弧形设施的选址问题,考虑了不同步行街间的市场份额划分和步行街数目越多市场购买力越大的问题,同时也考虑了步行街建立的门槛问题,基于以上问题建立了数学规划模型,并运用贪婪算法求解模型。 The paper studies the location problem of urban pedestrian streets within the network environment, considers the market share allocation between different pedestrian streets as well as the fact that the greater the number of pedestrian streets is, the greater the purchasing power of the market is and also takes into account the entry problem of the construction of pedestrian streets. Based on these considerations, a mathematical planning model is established and greedy algorithm is employed for its solution.
作者 周祖才
机构地区 湖北交通职业技术学院计算机系
出处 《物流技术》 2011年第11期83-84,102,共3页 Logistics Technology
关键词 步行街选址 效用函数 贪婪算法 pedestrian street location utility function greedy algorithm
分类号 TU984.13 [建筑科学—城市规划与设计]
  • 相关文献

参考文献13

  • 1Morgan C A, Slater P J. A linear algorithm for a core of a tree[J].Journal of Algorithms 1980,(1):247-258.
  • 2Hakimi S L,Schmeichel E F,Labbe M.On locating pathor tree-shaped facilities on networks[J]. Networks,1993,23(6) : 543-555.
  • 3George J W, Revelle C S. Bi-Objective Median Subtree Location Problems[J]. Annals of Operations Research, 2003,122:219-232.
  • 4肖鹏,徐寅峰,代文强.城市交通网络中商业街的选址分析与计算[J].系统工程,2007,25(8):49-53. 被引量：1
  • 5Wang H L, Chao K M. The 2-radius and 2-radiian problems on trees[J]. Theoretical Computer Science, 2008,407:524-531.
  • 6Puerto J, Ricca F, Seozzari A. Extensive facility location problems on networks with equity measures[J]. Discrete Applied Mathematics, 2009,157:1 069-1 085.
  • 7Tamir A, Puerto J, Mesa J A, Rodriguez-Chia A M. Conditional location of path and tree shaped facilities on trees [J]. Journal of algorithms, 2005,56:50-75.
  • 8Bhattacharya B, Shi Q S, Tamir A. Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees [J]. Algorithmica, 2009, 55:601-618.
  • 9Puerto J, Rodriguez-Chia A M, Tamir A, Perez-Brito D. The Bi-Criteria Doubly Weighted Center-Median Path Problem on a Tree [J]. NETWORKS, 2006,47(4):237-247.
  • 10Wang B F, Lin T C, Lin C H, Ku S C. Finding the conditional location of a median path on a tree [J]. Information and Computation,2008,206: 828-839.

二级参考文献12

  • 1杨春燕.成都市春熙路步行街现状及发展对策研究[J].新建筑,2001(3):25-28. 被引量：9
  • 2Garey M R, et al. Computers and intractability:a guide to the theory of NP-completeness[M]. San Francisco, CA: Freeman, 1979.
  • 3Kariv O, et al. An algorithm approach to network location problems. Part II:The p-medians[J]. SIAM J. Appl. Math. ,1979,37:539-560.
  • 4Drezner Z,Hamacher H. Facility location,application and theory[M]. Springer,2002.
  • 5Hedetniemi S M, Cockaine E J, Hedetniemi S T.Linear algorithms for finding the Jordan center and path center of a tree [J], Transport. Sci. ,1981,15: 98-114.
  • 6Minieka E. The optimal location of a path or tree in a tree network[J]. Networks, 1985,15 : 309-321.
  • 7Hakimi S L,Schmeichel E F,Labbe M. On locating path or tree shaped facilities on networks[J]. Networks, 1993,23 : 543-555.
  • 8Wang B F. Efficient parallel algorithms for optimally locating a path and a tree of a specified length in a weighted tree network [J]. Journal of Algorithm, 2000,34:90-108.
  • 9Tamir A, Puerto J, Perez-Brito D. The centdian subtree on tree networks [J]. Disc. Appl. Math. , 2002,118:263-278.
  • 10Tamir A,Puerto J,Mesa J A,Rodriguez-Chia A M. Conditional location of path and tree shaped facilities on trees[J]. Journal of Algorithm,2005,56:50-75.

共引文献3

物流技术
2011年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部