摘要
利用基于替换插入机制的设施服务区划分算法,以避难所为例研究了容量受限公共设施服务空间优化划分问题。将交通小区和城市主要公园等分别作为疏散单元和避难服务设施,以道路网络距离测度旅行成本,在设施容量受限、需求空间分布不均和总旅行成本最小等约束条件下划定了避难所服务范围。实验设计了两种情景,比较结果表明采用替换插入算法划分的避难所服务范围,能够降低总旅行成本,保证设施实际容量在规定范围以内,并能够最大程度上保持服务范围的空间连续性。
The paper proposes a shift-insertion algorithm to optimize service area division of capacitated public facilities. A case study on shelter is carried out in which traffic zones, major parks, and road network distance are considered as space demand units, service facilities, street travel cost, respectively. Then the shelters＇ service areas are partitioned under constraint of facility capacity, unevenness of space demand, and total travel cost circumstances. Two scenarios are designed in the experiment and comparative results show that shift- insertion algorithm can reduce travel cost of demand units, maintain the spatial continuity of service areas in dividing the service areas of shelters, and control the actual capacity of each shelter within its planned range.
出处
《城市规划》
CSSCI
北大核心
2015年第1期75-80,共6页
City Planning Review
基金
国家高技术研究发展计划专项研究基金项目(2013AA122302)“城市复杂时空数据集成分析与空间决策模拟”
关键词
替换插入
空间连续
避难所
容量受限
服务区划分
shift-insertion
spatial continuity
shelter
capacitated
service area division
