交通运输系统工程与信息
交通運輸繫統工程與信息
교통운수계통공정여신식
JOURNAL OF COMMUNICATION AND TRANSPORTATION SYSTEMS ENGINEERING AND INFORMATION
2015年
1期
191-197
,共7页
白广争%郭进%石红国%杨扬%王秀玄
白廣爭%郭進%石紅國%楊颺%王秀玄
백엄쟁%곽진%석홍국%양양%왕수현
城市交通%优化模型%遗传算法%换乘站%候车客流
城市交通%優化模型%遺傳算法%換乘站%候車客流
성시교통%우화모형%유전산법%환승참%후차객류
urban traffic%optimization model%genetic algorithm%transfer station%number of waiting passengers
研究了高峰时段列车运行的衔接协调对换乘站候车客流量的优化问题。首先分析了换乘站各站台候车客流的组成因素,确定出各运行方向的换乘站台内客流量随时间变化的规律。然后,以时段内换乘站候车客流量的最大值最小为目标,建立优化模型。模型以站台最大可容纳候车人数为约束条件,以各方向列车在换乘站的到达时刻为调整对象,实现了高峰时段换乘站内聚集客流的优化。最后,针对验证案例,设计了遗传算法进行求解,得出了协调较优解,并给出与较劣解的对比分析。结果表明,该优化方法能够有效降低换乘站内的候车客流人数,可为网络化的优化协调工作提供参考。
研究瞭高峰時段列車運行的銜接協調對換乘站候車客流量的優化問題。首先分析瞭換乘站各站檯候車客流的組成因素,確定齣各運行方嚮的換乘站檯內客流量隨時間變化的規律。然後,以時段內換乘站候車客流量的最大值最小為目標,建立優化模型。模型以站檯最大可容納候車人數為約束條件,以各方嚮列車在換乘站的到達時刻為調整對象,實現瞭高峰時段換乘站內聚集客流的優化。最後,針對驗證案例,設計瞭遺傳算法進行求解,得齣瞭協調較優解,併給齣與較劣解的對比分析。結果錶明,該優化方法能夠有效降低換乘站內的候車客流人數,可為網絡化的優化協調工作提供參攷。
연구료고봉시단열차운행적함접협조대환승참후차객류량적우화문제。수선분석료환승참각참태후차객류적조성인소,학정출각운행방향적환승참태내객류량수시간변화적규률。연후,이시단내환승참후차객류량적최대치최소위목표,건립우화모형。모형이참태최대가용납후차인수위약속조건,이각방향열차재환승참적도체시각위조정대상,실현료고봉시단환승참내취집객류적우화。최후,침대험증안례,설계료유전산법진행구해,득출료협조교우해,병급출여교렬해적대비분석。결과표명,해우화방법능구유효강저환승참내적후차객류인수,가위망락화적우화협조공작제공삼고。
Optimization for the number of waiting passengers in transfer station by coordinating trains’ arriving time in the rush hour is studied. Firstly, it analyzes each factor which had influence on the passengers in each platform, and obtains formulas to describe the variation of waiting passengers with time in each direction. Secondly, it establishes the optimization model which minimizes the maximum of total waiting passengers during the study period. The model takes the site capacity as constraints, and takes trains’ arrival time in each direction in transfer station as adjustment object. Finally, the model is validated by an example, and genetic algorithm is designed to search the optimal solutions. It also obtains some worse solutions for contrast. By contrast, the optimal solutions can effectively reduce the number of waiting passengers in transfer station. The study can provide a reference for network coordination.