针对城市轨道交通车站进站设施瓶颈疏解缺乏系统的定量分析、成本模糊的问题,提出车站瓶颈定量分析模型,并在此基础上提出一种新优化策略。首先,建立乘客进站流程图,基于串联和并联混合的排队网络构建系统优化模型;其次,在现有优化策略基础上提出一种新的控制优化策略——变更设施序列,即交换安检设备和自动检票闸机的物理顺序;最后选取上海莘庄地铁站并根据两种优化策略给出具体优化方案,进行仿真实验。3种优化方案均有效减少了乘客排队时间,但总成本差异很大。到达率一定时,与无优化方案相比,优化方案1增加1台安检设备,减少了92.5%的等待时间,总成本增加了3.2%;优化方案2交换安检设备和闸机顺序,减少了80.3%的等待时间,总成本下降了50.4%;而优化方案3即方案1和2的叠加,几乎完全消除了乘客排队等待时间,但总成本却增加29.6%。结果分析表明,该模型能够很好地模拟瓶颈疏解成本,新策略在降低总成本上明显优于传统策略。
For the bottleneck relief of urban rail transit station infrastructure is lack of quantitative system analysis and its cost is uncertain, a quantitative analysis model for station bottleneck was put forward, and based on which a new optimization strategy was advanced. First of all, passenger train flow diagram was established, and based on the series-parallel hybrid queuing network system optimization model was constructed; secondly, on the basis of the existing optimization strategy, a new control optimization strategy was put forward: change sequence, namely exchange machine physical sequence of security check device and automatic ticket gate; lastly, in Shanghai Xinzhuang subway station according to the two kinds of optimization strategy, specific optimization schemes were advanced and then simulated. Three optimization schemes effectively reduce the passenger queuing time, but the total cost difference is very big. As for a certain arrival rate, compared with no optimization scheme, optimization scheme one with adding one security device reduced the waiting time by 92. 5%, increased the total cost by 3. 2%; optimization scheme two with exchanging the sequence of security check device and brake machine, reduced the waiting time by 80. 3%, decreased the total cost by 50. 4%; and optimization scheme three, the composition of scheme one and two, almost completely eliminated the queue waiting time, but increased the total cost by 29. 6%. The result analyses show that the proposed model can well simulate the bottleneck relief cost, and the new strategy is superior to the traditional strategy in reducing the total cost.