基于能力约束的多车种空车动态调整方法OA北大核心CSCDCSTPCD
Multi-type empty car dynamic distribution method based on capacity constraints
引入空车时空服务网络来描述铁路运输动态变化特性，同时考虑到实际运输生产中的能力约束，并据此建立了基于能力约束的动态规划模型。模型的目标函数考虑了与时间因素相关的空车滞留费用和需求未满足时的惩罚费用等相关费用，同时考虑了多个车种之间的替代费用。模型的能力约束条件考虑了网络弧段的通过能力、空车提供站的发送空车能力和空车需求站的接收空车能力。考虑网络径路绕行的情况，设计了融合K 短路算法的模拟退火算法，并采用了两步法的优化策略进行求解。最后对一个简单的路网进行了验证，结果表明融合K 短路算法可以在能力约束条件下得到较好的收益。
Empty car service network of time and space is proposed to cater for the dynamic char-acteristic of railway transportation system,and the dynamic programming model based on capaci-ty constraints is proposed considering the actual transport capacity constraints in the production. Empty car stranded costs and unsatisfied demand penalty costs related to time factor,car substi-tution costs are considered in obj ect function.Railway network arc carrying capacity,empty car supporting and needing stations'capacity are all concluded in the restrain conditions of the formu-lation.A simulated annealing (SA)algorithm integrating K shortest path algorithm is designed, and a two steps optimization strategy is proposed to solve the problem.Finally,a simple network is to verify the model,and the results indicate that the integrating K shortest path algorithm can get preferable revenue under capacity constraints.
张红斌;董宝田;孙远运
北京交通大学 交通运输学院，北京 100044 中国铁路信息技术中心，北京 100844北京交通大学 交通运输学院，北京 100044
交通工程
铁路运输能力约束多车种空车动态调整时空服务网络模拟退火算法
railway transportationcapacity constraintsmulti-type empty car dynamic distribu-tionservice network of time and spacesimulated annealing algorithm
《北京交通大学学报》 2016 (6)
50-56,7
中国铁路总公司科技研究开发计划项目资助(2014X009-A,2016X006-D)
评论