摘要
论述客运专线客运站中列车到发线和进路占用时间范围的确定方法,并在充分考虑客运站咽喉能力的限制和旅客的换乘要求的基础上,建立到发线运用计划编制的0-1整数规划模型。然后根据软约束和硬约束的不同影响,设计一种适应于上述0-1规划模型的启发式算法,此算法将每次的搜索空间限制为可用到发线集,大大减小搜索空间,提高搜索效率。最后利用此算法对实例进行验证。
It was analysed the method of getting time for occupying siding and route in detail. It was built a 0-1 integer programming model in consideration of the gullet capacity and transferring. It was built a heuristics algorithm, according to the different effect of soft limitation and hard limitation. The heuristics algorithm only searched available sidings, reduced the searching space and improve the searching efficiency. Finally, it was solved this problem by the heuristics algorithm and this method was verified by an actual example.
出处
《铁路计算机应用》
2008年第2期8-10,共3页
Railway Computer Application
基金
国家自然科学基金(60634010)
关键词
客运站
到发线运用
旅客换乘
启发式算法
passenger stations
utilization of arrival and departure track
transfer
heuristics algorithms